java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:52:05,685 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:52:05,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:52:05,699 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:52:05,699 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:52:05,700 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:52:05,700 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:52:05,702 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:52:05,703 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:52:05,704 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:52:05,705 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:52:05,705 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:52:05,706 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:52:05,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:52:05,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:52:05,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:52:05,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:52:05,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:52:05,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:52:05,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:52:05,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:52:05,716 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:52:05,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:52:05,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:52:05,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:52:05,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:52:05,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:52:05,720 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:52:05,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:52:05,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:52:05,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:52:05,721 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:52:05,732 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:52:05,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:52:05,733 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:52:05,734 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:52:05,734 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:52:05,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:52:05,734 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:52:05,734 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:52:05,735 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:52:05,735 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:52:05,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:52:05,735 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:52:05,735 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:52:05,736 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:52:05,736 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:52:05,736 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:52:05,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:52:05,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:52:05,736 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:52:05,737 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:52:05,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:52:05,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:52:05,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:52:05,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:52:05,785 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:52:05,789 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:52:05,791 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:52:05,791 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:52:05,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-02-04 02:52:05,917 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:52:05,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:52:05,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:52:05,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:52:05,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:52:05,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:52:05" (1/1) ... [2018-02-04 02:52:05,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fffaf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:05, skipping insertion in model container [2018-02-04 02:52:05,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:52:05" (1/1) ... [2018-02-04 02:52:05,944 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:52:05,959 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:52:06,048 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:52:06,060 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:52:06,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:06 WrapperNode [2018-02-04 02:52:06,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:52:06,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:52:06,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:52:06,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:52:06,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:06" (1/1) ... [2018-02-04 02:52:06,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:06" (1/1) ... [2018-02-04 02:52:06,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:06" (1/1) ... [2018-02-04 02:52:06,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:06" (1/1) ... [2018-02-04 02:52:06,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:06" (1/1) ... [2018-02-04 02:52:06,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:06" (1/1) ... [2018-02-04 02:52:06,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:06" (1/1) ... [2018-02-04 02:52:06,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:52:06,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:52:06,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:52:06,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:52:06,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:06" (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:52:06,123 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:52:06,123 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:52:06,123 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 02:52:06,123 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:52:06,123 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:52:06,124 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:52:06,124 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:52:06,124 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:52:06,124 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:52:06,124 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 02:52:06,124 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:52:06,124 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:52:06,124 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:52:06,243 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:52:06,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:52:06 BoogieIcfgContainer [2018-02-04 02:52:06,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:52:06,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:52:06,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:52:06,247 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:52:06,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:52:05" (1/3) ... [2018-02-04 02:52:06,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60413bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:52:06, skipping insertion in model container [2018-02-04 02:52:06,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:52:06" (2/3) ... [2018-02-04 02:52:06,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60413bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:52:06, skipping insertion in model container [2018-02-04 02:52:06,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:52:06" (3/3) ... [2018-02-04 02:52:06,250 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-02-04 02:52:06,256 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:52:06,261 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 02:52:06,296 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:52:06,296 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:52:06,297 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:52:06,297 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:52:06,297 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:52:06,297 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:52:06,297 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:52:06,298 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:52:06,299 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:52:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 02:52:06,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 02:52:06,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:06,324 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:06,324 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 02:52:06,378 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:06,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:06,471 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:52:06,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:52:06,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:52:06,474 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:06,475 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:52:06,475 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-02-04 02:52:06,475 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:52:06,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:52:06,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:52:06,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:52:06,490 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 02:52:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:06,578 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 02:52:06,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:52:06,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 02:52:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:06,590 INFO L225 Difference]: With dead ends: 63 [2018-02-04 02:52:06,590 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 02:52:06,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:52:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 02:52:06,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 02:52:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 02:52:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 02:52:06,670 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 02:52:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:06,670 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 02:52:06,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:52:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 02:52:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:52:06,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:06,671 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:06,671 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:06,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 02:52:06,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:06,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:06,703 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:52:06,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:52:06,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:52:06,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:06,703 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:52:06,703 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= foo_~i~0 0)] [2018-02-04 02:52:06,703 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:52:06,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:52:06,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:52:06,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:52:06,705 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-04 02:52:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:06,734 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 02:52:06,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:52:06,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 02:52:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:06,737 INFO L225 Difference]: With dead ends: 60 [2018-02-04 02:52:06,738 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 02:52:06,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:52:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 02:52:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-04 02:52:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 02:52:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-04 02:52:06,744 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-04 02:52:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:06,744 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-04 02:52:06,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:52:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-04 02:52:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 02:52:06,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:06,745 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:06,745 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:06,745 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 02:52:06,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:06,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:06,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:52:06,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:52:06,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:06,859 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:52:06,859 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 282#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 283#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 284#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 31))] [2018-02-04 02:52:06,859 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:52:06,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:52:06,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:52:06,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:52:06,860 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-04 02:52:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:06,940 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 02:52:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:52:06,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 02:52:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:06,942 INFO L225 Difference]: With dead ends: 54 [2018-02-04 02:52:06,942 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 02:52:06,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:52:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 02:52:06,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 02:52:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 02:52:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-04 02:52:06,947 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-04 02:52:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:06,947 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-04 02:52:06,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:52:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-04 02:52:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 02:52:06,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:06,948 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:06,948 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:06,949 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 02:52:06,950 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:06,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:06,984 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:52:06,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:52:06,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:52:06,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:06,985 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:52:06,985 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= 1 (select |#valid| |main_~#mask~0.base|)), 397#(= 1 (select |#valid| |foo_#in~b.base|)), 398#(= 1 (select |#valid| foo_~b.base))] [2018-02-04 02:52:06,985 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:52:06,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:52:06,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:52:06,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:52:06,986 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-04 02:52:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:07,020 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 02:52:07,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:52:07,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 02:52:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:07,022 INFO L225 Difference]: With dead ends: 50 [2018-02-04 02:52:07,022 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 02:52:07,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:52:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 02:52:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 02:52:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 02:52:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 02:52:07,026 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-04 02:52:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:07,027 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 02:52:07,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:52:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 02:52:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 02:52:07,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:07,028 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] [2018-02-04 02:52:07,028 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 02:52:07,029 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:07,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:07,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:07,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-04 02:52:07,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:07,081 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:52:07,081 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= foo_~i~0 0), 504#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))] [2018-02-04 02:52:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:07,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:52:07,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:52:07,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:52:07,082 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-02-04 02:52:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:07,111 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-02-04 02:52:07,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:52:07,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 02:52:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:07,112 INFO L225 Difference]: With dead ends: 65 [2018-02-04 02:52:07,112 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 02:52:07,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:52:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 02:52:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-02-04 02:52:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 02:52:07,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-02-04 02:52:07,117 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-02-04 02:52:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:07,117 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-02-04 02:52:07,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:52:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-02-04 02:52:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 02:52:07,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:07,118 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:07,119 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:07,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-04 02:52:07,119 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:07,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:07,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:52:07,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:52:07,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:07,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:52:07,154 INFO L182 omatonBuilderFactory]: Interpolants [626#true, 627#false, 628#(<= 0 main_~i~1), 629#(<= 1 main_~i~1), 630#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-02-04 02:52:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:07,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:52:07,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:52:07,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:52:07,155 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-02-04 02:52:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:07,191 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-04 02:52:07,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:52:07,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 02:52:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:07,192 INFO L225 Difference]: With dead ends: 66 [2018-02-04 02:52:07,192 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 02:52:07,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:52:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 02:52:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-02-04 02:52:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 02:52:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 02:52:07,196 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2018-02-04 02:52:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:07,197 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 02:52:07,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:52:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 02:52:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 02:52:07,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:07,198 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] [2018-02-04 02:52:07,198 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:07,198 INFO L82 PathProgramCache]: Analyzing trace with hash -280350351, now seen corresponding path program 2 times [2018-02-04 02:52:07,199 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:07,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:07,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:07,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:52:07,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:07,251 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:52:07,252 INFO L182 omatonBuilderFactory]: Interpolants [752#(<= |foo_#in~size| 1), 753#(<= foo_~size 1), 754#(<= foo_~size (+ foo_~i~0 1)), 755#(<= foo_~size foo_~i~0), 756#(<= (+ foo_~size 1) foo_~i~0), 749#true, 750#false, 751#(= main_~i~1 0)] [2018-02-04 02:52:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:07,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:52:07,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:52:07,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:52:07,253 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 8 states. [2018-02-04 02:52:07,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:07,380 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-02-04 02:52:07,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:52:07,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 02:52:07,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:07,381 INFO L225 Difference]: With dead ends: 82 [2018-02-04 02:52:07,382 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 02:52:07,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:52:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 02:52:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-02-04 02:52:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 02:52:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-04 02:52:07,386 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2018-02-04 02:52:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:07,387 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-04 02:52:07,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:52:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-04 02:52:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:52:07,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:07,388 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:07,388 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-04 02:52:07,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:07,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:07,415 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:52:07,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:07,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 02:52:07,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:07,416 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:52:07,416 INFO L182 omatonBuilderFactory]: Interpolants [917#true, 918#false, 919#(= main_~i~1 0), 920#(<= main_~i~1 1)] [2018-02-04 02:52:07,416 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:52:07,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:52:07,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:52:07,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:52:07,417 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 4 states. [2018-02-04 02:52:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:07,442 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-02-04 02:52:07,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:52:07,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-04 02:52:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:07,443 INFO L225 Difference]: With dead ends: 98 [2018-02-04 02:52:07,444 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 02:52:07,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:52:07,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 02:52:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-02-04 02:52:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 02:52:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-04 02:52:07,447 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 31 [2018-02-04 02:52:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:07,447 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-04 02:52:07,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:52:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-04 02:52:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 02:52:07,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:07,448 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:07,448 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:07,448 INFO L82 PathProgramCache]: Analyzing trace with hash -193392944, now seen corresponding path program 1 times [2018-02-04 02:52:07,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:07,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:52:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 02:52:07,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:52:07,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:52:07,507 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:07,507 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:52:07,508 INFO L182 omatonBuilderFactory]: Interpolants [1104#(and (= foo_~i~0 0) (<= (+ |foo_#in~size| 1) foo_~i~0)), 1105#(<= (+ |foo_#in~size| 1) 0), 1100#true, 1101#false, 1102#(<= 0 main_~i~1), 1103#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-04 02:52:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 02:52:07,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:52:07,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:52:07,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:52:07,508 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-04 02:52:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:07,597 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-02-04 02:52:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:52:07,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-02-04 02:52:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:07,598 INFO L225 Difference]: With dead ends: 87 [2018-02-04 02:52:07,598 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 02:52:07,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:52:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 02:52:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 02:52:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 02:52:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 02:52:07,603 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 40 [2018-02-04 02:52:07,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:07,603 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 02:52:07,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:52:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 02:52:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 02:52:07,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:07,604 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:07,604 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:07,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1033895800, now seen corresponding path program 2 times [2018-02-04 02:52:07,605 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:07,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 02:52:07,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:07,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:52:07,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:07,670 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:52:07,670 INFO L182 omatonBuilderFactory]: Interpolants [1280#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 1281#(<= |foo_#in~size| 0), 1276#true, 1277#false, 1278#(<= 0 main_~i~1), 1279#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-04 02:52:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 02:52:07,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:52:07,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:52:07,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:52:07,671 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-02-04 02:52:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:07,718 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-04 02:52:07,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:52:07,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-02-04 02:52:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:07,719 INFO L225 Difference]: With dead ends: 90 [2018-02-04 02:52:07,719 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 02:52:07,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:52:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 02:52:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-02-04 02:52:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 02:52:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-02-04 02:52:07,723 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2018-02-04 02:52:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:07,723 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-02-04 02:52:07,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:52:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-02-04 02:52:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 02:52:07,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:07,725 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:07,725 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:07,725 INFO L82 PathProgramCache]: Analyzing trace with hash -821508032, now seen corresponding path program 3 times [2018-02-04 02:52:07,726 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:07,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 02:52:07,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:07,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 02:52:07,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:07,789 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:52:07,789 INFO L182 omatonBuilderFactory]: Interpolants [1456#false, 1457#(= foo_~i~0 0), 1458#(and (<= 1 foo_~i~0) (<= foo_~i~0 1)), 1459#(and (<= 2 foo_~i~0) (<= foo_~i~0 2)), 1455#true] [2018-02-04 02:52:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 02:52:07,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:52:07,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:52:07,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:52:07,790 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 5 states. [2018-02-04 02:52:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:07,831 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-04 02:52:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:52:07,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-04 02:52:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:07,832 INFO L225 Difference]: With dead ends: 93 [2018-02-04 02:52:07,832 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 02:52:07,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:52:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 02:52:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-02-04 02:52:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 02:52:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-04 02:52:07,835 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 52 [2018-02-04 02:52:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:07,835 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-04 02:52:07,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:52:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-04 02:52:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 02:52:07,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:07,836 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:07,836 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash -828115272, now seen corresponding path program 4 times [2018-02-04 02:52:07,837 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:07,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:52:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 02:52:07,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:07,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:52:07,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:07,921 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:52:07,921 INFO L182 omatonBuilderFactory]: Interpolants [1648#(<= foo_~size foo_~i~0), 1649#(<= (+ foo_~size 1) foo_~i~0), 1640#true, 1641#false, 1642#(= main_~i~1 0), 1643#(<= main_~i~1 1), 1644#(<= |foo_#in~size| 2), 1645#(<= foo_~size 2), 1646#(<= foo_~size (+ foo_~i~0 2)), 1647#(<= foo_~size (+ foo_~i~0 1))] [2018-02-04 02:52:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 02:52:07,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:52:07,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:52:07,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:52:07,922 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 10 states. [2018-02-04 02:52:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:08,032 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2018-02-04 02:52:08,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:52:08,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-02-04 02:52:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:08,034 INFO L225 Difference]: With dead ends: 128 [2018-02-04 02:52:08,034 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 02:52:08,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:52:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 02:52:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2018-02-04 02:52:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 02:52:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-04 02:52:08,038 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 58 [2018-02-04 02:52:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:08,038 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-04 02:52:08,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:52:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-04 02:52:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:52:08,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:08,048 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:08,048 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 1 times [2018-02-04 02:52:08,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:08,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 02:52:08,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:08,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:52:08,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:08,131 INFO L182 omatonBuilderFactory]: Interpolants [1904#(<= |foo_#in~size| 31), 1905#(<= main_~i~1 30), 1906#(<= main_~i~1 31), 1899#true, 1900#false, 1901#(<= |foo_#in~size| foo_~size), 1902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 31)), 1903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 32))] [2018-02-04 02:52:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 02:52:08,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:52:08,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:52:08,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:52:08,132 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 8 states. [2018-02-04 02:52:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:08,206 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-04 02:52:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:52:08,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-02-04 02:52:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:08,207 INFO L225 Difference]: With dead ends: 92 [2018-02-04 02:52:08,207 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 02:52:08,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:52:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 02:52:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 02:52:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 02:52:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-04 02:52:08,211 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 67 [2018-02-04 02:52:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:08,211 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-04 02:52:08,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:52:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-04 02:52:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 02:52:08,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:08,212 INFO L351 BasicCegarLoop]: trace histogram [10, 8, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:08,213 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:08,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1534196039, now seen corresponding path program 5 times [2018-02-04 02:52:08,213 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:08,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 02:52:08,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:08,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:52:08,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:08,291 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:52:08,291 INFO L182 omatonBuilderFactory]: Interpolants [2100#true, 2101#false, 2102#(<= 0 main_~i~1), 2103#(<= 1 main_~i~1), 2104#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 2105#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 2106#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 2107#(<= |foo_#in~size| 1)] [2018-02-04 02:52:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 02:52:08,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:52:08,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:52:08,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:52:08,292 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 8 states. [2018-02-04 02:52:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:08,373 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-02-04 02:52:08,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:52:08,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-02-04 02:52:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:08,374 INFO L225 Difference]: With dead ends: 101 [2018-02-04 02:52:08,374 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 02:52:08,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:52:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 02:52:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-02-04 02:52:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 02:52:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-02-04 02:52:08,378 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 82 [2018-02-04 02:52:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:08,378 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-02-04 02:52:08,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:52:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-02-04 02:52:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 02:52:08,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:08,379 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:08,379 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash -85555777, now seen corresponding path program 6 times [2018-02-04 02:52:08,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:08,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:52:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-04 02:52:08,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:08,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:52:08,458 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:08,458 INFO L182 omatonBuilderFactory]: Interpolants [2304#false, 2305#(= foo_~i~0 0), 2306#(<= foo_~i~0 1), 2307#(<= foo_~i~0 2), 2308#(and (<= 0 foo_~i~0) (<= foo_~i~0 2)), 2309#(and (<= 1 foo_~i~0) (<= foo_~i~0 3)), 2303#true] [2018-02-04 02:52:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-04 02:52:08,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:52:08,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:52:08,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:52:08,459 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 7 states. [2018-02-04 02:52:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:08,500 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-02-04 02:52:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:52:08,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2018-02-04 02:52:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:08,501 INFO L225 Difference]: With dead ends: 104 [2018-02-04 02:52:08,501 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 02:52:08,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:52:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 02:52:08,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-04 02:52:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 02:52:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-02-04 02:52:08,504 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 88 [2018-02-04 02:52:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:08,504 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-02-04 02:52:08,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:52:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-02-04 02:52:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 02:52:08,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:08,505 INFO L351 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:08,505 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash 414669047, now seen corresponding path program 7 times [2018-02-04 02:52:08,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:08,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 194 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-04 02:52:08,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:08,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:52:08,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:08,623 INFO L182 omatonBuilderFactory]: Interpolants [2516#true, 2517#false, 2518#(= main_~i~1 0), 2519#(<= main_~i~1 1), 2520#(<= main_~i~1 2), 2521#(<= |foo_#in~size| 3), 2522#(<= foo_~size 3), 2523#(<= foo_~size (+ foo_~i~0 3)), 2524#(<= foo_~size (+ foo_~i~0 2)), 2525#(<= foo_~size (+ foo_~i~0 1)), 2526#(<= foo_~size foo_~i~0), 2527#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-04 02:52:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 194 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-04 02:52:08,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:52:08,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:52:08,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:52:08,625 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 12 states. [2018-02-04 02:52:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:08,774 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-02-04 02:52:08,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:52:08,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-02-04 02:52:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:08,776 INFO L225 Difference]: With dead ends: 136 [2018-02-04 02:52:08,776 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 02:52:08,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:52:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 02:52:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-02-04 02:52:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 02:52:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-02-04 02:52:08,780 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 94 [2018-02-04 02:52:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:08,781 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-02-04 02:52:08,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:52:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-02-04 02:52:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 02:52:08,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:08,782 INFO L351 BasicCegarLoop]: trace histogram [16, 13, 12, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:08,782 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash 347418750, now seen corresponding path program 8 times [2018-02-04 02:52:08,783 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:08,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 02:52:08,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:08,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:52:08,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:08,888 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:52:08,888 INFO L182 omatonBuilderFactory]: Interpolants [2816#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 2817#(<= |foo_#in~size| 2), 2808#true, 2809#false, 2810#(<= 0 main_~i~1), 2811#(<= 1 main_~i~1), 2812#(<= 2 main_~i~1), 2813#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 2814#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 2815#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 02:52:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 02:52:08,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:52:08,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:52:08,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:52:08,889 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 10 states. [2018-02-04 02:52:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:08,976 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2018-02-04 02:52:08,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:52:08,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-02-04 02:52:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:08,977 INFO L225 Difference]: With dead ends: 143 [2018-02-04 02:52:08,978 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 02:52:08,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:52:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 02:52:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-02-04 02:52:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 02:52:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-02-04 02:52:08,982 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 124 [2018-02-04 02:52:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:08,983 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-02-04 02:52:08,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:52:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-02-04 02:52:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-02-04 02:52:08,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:08,984 INFO L351 BasicCegarLoop]: trace histogram [17, 14, 13, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:08,984 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:08,985 INFO L82 PathProgramCache]: Analyzing trace with hash 714000310, now seen corresponding path program 9 times [2018-02-04 02:52:08,985 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:09,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-04 02:52:09,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:09,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:52:09,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:09,099 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:52:09,100 INFO L182 omatonBuilderFactory]: Interpolants [3104#(and (<= 3 foo_~i~0) (<= foo_~i~0 3)), 3105#(and (<= foo_~i~0 4) (<= 4 foo_~i~0)), 3099#true, 3100#false, 3101#(= foo_~i~0 0), 3102#(and (<= 1 foo_~i~0) (<= foo_~i~0 1)), 3103#(and (<= 2 foo_~i~0) (<= foo_~i~0 2))] [2018-02-04 02:52:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-04 02:52:09,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:52:09,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:52:09,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:52:09,101 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 7 states. [2018-02-04 02:52:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:09,173 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-02-04 02:52:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:52:09,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-02-04 02:52:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:09,174 INFO L225 Difference]: With dead ends: 146 [2018-02-04 02:52:09,174 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 02:52:09,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:52:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 02:52:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-02-04 02:52:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 02:52:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-04 02:52:09,178 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 130 [2018-02-04 02:52:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:09,178 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-04 02:52:09,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:52:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-04 02:52:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-04 02:52:09,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:09,179 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 14, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:09,179 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1770915246, now seen corresponding path program 10 times [2018-02-04 02:52:09,180 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:09,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 02:52:09,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:09,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:52:09,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:09,334 INFO L182 omatonBuilderFactory]: Interpolants [3392#true, 3393#false, 3394#(= main_~i~1 0), 3395#(<= main_~i~1 1), 3396#(<= main_~i~1 2), 3397#(<= main_~i~1 3), 3398#(<= |foo_#in~size| 4), 3399#(<= foo_~size 4), 3400#(<= foo_~size (+ foo_~i~0 4)), 3401#(<= foo_~size (+ foo_~i~0 3)), 3402#(<= foo_~size (+ foo_~i~0 2)), 3403#(<= foo_~size (+ foo_~i~0 1)), 3404#(<= foo_~size foo_~i~0), 3405#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-04 02:52:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 02:52:09,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:52:09,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:52:09,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:52:09,335 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 14 states. [2018-02-04 02:52:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:09,512 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-02-04 02:52:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:52:09,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2018-02-04 02:52:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:09,513 INFO L225 Difference]: With dead ends: 184 [2018-02-04 02:52:09,513 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 02:52:09,514 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:52:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 02:52:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-02-04 02:52:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 02:52:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 185 transitions. [2018-02-04 02:52:09,517 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 185 transitions. Word has length 136 [2018-02-04 02:52:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:09,518 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 185 transitions. [2018-02-04 02:52:09,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:52:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2018-02-04 02:52:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 02:52:09,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:09,519 INFO L351 BasicCegarLoop]: trace histogram [23, 19, 18, 18, 18, 18, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:09,519 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:09,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1745720749, now seen corresponding path program 11 times [2018-02-04 02:52:09,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:09,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-04 02:52:09,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:09,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:52:09,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:09,662 INFO L182 omatonBuilderFactory]: Interpolants [3792#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 3793#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 3794#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 3795#(<= |foo_#in~size| 3), 3784#true, 3785#false, 3786#(<= 0 main_~i~1), 3787#(<= 1 main_~i~1), 3788#(<= 2 main_~i~1), 3789#(<= 3 main_~i~1), 3790#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3791#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-04 02:52:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-04 02:52:09,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:52:09,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:52:09,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:52:09,663 INFO L87 Difference]: Start difference. First operand 182 states and 185 transitions. Second operand 12 states. [2018-02-04 02:52:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:09,779 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2018-02-04 02:52:09,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:52:09,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-02-04 02:52:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:09,780 INFO L225 Difference]: With dead ends: 191 [2018-02-04 02:52:09,780 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 02:52:09,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:52:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 02:52:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-02-04 02:52:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 02:52:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-02-04 02:52:09,785 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 172 [2018-02-04 02:52:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:09,785 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-02-04 02:52:09,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:52:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-02-04 02:52:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-04 02:52:09,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:09,787 INFO L351 BasicCegarLoop]: trace histogram [24, 20, 19, 19, 19, 19, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:09,787 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash 655613349, now seen corresponding path program 12 times [2018-02-04 02:52:09,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:09,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-02-04 02:52:09,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:09,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:52:09,940 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:09,941 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:52:09,941 INFO L182 omatonBuilderFactory]: Interpolants [4176#false, 4177#(= foo_~i~0 0), 4178#(<= foo_~i~0 1), 4179#(<= foo_~i~0 2), 4180#(<= foo_~i~0 3), 4181#(<= foo_~i~0 4), 4182#(and (<= foo_~i~0 4) (<= 0 foo_~i~0)), 4183#(and (<= 1 foo_~i~0) (<= foo_~i~0 5)), 4175#true] [2018-02-04 02:52:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-02-04 02:52:09,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:52:09,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:52:09,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:52:09,942 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 9 states. [2018-02-04 02:52:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:10,026 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-02-04 02:52:10,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:52:10,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2018-02-04 02:52:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:10,027 INFO L225 Difference]: With dead ends: 194 [2018-02-04 02:52:10,027 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 02:52:10,027 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:52:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 02:52:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2018-02-04 02:52:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 02:52:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-02-04 02:52:10,031 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 178 [2018-02-04 02:52:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:10,031 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-02-04 02:52:10,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:52:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-02-04 02:52:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 02:52:10,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:10,033 INFO L351 BasicCegarLoop]: trace histogram [25, 21, 20, 20, 20, 20, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:10,033 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:10,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1948298333, now seen corresponding path program 13 times [2018-02-04 02:52:10,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:10,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 697 proven. 69 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-02-04 02:52:10,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:10,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:52:10,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:10,215 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:52:10,216 INFO L182 omatonBuilderFactory]: Interpolants [4576#(= main_~i~1 0), 4577#(<= main_~i~1 1), 4578#(<= main_~i~1 2), 4579#(<= main_~i~1 3), 4580#(<= main_~i~1 4), 4581#(<= |foo_#in~size| 5), 4582#(<= foo_~size 5), 4583#(<= foo_~size (+ foo_~i~0 5)), 4584#(<= foo_~size (+ foo_~i~0 4)), 4585#(<= foo_~size (+ foo_~i~0 3)), 4586#(<= foo_~size (+ foo_~i~0 2)), 4587#(<= foo_~size (+ foo_~i~0 1)), 4588#(<= foo_~size foo_~i~0), 4589#(<= (+ foo_~size 1) foo_~i~0), 4574#true, 4575#false] [2018-02-04 02:52:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 697 proven. 69 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-02-04 02:52:10,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:52:10,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:52:10,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:52:10,217 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 16 states. [2018-02-04 02:52:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:10,432 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2018-02-04 02:52:10,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:52:10,434 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2018-02-04 02:52:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:10,435 INFO L225 Difference]: With dead ends: 238 [2018-02-04 02:52:10,435 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 02:52:10,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:52:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 02:52:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-02-04 02:52:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 02:52:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 239 transitions. [2018-02-04 02:52:10,438 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 239 transitions. Word has length 184 [2018-02-04 02:52:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:10,439 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 239 transitions. [2018-02-04 02:52:10,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:52:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 239 transitions. [2018-02-04 02:52:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-02-04 02:52:10,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:10,440 INFO L351 BasicCegarLoop]: trace histogram [31, 26, 25, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:10,440 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1371544148, now seen corresponding path program 14 times [2018-02-04 02:52:10,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:10,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1404 proven. 70 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-02-04 02:52:10,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:10,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:52:10,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:10,623 INFO L182 omatonBuilderFactory]: Interpolants [5088#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 5089#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 5090#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 5091#(<= |foo_#in~size| 4), 5078#true, 5079#false, 5080#(<= 0 main_~i~1), 5081#(<= 1 main_~i~1), 5082#(<= 2 main_~i~1), 5083#(<= 3 main_~i~1), 5084#(<= 4 main_~i~1), 5085#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 5086#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 5087#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 02:52:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1404 proven. 70 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-02-04 02:52:10,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:52:10,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:52:10,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:52:10,624 INFO L87 Difference]: Start difference. First operand 236 states and 239 transitions. Second operand 14 states. [2018-02-04 02:52:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:10,747 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-02-04 02:52:10,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:52:10,747 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 226 [2018-02-04 02:52:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:10,748 INFO L225 Difference]: With dead ends: 245 [2018-02-04 02:52:10,748 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 02:52:10,749 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:52:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 02:52:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-02-04 02:52:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 02:52:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 237 transitions. [2018-02-04 02:52:10,752 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 237 transitions. Word has length 226 [2018-02-04 02:52:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:10,753 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 237 transitions. [2018-02-04 02:52:10,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:52:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 237 transitions. [2018-02-04 02:52:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 02:52:10,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:10,754 INFO L351 BasicCegarLoop]: trace histogram [32, 27, 26, 26, 26, 26, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:10,754 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1000315148, now seen corresponding path program 15 times [2018-02-04 02:52:10,755 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:10,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 02:52:10,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:10,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:52:10,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:10,895 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:52:10,895 INFO L182 omatonBuilderFactory]: Interpolants [5584#(<= foo_~i~0 1), 5585#(<= foo_~i~0 2), 5586#(<= foo_~i~0 3), 5587#(<= foo_~i~0 4), 5588#(and (<= foo_~i~0 4) (<= 0 foo_~i~0)), 5589#(and (<= 1 foo_~i~0) (<= foo_~i~0 5)), 5590#(and (<= foo_~i~0 6) (<= 2 foo_~i~0)), 5581#true, 5582#false, 5583#(= foo_~i~0 0)] [2018-02-04 02:52:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 02:52:10,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:52:10,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:52:10,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:52:10,896 INFO L87 Difference]: Start difference. First operand 236 states and 237 transitions. Second operand 10 states. [2018-02-04 02:52:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:11,003 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2018-02-04 02:52:11,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:52:11,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 232 [2018-02-04 02:52:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:11,005 INFO L225 Difference]: With dead ends: 248 [2018-02-04 02:52:11,006 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 02:52:11,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:52:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 02:52:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2018-02-04 02:52:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 02:52:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 244 transitions. [2018-02-04 02:52:11,012 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 244 transitions. Word has length 232 [2018-02-04 02:52:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:11,012 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 244 transitions. [2018-02-04 02:52:11,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:52:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 244 transitions. [2018-02-04 02:52:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-04 02:52:11,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:11,014 INFO L351 BasicCegarLoop]: trace histogram [33, 28, 27, 27, 27, 27, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:11,014 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash 710278788, now seen corresponding path program 16 times [2018-02-04 02:52:11,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:11,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1112 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-02-04 02:52:11,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:11,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:52:11,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:11,320 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:52:11,321 INFO L182 omatonBuilderFactory]: Interpolants [6091#true, 6092#false, 6093#(= main_~i~1 0), 6094#(<= main_~i~1 1), 6095#(<= main_~i~1 2), 6096#(<= main_~i~1 3), 6097#(<= main_~i~1 4), 6098#(<= main_~i~1 5), 6099#(<= |foo_#in~size| 6), 6100#(<= foo_~size 6), 6101#(<= foo_~size (+ foo_~i~0 6)), 6102#(<= foo_~size (+ foo_~i~0 5)), 6103#(<= foo_~size (+ foo_~i~0 4)), 6104#(<= foo_~size (+ foo_~i~0 3)), 6105#(<= foo_~size (+ foo_~i~0 2)), 6106#(<= foo_~size (+ foo_~i~0 1)), 6107#(<= foo_~size foo_~i~0), 6108#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-04 02:52:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1112 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-02-04 02:52:11,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:52:11,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:52:11,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:52:11,323 INFO L87 Difference]: Start difference. First operand 242 states and 244 transitions. Second operand 18 states. [2018-02-04 02:52:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:11,621 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2018-02-04 02:52:11,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:52:11,621 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 238 [2018-02-04 02:52:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:11,623 INFO L225 Difference]: With dead ends: 298 [2018-02-04 02:52:11,623 INFO L226 Difference]: Without dead ends: 298 [2018-02-04 02:52:11,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:52:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-04 02:52:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2018-02-04 02:52:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-04 02:52:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2018-02-04 02:52:11,628 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 238 [2018-02-04 02:52:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:11,629 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2018-02-04 02:52:11,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:52:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2018-02-04 02:52:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-02-04 02:52:11,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:11,631 INFO L351 BasicCegarLoop]: trace histogram [40, 34, 33, 33, 33, 33, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:11,631 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:11,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1500368397, now seen corresponding path program 17 times [2018-02-04 02:52:11,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:11,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 2231 proven. 102 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-02-04 02:52:11,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:11,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:52:11,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:11,896 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:52:11,897 INFO L182 omatonBuilderFactory]: Interpolants [6720#false, 6721#(<= 0 main_~i~1), 6722#(<= 1 main_~i~1), 6723#(<= 2 main_~i~1), 6724#(<= 3 main_~i~1), 6725#(<= 4 main_~i~1), 6726#(<= 5 main_~i~1), 6727#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 6728#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 6729#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 6730#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 6731#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 6732#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 6733#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 6734#(<= |foo_#in~size| 5), 6719#true] [2018-02-04 02:52:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 2231 proven. 102 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-02-04 02:52:11,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:52:11,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:52:11,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:52:11,898 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 16 states. [2018-02-04 02:52:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:12,105 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2018-02-04 02:52:12,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:52:12,106 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 286 [2018-02-04 02:52:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:12,107 INFO L225 Difference]: With dead ends: 305 [2018-02-04 02:52:12,107 INFO L226 Difference]: Without dead ends: 299 [2018-02-04 02:52:12,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:52:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-04 02:52:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-02-04 02:52:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-04 02:52:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2018-02-04 02:52:12,111 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 286 [2018-02-04 02:52:12,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:12,111 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2018-02-04 02:52:12,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:52:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2018-02-04 02:52:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 02:52:12,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:12,112 INFO L351 BasicCegarLoop]: trace histogram [41, 35, 34, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:12,112 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1441975659, now seen corresponding path program 18 times [2018-02-04 02:52:12,113 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:12,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-02-04 02:52:12,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:12,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:52:12,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:12,307 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:52:12,307 INFO L182 omatonBuilderFactory]: Interpolants [7346#true, 7347#false, 7348#(= foo_~i~0 0), 7349#(<= foo_~i~0 1), 7350#(<= foo_~i~0 2), 7351#(<= foo_~i~0 3), 7352#(<= foo_~i~0 4), 7353#(<= foo_~i~0 5), 7354#(<= foo_~i~0 6), 7355#(and (<= foo_~i~0 6) (<= 0 foo_~i~0)), 7356#(and (<= foo_~i~0 7) (<= 1 foo_~i~0))] [2018-02-04 02:52:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-02-04 02:52:12,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:52:12,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:52:12,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:52:12,308 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 11 states. [2018-02-04 02:52:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:12,415 INFO L93 Difference]: Finished difference Result 308 states and 310 transitions. [2018-02-04 02:52:12,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:52:12,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 292 [2018-02-04 02:52:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:12,417 INFO L225 Difference]: With dead ends: 308 [2018-02-04 02:52:12,417 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 02:52:12,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:52:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 02:52:12,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2018-02-04 02:52:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-04 02:52:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 304 transitions. [2018-02-04 02:52:12,422 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 304 transitions. Word has length 292 [2018-02-04 02:52:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:12,424 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 304 transitions. [2018-02-04 02:52:12,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:52:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 304 transitions. [2018-02-04 02:52:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-02-04 02:52:12,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:12,426 INFO L351 BasicCegarLoop]: trace histogram [42, 36, 35, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:12,426 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:12,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1608658851, now seen corresponding path program 19 times [2018-02-04 02:52:12,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:12,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4317 backedges. 1660 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-04 02:52:12,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:12,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:52:12,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:12,762 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:52:12,763 INFO L182 omatonBuilderFactory]: Interpolants [7979#true, 7980#false, 7981#(= main_~i~1 0), 7982#(<= main_~i~1 1), 7983#(<= main_~i~1 2), 7984#(<= main_~i~1 3), 7985#(<= main_~i~1 4), 7986#(<= main_~i~1 5), 7987#(<= main_~i~1 6), 7988#(<= |foo_#in~size| 7), 7989#(<= foo_~size 7), 7990#(<= foo_~size (+ foo_~i~0 7)), 7991#(<= foo_~size (+ foo_~i~0 6)), 7992#(<= foo_~size (+ foo_~i~0 5)), 7993#(<= foo_~size (+ foo_~i~0 4)), 7994#(<= foo_~size (+ foo_~i~0 3)), 7995#(<= foo_~size (+ foo_~i~0 2)), 7996#(<= foo_~size (+ foo_~i~0 1)), 7997#(<= foo_~size foo_~i~0), 7998#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-04 02:52:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4317 backedges. 1660 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-04 02:52:12,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:52:12,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:52:12,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:52:12,765 INFO L87 Difference]: Start difference. First operand 302 states and 304 transitions. Second operand 20 states. [2018-02-04 02:52:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:13,082 INFO L93 Difference]: Finished difference Result 364 states and 367 transitions. [2018-02-04 02:52:13,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:52:13,082 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 298 [2018-02-04 02:52:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:13,083 INFO L225 Difference]: With dead ends: 364 [2018-02-04 02:52:13,083 INFO L226 Difference]: Without dead ends: 364 [2018-02-04 02:52:13,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:52:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-04 02:52:13,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2018-02-04 02:52:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-04 02:52:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 365 transitions. [2018-02-04 02:52:13,088 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 365 transitions. Word has length 298 [2018-02-04 02:52:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:13,088 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 365 transitions. [2018-02-04 02:52:13,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:52:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 365 transitions. [2018-02-04 02:52:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-02-04 02:52:13,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:13,089 INFO L351 BasicCegarLoop]: trace histogram [50, 43, 42, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:13,089 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1060515318, now seen corresponding path program 20 times [2018-02-04 02:52:13,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:13,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-02-04 02:52:13,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:13,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:52:13,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:13,468 INFO L182 omatonBuilderFactory]: Interpolants [8743#true, 8744#false, 8745#(<= 0 main_~i~1), 8746#(<= 1 main_~i~1), 8747#(<= 2 main_~i~1), 8748#(<= 3 main_~i~1), 8749#(<= 4 main_~i~1), 8750#(<= 5 main_~i~1), 8751#(<= 6 main_~i~1), 8752#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 8753#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 8754#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 8755#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 8756#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 8757#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 8758#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 8759#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 8760#(<= |foo_#in~size| 6)] [2018-02-04 02:52:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-02-04 02:52:13,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:52:13,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:52:13,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:52:13,470 INFO L87 Difference]: Start difference. First operand 362 states and 365 transitions. Second operand 18 states. [2018-02-04 02:52:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:13,749 INFO L93 Difference]: Finished difference Result 371 states and 372 transitions. [2018-02-04 02:52:13,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:52:13,749 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 352 [2018-02-04 02:52:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:13,751 INFO L225 Difference]: With dead ends: 371 [2018-02-04 02:52:13,751 INFO L226 Difference]: Without dead ends: 365 [2018-02-04 02:52:13,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:52:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-04 02:52:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2018-02-04 02:52:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-04 02:52:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 363 transitions. [2018-02-04 02:52:13,756 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 363 transitions. Word has length 352 [2018-02-04 02:52:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:13,756 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 363 transitions. [2018-02-04 02:52:13,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:52:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 363 transitions. [2018-02-04 02:52:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-02-04 02:52:13,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:13,758 INFO L351 BasicCegarLoop]: trace histogram [51, 44, 43, 43, 43, 43, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:13,758 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash -211464126, now seen corresponding path program 21 times [2018-02-04 02:52:13,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:13,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-02-04 02:52:14,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:14,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:52:14,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:14,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:52:14,072 INFO L182 omatonBuilderFactory]: Interpolants [9506#true, 9507#false, 9508#(= foo_~i~0 0), 9509#(and (<= 1 foo_~i~0) (<= foo_~i~0 1)), 9510#(and (<= 2 foo_~i~0) (<= foo_~i~0 2)), 9511#(and (<= 3 foo_~i~0) (<= foo_~i~0 3)), 9512#(and (<= foo_~i~0 4) (<= 4 foo_~i~0)), 9513#(and (<= 5 foo_~i~0) (<= foo_~i~0 5)), 9514#(and (<= foo_~i~0 6) (<= 6 foo_~i~0)), 9515#(and (<= foo_~i~0 7) (<= 7 foo_~i~0)), 9516#(and (<= 8 foo_~i~0) (<= foo_~i~0 8))] [2018-02-04 02:52:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-02-04 02:52:14,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:52:14,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:52:14,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:52:14,074 INFO L87 Difference]: Start difference. First operand 362 states and 363 transitions. Second operand 11 states. [2018-02-04 02:52:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:14,285 INFO L93 Difference]: Finished difference Result 374 states and 376 transitions. [2018-02-04 02:52:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:52:14,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 358 [2018-02-04 02:52:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:14,288 INFO L225 Difference]: With dead ends: 374 [2018-02-04 02:52:14,288 INFO L226 Difference]: Without dead ends: 374 [2018-02-04 02:52:14,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:52:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-02-04 02:52:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2018-02-04 02:52:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 02:52:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 370 transitions. [2018-02-04 02:52:14,293 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 370 transitions. Word has length 358 [2018-02-04 02:52:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:14,294 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 370 transitions. [2018-02-04 02:52:14,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:52:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 370 transitions. [2018-02-04 02:52:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-02-04 02:52:14,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:14,296 INFO L351 BasicCegarLoop]: trace histogram [52, 45, 44, 44, 44, 44, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:14,296 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:14,297 INFO L82 PathProgramCache]: Analyzing trace with hash -146344646, now seen corresponding path program 22 times [2018-02-04 02:52:14,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:14,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 2359 proven. 180 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-02-04 02:52:14,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:14,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:52:14,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:14,756 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:52:14,756 INFO L182 omatonBuilderFactory]: Interpolants [10272#(<= foo_~size (+ foo_~i~0 7)), 10273#(<= foo_~size (+ foo_~i~0 6)), 10274#(<= foo_~size (+ foo_~i~0 5)), 10275#(<= foo_~size (+ foo_~i~0 4)), 10276#(<= foo_~size (+ foo_~i~0 3)), 10277#(<= foo_~size (+ foo_~i~0 2)), 10278#(<= foo_~size (+ foo_~i~0 1)), 10279#(<= foo_~size foo_~i~0), 10280#(<= (+ foo_~size 1) foo_~i~0), 10259#true, 10260#false, 10261#(= main_~i~1 0), 10262#(<= main_~i~1 1), 10263#(<= main_~i~1 2), 10264#(<= main_~i~1 3), 10265#(<= main_~i~1 4), 10266#(<= main_~i~1 5), 10267#(<= main_~i~1 6), 10268#(<= main_~i~1 7), 10269#(<= |foo_#in~size| 8), 10270#(<= foo_~size 8), 10271#(<= foo_~size (+ foo_~i~0 8))] [2018-02-04 02:52:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 2359 proven. 180 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-02-04 02:52:14,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:52:14,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:52:14,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:52:14,758 INFO L87 Difference]: Start difference. First operand 368 states and 370 transitions. Second operand 22 states. [2018-02-04 02:52:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:15,112 INFO L93 Difference]: Finished difference Result 436 states and 439 transitions. [2018-02-04 02:52:15,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:52:15,112 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 364 [2018-02-04 02:52:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:15,114 INFO L225 Difference]: With dead ends: 436 [2018-02-04 02:52:15,115 INFO L226 Difference]: Without dead ends: 436 [2018-02-04 02:52:15,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:52:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-04 02:52:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-02-04 02:52:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-04 02:52:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 437 transitions. [2018-02-04 02:52:15,121 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 437 transitions. Word has length 364 [2018-02-04 02:52:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:15,121 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 437 transitions. [2018-02-04 02:52:15,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:52:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 437 transitions. [2018-02-04 02:52:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-02-04 02:52:15,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:15,124 INFO L351 BasicCegarLoop]: trace histogram [61, 53, 52, 52, 52, 52, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:15,124 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash -894569959, now seen corresponding path program 23 times [2018-02-04 02:52:15,125 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:15,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9336 backedges. 4716 proven. 184 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2018-02-04 02:52:15,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:15,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:52:15,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:15,575 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:52:15,575 INFO L182 omatonBuilderFactory]: Interpolants [11171#true, 11172#false, 11173#(<= 0 main_~i~1), 11174#(<= 1 main_~i~1), 11175#(<= 2 main_~i~1), 11176#(<= 3 main_~i~1), 11177#(<= 4 main_~i~1), 11178#(<= 5 main_~i~1), 11179#(<= 6 main_~i~1), 11180#(<= 7 main_~i~1), 11181#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11182#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11183#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11184#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 11185#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11186#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 11187#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 11188#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 11189#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 11190#(<= |foo_#in~size| 7)] [2018-02-04 02:52:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9336 backedges. 4716 proven. 184 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2018-02-04 02:52:15,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:52:15,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:52:15,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:52:15,576 INFO L87 Difference]: Start difference. First operand 434 states and 437 transitions. Second operand 20 states. [2018-02-04 02:52:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:15,855 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-02-04 02:52:15,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:52:15,855 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 424 [2018-02-04 02:52:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:15,857 INFO L225 Difference]: With dead ends: 443 [2018-02-04 02:52:15,857 INFO L226 Difference]: Without dead ends: 437 [2018-02-04 02:52:15,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:52:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-04 02:52:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 434. [2018-02-04 02:52:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-04 02:52:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 435 transitions. [2018-02-04 02:52:15,864 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 435 transitions. Word has length 424 [2018-02-04 02:52:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:15,865 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 435 transitions. [2018-02-04 02:52:15,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:52:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 435 transitions. [2018-02-04 02:52:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-02-04 02:52:15,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:15,868 INFO L351 BasicCegarLoop]: trace histogram [62, 54, 53, 53, 53, 53, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:15,868 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:15,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1459193583, now seen corresponding path program 24 times [2018-02-04 02:52:15,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:15,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-04 02:52:16,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:16,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:52:16,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:16,224 INFO L182 omatonBuilderFactory]: Interpolants [12082#true, 12083#false, 12084#(= foo_~i~0 0), 12085#(<= foo_~i~0 1), 12086#(<= foo_~i~0 2), 12087#(<= foo_~i~0 3), 12088#(<= foo_~i~0 4), 12089#(<= foo_~i~0 5), 12090#(<= foo_~i~0 6), 12091#(<= foo_~i~0 7), 12092#(<= foo_~i~0 8), 12093#(and (<= 0 foo_~i~0) (<= foo_~i~0 8)), 12094#(and (<= 1 foo_~i~0) (<= foo_~i~0 9))] [2018-02-04 02:52:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-04 02:52:16,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:52:16,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:52:16,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:52:16,225 INFO L87 Difference]: Start difference. First operand 434 states and 435 transitions. Second operand 13 states. [2018-02-04 02:52:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:16,329 INFO L93 Difference]: Finished difference Result 446 states and 448 transitions. [2018-02-04 02:52:16,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:52:16,329 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 430 [2018-02-04 02:52:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:16,331 INFO L225 Difference]: With dead ends: 446 [2018-02-04 02:52:16,331 INFO L226 Difference]: Without dead ends: 446 [2018-02-04 02:52:16,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:52:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-02-04 02:52:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2018-02-04 02:52:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-04 02:52:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 442 transitions. [2018-02-04 02:52:16,337 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 442 transitions. Word has length 430 [2018-02-04 02:52:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:16,338 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 442 transitions. [2018-02-04 02:52:16,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:52:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 442 transitions. [2018-02-04 02:52:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-02-04 02:52:16,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:16,341 INFO L351 BasicCegarLoop]: trace histogram [63, 55, 54, 54, 54, 54, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:16,342 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash -275511607, now seen corresponding path program 25 times [2018-02-04 02:52:16,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:16,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 3227 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-02-04 02:52:16,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:16,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:52:16,875 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:16,875 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:52:16,875 INFO L182 omatonBuilderFactory]: Interpolants [12997#true, 12998#false, 12999#(= main_~i~1 0), 13000#(<= main_~i~1 1), 13001#(<= main_~i~1 2), 13002#(<= main_~i~1 3), 13003#(<= main_~i~1 4), 13004#(<= main_~i~1 5), 13005#(<= main_~i~1 6), 13006#(<= main_~i~1 7), 13007#(<= main_~i~1 8), 13008#(<= |foo_#in~size| 9), 13009#(<= foo_~size 9), 13010#(<= foo_~size (+ foo_~i~0 9)), 13011#(<= foo_~size (+ foo_~i~0 8)), 13012#(<= foo_~size (+ foo_~i~0 7)), 13013#(<= foo_~size (+ foo_~i~0 6)), 13014#(<= foo_~size (+ foo_~i~0 5)), 13015#(<= foo_~size (+ foo_~i~0 4)), 13016#(<= foo_~size (+ foo_~i~0 3)), 13017#(<= foo_~size (+ foo_~i~0 2)), 13018#(<= foo_~size (+ foo_~i~0 1)), 13019#(<= foo_~size foo_~i~0), 13020#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-04 02:52:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 3227 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-02-04 02:52:16,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:52:16,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:52:16,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:52:16,876 INFO L87 Difference]: Start difference. First operand 440 states and 442 transitions. Second operand 24 states. [2018-02-04 02:52:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:17,190 INFO L93 Difference]: Finished difference Result 514 states and 517 transitions. [2018-02-04 02:52:17,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:52:17,191 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 436 [2018-02-04 02:52:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:17,193 INFO L225 Difference]: With dead ends: 514 [2018-02-04 02:52:17,193 INFO L226 Difference]: Without dead ends: 514 [2018-02-04 02:52:17,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:52:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-02-04 02:52:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2018-02-04 02:52:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-02-04 02:52:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 515 transitions. [2018-02-04 02:52:17,199 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 515 transitions. Word has length 436 [2018-02-04 02:52:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:17,200 INFO L432 AbstractCegarLoop]: Abstraction has 512 states and 515 transitions. [2018-02-04 02:52:17,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:52:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 515 transitions. [2018-02-04 02:52:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-02-04 02:52:17,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:17,204 INFO L351 BasicCegarLoop]: trace histogram [73, 64, 63, 63, 63, 63, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:17,204 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1015516064, now seen corresponding path program 26 times [2018-02-04 02:52:17,205 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:17,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-02-04 02:52:17,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:17,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:52:17,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:17,745 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:52:17,745 INFO L182 omatonBuilderFactory]: Interpolants [14080#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 14081#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 14082#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 14083#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 14084#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 14085#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 14086#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 14087#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 14088#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 14089#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 14090#(<= |foo_#in~size| 8), 14069#true, 14070#false, 14071#(<= 0 main_~i~1), 14072#(<= 1 main_~i~1), 14073#(<= 2 main_~i~1), 14074#(<= 3 main_~i~1), 14075#(<= 4 main_~i~1), 14076#(<= 5 main_~i~1), 14077#(<= 6 main_~i~1), 14078#(<= 7 main_~i~1), 14079#(<= 8 main_~i~1)] [2018-02-04 02:52:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-02-04 02:52:17,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:52:17,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:52:17,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:52:17,746 INFO L87 Difference]: Start difference. First operand 512 states and 515 transitions. Second operand 22 states. [2018-02-04 02:52:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:18,068 INFO L93 Difference]: Finished difference Result 521 states and 522 transitions. [2018-02-04 02:52:18,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 02:52:18,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 502 [2018-02-04 02:52:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:18,070 INFO L225 Difference]: With dead ends: 521 [2018-02-04 02:52:18,070 INFO L226 Difference]: Without dead ends: 515 [2018-02-04 02:52:18,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:52:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-02-04 02:52:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 512. [2018-02-04 02:52:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-02-04 02:52:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 513 transitions. [2018-02-04 02:52:18,073 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 513 transitions. Word has length 502 [2018-02-04 02:52:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:18,074 INFO L432 AbstractCegarLoop]: Abstraction has 512 states and 513 transitions. [2018-02-04 02:52:18,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:52:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 513 transitions. [2018-02-04 02:52:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-02-04 02:52:18,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:18,076 INFO L351 BasicCegarLoop]: trace histogram [74, 65, 64, 64, 64, 64, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:18,076 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:18,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1558061400, now seen corresponding path program 27 times [2018-02-04 02:52:18,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:18,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-02-04 02:52:18,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:18,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:52:18,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:18,435 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:52:18,435 INFO L182 omatonBuilderFactory]: Interpolants [15140#true, 15141#false, 15142#(= foo_~i~0 0), 15143#(<= foo_~i~0 1), 15144#(<= foo_~i~0 2), 15145#(<= foo_~i~0 3), 15146#(<= foo_~i~0 4), 15147#(<= foo_~i~0 5), 15148#(<= foo_~i~0 6), 15149#(<= foo_~i~0 7), 15150#(<= foo_~i~0 8), 15151#(and (<= 0 foo_~i~0) (<= foo_~i~0 8)), 15152#(and (<= 1 foo_~i~0) (<= foo_~i~0 9)), 15153#(and (<= foo_~i~0 10) (<= 2 foo_~i~0))] [2018-02-04 02:52:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-02-04 02:52:18,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:52:18,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:52:18,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:52:18,436 INFO L87 Difference]: Start difference. First operand 512 states and 513 transitions. Second operand 14 states. [2018-02-04 02:52:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:18,568 INFO L93 Difference]: Finished difference Result 524 states and 526 transitions. [2018-02-04 02:52:18,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:52:18,568 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 508 [2018-02-04 02:52:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:18,569 INFO L225 Difference]: With dead ends: 524 [2018-02-04 02:52:18,569 INFO L226 Difference]: Without dead ends: 524 [2018-02-04 02:52:18,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:52:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-02-04 02:52:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 518. [2018-02-04 02:52:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-02-04 02:52:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 520 transitions. [2018-02-04 02:52:18,573 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 520 transitions. Word has length 508 [2018-02-04 02:52:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:18,573 INFO L432 AbstractCegarLoop]: Abstraction has 518 states and 520 transitions. [2018-02-04 02:52:18,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:52:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 520 transitions. [2018-02-04 02:52:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-02-04 02:52:18,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:18,575 INFO L351 BasicCegarLoop]: trace histogram [75, 66, 65, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:18,575 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:18,575 INFO L82 PathProgramCache]: Analyzing trace with hash -387441200, now seen corresponding path program 28 times [2018-02-04 02:52:18,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:18,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:52:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4282 proven. 284 refuted. 0 times theorem prover too weak. 9774 trivial. 0 not checked. [2018-02-04 02:52:19,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:19,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:52:19,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:19,327 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:52:19,327 INFO L182 omatonBuilderFactory]: Interpolants [16214#true, 16215#false, 16216#(= main_~i~1 0), 16217#(<= main_~i~1 1), 16218#(<= main_~i~1 2), 16219#(<= main_~i~1 3), 16220#(<= main_~i~1 4), 16221#(<= main_~i~1 5), 16222#(<= main_~i~1 6), 16223#(<= main_~i~1 7), 16224#(<= main_~i~1 8), 16225#(<= main_~i~1 9), 16226#(<= |foo_#in~size| 10), 16227#(<= foo_~size 10), 16228#(<= foo_~size (+ foo_~i~0 10)), 16229#(<= foo_~size (+ foo_~i~0 9)), 16230#(<= foo_~size (+ foo_~i~0 8)), 16231#(<= foo_~size (+ foo_~i~0 7)), 16232#(<= foo_~size (+ foo_~i~0 6)), 16233#(<= foo_~size (+ foo_~i~0 5)), 16234#(<= foo_~size (+ foo_~i~0 4)), 16235#(<= foo_~size (+ foo_~i~0 3)), 16236#(<= foo_~size (+ foo_~i~0 2)), 16237#(<= foo_~size (+ foo_~i~0 1)), 16238#(<= foo_~size foo_~i~0), 16239#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-04 02:52:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4282 proven. 284 refuted. 0 times theorem prover too weak. 9774 trivial. 0 not checked. [2018-02-04 02:52:19,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:52:19,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:52:19,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:52:19,329 INFO L87 Difference]: Start difference. First operand 518 states and 520 transitions. Second operand 26 states. [2018-02-04 02:52:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:19,582 INFO L93 Difference]: Finished difference Result 598 states and 601 transitions. [2018-02-04 02:52:19,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:52:19,583 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 514 [2018-02-04 02:52:19,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:19,584 INFO L225 Difference]: With dead ends: 598 [2018-02-04 02:52:19,585 INFO L226 Difference]: Without dead ends: 598 [2018-02-04 02:52:19,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:52:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-02-04 02:52:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2018-02-04 02:52:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-02-04 02:52:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 599 transitions. [2018-02-04 02:52:19,593 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 599 transitions. Word has length 514 [2018-02-04 02:52:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:19,594 INFO L432 AbstractCegarLoop]: Abstraction has 596 states and 599 transitions. [2018-02-04 02:52:19,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:52:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 599 transitions. [2018-02-04 02:52:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-02-04 02:52:19,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:19,598 INFO L351 BasicCegarLoop]: trace histogram [86, 76, 75, 75, 75, 75, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:19,598 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:19,599 INFO L82 PathProgramCache]: Analyzing trace with hash 595794463, now seen corresponding path program 29 times [2018-02-04 02:52:19,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:19,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 8549 proven. 290 refuted. 0 times theorem prover too weak. 10146 trivial. 0 not checked. [2018-02-04 02:52:20,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:20,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:52:20,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:20,231 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:52:20,232 INFO L182 omatonBuilderFactory]: Interpolants [17472#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 17473#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 17474#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 17475#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 17476#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 17477#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 17478#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 17479#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 17480#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 17481#(<= |foo_#in~size| 9), 17458#true, 17459#false, 17460#(<= 0 main_~i~1), 17461#(<= 1 main_~i~1), 17462#(<= 2 main_~i~1), 17463#(<= 3 main_~i~1), 17464#(<= 4 main_~i~1), 17465#(<= 5 main_~i~1), 17466#(<= 6 main_~i~1), 17467#(<= 7 main_~i~1), 17468#(<= 8 main_~i~1), 17469#(<= 9 main_~i~1), 17470#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 17471#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-04 02:52:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 8549 proven. 290 refuted. 0 times theorem prover too weak. 10146 trivial. 0 not checked. [2018-02-04 02:52:20,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:52:20,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:52:20,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:52:20,233 INFO L87 Difference]: Start difference. First operand 596 states and 599 transitions. Second operand 24 states. [2018-02-04 02:52:20,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:20,523 INFO L93 Difference]: Finished difference Result 605 states and 606 transitions. [2018-02-04 02:52:20,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:52:20,523 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 586 [2018-02-04 02:52:20,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:20,524 INFO L225 Difference]: With dead ends: 605 [2018-02-04 02:52:20,524 INFO L226 Difference]: Without dead ends: 599 [2018-02-04 02:52:20,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:52:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-02-04 02:52:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2018-02-04 02:52:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-02-04 02:52:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 597 transitions. [2018-02-04 02:52:20,528 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 597 transitions. Word has length 586 [2018-02-04 02:52:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:20,528 INFO L432 AbstractCegarLoop]: Abstraction has 596 states and 597 transitions. [2018-02-04 02:52:20,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:52:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 597 transitions. [2018-02-04 02:52:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-02-04 02:52:20,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:20,531 INFO L351 BasicCegarLoop]: trace histogram [87, 77, 76, 76, 76, 76, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:20,531 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:20,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1034822807, now seen corresponding path program 30 times [2018-02-04 02:52:20,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:20,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-02-04 02:52:20,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:20,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:52:20,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:20,909 INFO L182 omatonBuilderFactory]: Interpolants [18701#true, 18702#false, 18703#(= foo_~i~0 0), 18704#(<= foo_~i~0 1), 18705#(<= foo_~i~0 2), 18706#(<= foo_~i~0 3), 18707#(<= foo_~i~0 4), 18708#(<= foo_~i~0 5), 18709#(<= foo_~i~0 6), 18710#(<= foo_~i~0 7), 18711#(<= foo_~i~0 8), 18712#(<= foo_~i~0 9), 18713#(<= foo_~i~0 10), 18714#(and (<= 0 foo_~i~0) (<= foo_~i~0 10)), 18715#(and (<= 1 foo_~i~0) (<= foo_~i~0 11))] [2018-02-04 02:52:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-02-04 02:52:20,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:52:20,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:52:20,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:52:20,910 INFO L87 Difference]: Start difference. First operand 596 states and 597 transitions. Second operand 15 states. [2018-02-04 02:52:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:21,058 INFO L93 Difference]: Finished difference Result 608 states and 610 transitions. [2018-02-04 02:52:21,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:52:21,058 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 592 [2018-02-04 02:52:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:21,060 INFO L225 Difference]: With dead ends: 608 [2018-02-04 02:52:21,060 INFO L226 Difference]: Without dead ends: 608 [2018-02-04 02:52:21,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:52:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-02-04 02:52:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2018-02-04 02:52:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-02-04 02:52:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 604 transitions. [2018-02-04 02:52:21,065 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 604 transitions. Word has length 592 [2018-02-04 02:52:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:21,066 INFO L432 AbstractCegarLoop]: Abstraction has 602 states and 604 transitions. [2018-02-04 02:52:21,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:52:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 604 transitions. [2018-02-04 02:52:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-02-04 02:52:21,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:21,070 INFO L351 BasicCegarLoop]: trace histogram [88, 78, 77, 77, 77, 77, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:21,071 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:21,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1525516849, now seen corresponding path program 31 times [2018-02-04 02:52:21,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:21,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5542 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-02-04 02:52:21,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:21,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 02:52:21,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:21,966 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:52:21,966 INFO L182 omatonBuilderFactory]: Interpolants [19968#(<= foo_~size (+ foo_~i~0 4)), 19969#(<= foo_~size (+ foo_~i~0 3)), 19970#(<= foo_~size (+ foo_~i~0 2)), 19971#(<= foo_~size (+ foo_~i~0 1)), 19972#(<= foo_~size foo_~i~0), 19973#(<= (+ foo_~size 1) foo_~i~0), 19946#true, 19947#false, 19948#(= main_~i~1 0), 19949#(<= main_~i~1 1), 19950#(<= main_~i~1 2), 19951#(<= main_~i~1 3), 19952#(<= main_~i~1 4), 19953#(<= main_~i~1 5), 19954#(<= main_~i~1 6), 19955#(<= main_~i~1 7), 19956#(<= main_~i~1 8), 19957#(<= main_~i~1 9), 19958#(<= main_~i~1 10), 19959#(<= |foo_#in~size| 11), 19960#(<= foo_~size 11), 19961#(<= foo_~size (+ foo_~i~0 11)), 19962#(<= foo_~size (+ foo_~i~0 10)), 19963#(<= foo_~size (+ foo_~i~0 9)), 19964#(<= foo_~size (+ foo_~i~0 8)), 19965#(<= foo_~size (+ foo_~i~0 7)), 19966#(<= foo_~size (+ foo_~i~0 6)), 19967#(<= foo_~size (+ foo_~i~0 5))] [2018-02-04 02:52:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5542 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-02-04 02:52:21,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:52:21,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:52:21,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:52:21,967 INFO L87 Difference]: Start difference. First operand 602 states and 604 transitions. Second operand 28 states. [2018-02-04 02:52:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:22,416 INFO L93 Difference]: Finished difference Result 688 states and 691 transitions. [2018-02-04 02:52:22,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:52:22,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 598 [2018-02-04 02:52:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:22,418 INFO L225 Difference]: With dead ends: 688 [2018-02-04 02:52:22,418 INFO L226 Difference]: Without dead ends: 688 [2018-02-04 02:52:22,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:52:22,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-02-04 02:52:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 686. [2018-02-04 02:52:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-02-04 02:52:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 689 transitions. [2018-02-04 02:52:22,423 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 689 transitions. Word has length 598 [2018-02-04 02:52:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:22,424 INFO L432 AbstractCegarLoop]: Abstraction has 686 states and 689 transitions. [2018-02-04 02:52:22,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:52:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 689 transitions. [2018-02-04 02:52:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-02-04 02:52:22,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:22,427 INFO L351 BasicCegarLoop]: trace histogram [100, 89, 88, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:22,427 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:22,428 INFO L82 PathProgramCache]: Analyzing trace with hash 775068438, now seen corresponding path program 32 times [2018-02-04 02:52:22,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:22,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-02-04 02:52:23,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:23,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:52:23,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:23,170 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:52:23,171 INFO L182 omatonBuilderFactory]: Interpolants [21376#(<= 0 main_~i~1), 21377#(<= 1 main_~i~1), 21378#(<= 2 main_~i~1), 21379#(<= 3 main_~i~1), 21380#(<= 4 main_~i~1), 21381#(<= 5 main_~i~1), 21382#(<= 6 main_~i~1), 21383#(<= 7 main_~i~1), 21384#(<= 8 main_~i~1), 21385#(<= 9 main_~i~1), 21386#(<= 10 main_~i~1), 21387#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 21388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 21389#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 21390#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 21391#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 21392#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 21393#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 21394#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 21395#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 21396#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 21397#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 21398#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 21399#(<= |foo_#in~size| 10), 21374#true, 21375#false] [2018-02-04 02:52:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-02-04 02:52:23,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:52:23,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:52:23,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:52:23,172 INFO L87 Difference]: Start difference. First operand 686 states and 689 transitions. Second operand 26 states. [2018-02-04 02:52:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:23,529 INFO L93 Difference]: Finished difference Result 695 states and 696 transitions. [2018-02-04 02:52:23,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:52:23,529 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 676 [2018-02-04 02:52:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:23,531 INFO L225 Difference]: With dead ends: 695 [2018-02-04 02:52:23,531 INFO L226 Difference]: Without dead ends: 689 [2018-02-04 02:52:23,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=960, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:52:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-02-04 02:52:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 686. [2018-02-04 02:52:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-02-04 02:52:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 687 transitions. [2018-02-04 02:52:23,536 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 687 transitions. Word has length 676 [2018-02-04 02:52:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:23,536 INFO L432 AbstractCegarLoop]: Abstraction has 686 states and 687 transitions. [2018-02-04 02:52:23,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:52:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 687 transitions. [2018-02-04 02:52:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2018-02-04 02:52:23,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:23,540 INFO L351 BasicCegarLoop]: trace histogram [101, 90, 89, 89, 89, 89, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:23,540 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash -436969394, now seen corresponding path program 33 times [2018-02-04 02:52:23,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:23,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-02-04 02:52:24,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:24,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:52:24,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:24,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:52:24,269 INFO L182 omatonBuilderFactory]: Interpolants [22816#(and (<= 4 foo_~i~0) (<= foo_~i~0 12)), 22801#true, 22802#false, 22803#(= foo_~i~0 0), 22804#(<= foo_~i~0 1), 22805#(<= foo_~i~0 2), 22806#(<= foo_~i~0 3), 22807#(<= foo_~i~0 4), 22808#(<= foo_~i~0 5), 22809#(<= foo_~i~0 6), 22810#(<= foo_~i~0 7), 22811#(<= foo_~i~0 8), 22812#(and (<= 0 foo_~i~0) (<= foo_~i~0 8)), 22813#(and (<= 1 foo_~i~0) (<= foo_~i~0 9)), 22814#(and (<= foo_~i~0 10) (<= 2 foo_~i~0)), 22815#(and (<= foo_~i~0 11) (<= 3 foo_~i~0))] [2018-02-04 02:52:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-02-04 02:52:24,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:52:24,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:52:24,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:52:24,270 INFO L87 Difference]: Start difference. First operand 686 states and 687 transitions. Second operand 16 states. [2018-02-04 02:52:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:24,467 INFO L93 Difference]: Finished difference Result 698 states and 700 transitions. [2018-02-04 02:52:24,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:52:24,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 682 [2018-02-04 02:52:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:24,468 INFO L225 Difference]: With dead ends: 698 [2018-02-04 02:52:24,468 INFO L226 Difference]: Without dead ends: 698 [2018-02-04 02:52:24,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:52:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-02-04 02:52:24,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 692. [2018-02-04 02:52:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-02-04 02:52:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 694 transitions. [2018-02-04 02:52:24,474 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 694 transitions. Word has length 682 [2018-02-04 02:52:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:24,474 INFO L432 AbstractCegarLoop]: Abstraction has 692 states and 694 transitions. [2018-02-04 02:52:24,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:52:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 694 transitions. [2018-02-04 02:52:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-02-04 02:52:24,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:24,479 INFO L351 BasicCegarLoop]: trace histogram [102, 91, 90, 90, 90, 90, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:24,479 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:24,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1628752966, now seen corresponding path program 34 times [2018-02-04 02:52:24,479 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:24,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 7025 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-04 02:52:25,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:25,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 02:52:25,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:25,398 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:52:25,398 INFO L182 omatonBuilderFactory]: Interpolants [24256#(<= foo_~size (+ foo_~i~0 1)), 24257#(<= foo_~size foo_~i~0), 24258#(<= (+ foo_~size 1) foo_~i~0), 24229#true, 24230#false, 24231#(= main_~i~1 0), 24232#(<= main_~i~1 1), 24233#(<= main_~i~1 2), 24234#(<= main_~i~1 3), 24235#(<= main_~i~1 4), 24236#(<= main_~i~1 5), 24237#(<= main_~i~1 6), 24238#(<= main_~i~1 7), 24239#(<= main_~i~1 8), 24240#(<= main_~i~1 9), 24241#(<= main_~i~1 10), 24242#(<= main_~i~1 11), 24243#(<= |foo_#in~size| 12), 24244#(<= foo_~size 12), 24245#(<= foo_~size (+ foo_~i~0 12)), 24246#(<= foo_~size (+ foo_~i~0 11)), 24247#(<= foo_~size (+ foo_~i~0 10)), 24248#(<= foo_~size (+ foo_~i~0 9)), 24249#(<= foo_~size (+ foo_~i~0 8)), 24250#(<= foo_~size (+ foo_~i~0 7)), 24251#(<= foo_~size (+ foo_~i~0 6)), 24252#(<= foo_~size (+ foo_~i~0 5)), 24253#(<= foo_~size (+ foo_~i~0 4)), 24254#(<= foo_~size (+ foo_~i~0 3)), 24255#(<= foo_~size (+ foo_~i~0 2))] [2018-02-04 02:52:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 7025 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-04 02:52:25,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 02:52:25,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 02:52:25,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:52:25,399 INFO L87 Difference]: Start difference. First operand 692 states and 694 transitions. Second operand 30 states. [2018-02-04 02:52:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:25,875 INFO L93 Difference]: Finished difference Result 784 states and 787 transitions. [2018-02-04 02:52:25,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 02:52:25,875 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 688 [2018-02-04 02:52:25,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:25,876 INFO L225 Difference]: With dead ends: 784 [2018-02-04 02:52:25,876 INFO L226 Difference]: Without dead ends: 784 [2018-02-04 02:52:25,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 02:52:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-02-04 02:52:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2018-02-04 02:52:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-02-04 02:52:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 785 transitions. [2018-02-04 02:52:25,881 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 785 transitions. Word has length 688 [2018-02-04 02:52:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:25,882 INFO L432 AbstractCegarLoop]: Abstraction has 782 states and 785 transitions. [2018-02-04 02:52:25,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 02:52:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 785 transitions. [2018-02-04 02:52:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-02-04 02:52:25,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:25,885 INFO L351 BasicCegarLoop]: trace histogram [115, 103, 102, 102, 102, 102, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:25,885 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:25,885 INFO L82 PathProgramCache]: Analyzing trace with hash 47189509, now seen corresponding path program 35 times [2018-02-04 02:52:25,886 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:25,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 14018 proven. 420 refuted. 0 times theorem prover too weak. 20098 trivial. 0 not checked. [2018-02-04 02:52:26,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:26,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 02:52:26,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:26,856 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:52:26,856 INFO L182 omatonBuilderFactory]: Interpolants [25856#(<= 1 main_~i~1), 25857#(<= 2 main_~i~1), 25858#(<= 3 main_~i~1), 25859#(<= 4 main_~i~1), 25860#(<= 5 main_~i~1), 25861#(<= 6 main_~i~1), 25862#(<= 7 main_~i~1), 25863#(<= 8 main_~i~1), 25864#(<= 9 main_~i~1), 25865#(<= 10 main_~i~1), 25866#(<= 11 main_~i~1), 25867#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 25868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 25869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 25870#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 25871#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 25872#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 25873#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 25874#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 25875#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 25876#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 25877#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 25878#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 25879#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 25880#(<= |foo_#in~size| 11), 25853#true, 25854#false, 25855#(<= 0 main_~i~1)] [2018-02-04 02:52:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 14018 proven. 420 refuted. 0 times theorem prover too weak. 20098 trivial. 0 not checked. [2018-02-04 02:52:26,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:52:26,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:52:26,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:52:26,857 INFO L87 Difference]: Start difference. First operand 782 states and 785 transitions. Second operand 28 states. [2018-02-04 02:52:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:27,285 INFO L93 Difference]: Finished difference Result 791 states and 792 transitions. [2018-02-04 02:52:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:52:27,285 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 772 [2018-02-04 02:52:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:27,287 INFO L225 Difference]: With dead ends: 791 [2018-02-04 02:52:27,287 INFO L226 Difference]: Without dead ends: 785 [2018-02-04 02:52:27,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=1131, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:52:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-02-04 02:52:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 782. [2018-02-04 02:52:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-02-04 02:52:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 783 transitions. [2018-02-04 02:52:27,292 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 783 transitions. Word has length 772 [2018-02-04 02:52:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:27,292 INFO L432 AbstractCegarLoop]: Abstraction has 782 states and 783 transitions. [2018-02-04 02:52:27,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:52:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 783 transitions. [2018-02-04 02:52:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-02-04 02:52:27,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:27,296 INFO L351 BasicCegarLoop]: trace histogram [116, 104, 103, 103, 103, 103, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:27,296 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1773325315, now seen corresponding path program 36 times [2018-02-04 02:52:27,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:27,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-04 02:52:27,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:27,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:52:27,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:27,910 INFO L182 omatonBuilderFactory]: Interpolants [27488#(<= foo_~i~0 10), 27489#(<= foo_~i~0 11), 27490#(<= foo_~i~0 12), 27491#(and (<= foo_~i~0 12) (<= 0 foo_~i~0)), 27492#(and (<= 1 foo_~i~0) (<= foo_~i~0 13)), 27476#true, 27477#false, 27478#(= foo_~i~0 0), 27479#(<= foo_~i~0 1), 27480#(<= foo_~i~0 2), 27481#(<= foo_~i~0 3), 27482#(<= foo_~i~0 4), 27483#(<= foo_~i~0 5), 27484#(<= foo_~i~0 6), 27485#(<= foo_~i~0 7), 27486#(<= foo_~i~0 8), 27487#(<= foo_~i~0 9)] [2018-02-04 02:52:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-04 02:52:27,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:52:27,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:52:27,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:52:27,912 INFO L87 Difference]: Start difference. First operand 782 states and 783 transitions. Second operand 17 states. [2018-02-04 02:52:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:28,062 INFO L93 Difference]: Finished difference Result 794 states and 796 transitions. [2018-02-04 02:52:28,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:52:28,062 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 778 [2018-02-04 02:52:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:28,064 INFO L225 Difference]: With dead ends: 794 [2018-02-04 02:52:28,064 INFO L226 Difference]: Without dead ends: 794 [2018-02-04 02:52:28,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=303, Invalid=509, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:52:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-02-04 02:52:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 788. [2018-02-04 02:52:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-02-04 02:52:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 790 transitions. [2018-02-04 02:52:28,068 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 790 transitions. Word has length 778 [2018-02-04 02:52:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:28,069 INFO L432 AbstractCegarLoop]: Abstraction has 788 states and 790 transitions. [2018-02-04 02:52:28,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:52:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 790 transitions. [2018-02-04 02:52:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-02-04 02:52:28,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:28,072 INFO L351 BasicCegarLoop]: trace histogram [117, 105, 104, 104, 104, 104, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:28,073 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:28,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1537597621, now seen corresponding path program 37 times [2018-02-04 02:52:28,073 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:28,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8749 proven. 485 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-02-04 02:52:29,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:29,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 02:52:29,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:29,171 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:52:29,171 INFO L182 omatonBuilderFactory]: Interpolants [29120#(<= foo_~size (+ foo_~i~0 9)), 29121#(<= foo_~size (+ foo_~i~0 8)), 29122#(<= foo_~size (+ foo_~i~0 7)), 29123#(<= foo_~size (+ foo_~i~0 6)), 29124#(<= foo_~size (+ foo_~i~0 5)), 29125#(<= foo_~size (+ foo_~i~0 4)), 29126#(<= foo_~size (+ foo_~i~0 3)), 29127#(<= foo_~size (+ foo_~i~0 2)), 29128#(<= foo_~size (+ foo_~i~0 1)), 29129#(<= foo_~size foo_~i~0), 29130#(<= (+ foo_~size 1) foo_~i~0), 29099#true, 29100#false, 29101#(= main_~i~1 0), 29102#(<= main_~i~1 1), 29103#(<= main_~i~1 2), 29104#(<= main_~i~1 3), 29105#(<= main_~i~1 4), 29106#(<= main_~i~1 5), 29107#(<= main_~i~1 6), 29108#(<= main_~i~1 7), 29109#(<= main_~i~1 8), 29110#(<= main_~i~1 9), 29111#(<= main_~i~1 10), 29112#(<= main_~i~1 11), 29113#(<= main_~i~1 12), 29114#(<= |foo_#in~size| 13), 29115#(<= foo_~size 13), 29116#(<= foo_~size (+ foo_~i~0 13)), 29117#(<= foo_~size (+ foo_~i~0 12)), 29118#(<= foo_~size (+ foo_~i~0 11)), 29119#(<= foo_~size (+ foo_~i~0 10))] [2018-02-04 02:52:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8749 proven. 485 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-02-04 02:52:29,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 02:52:29,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 02:52:29,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:52:29,172 INFO L87 Difference]: Start difference. First operand 788 states and 790 transitions. Second operand 32 states. [2018-02-04 02:52:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:29,768 INFO L93 Difference]: Finished difference Result 886 states and 889 transitions. [2018-02-04 02:52:29,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:52:29,768 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 784 [2018-02-04 02:52:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:29,770 INFO L225 Difference]: With dead ends: 886 [2018-02-04 02:52:29,770 INFO L226 Difference]: Without dead ends: 886 [2018-02-04 02:52:29,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=529, Invalid=1633, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 02:52:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-02-04 02:52:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2018-02-04 02:52:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-02-04 02:52:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 887 transitions. [2018-02-04 02:52:29,776 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 887 transitions. Word has length 784 [2018-02-04 02:52:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:29,776 INFO L432 AbstractCegarLoop]: Abstraction has 884 states and 887 transitions. [2018-02-04 02:52:29,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 02:52:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 887 transitions. [2018-02-04 02:52:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-02-04 02:52:29,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:29,780 INFO L351 BasicCegarLoop]: trace histogram [131, 118, 117, 117, 117, 117, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:29,780 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:29,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1027574676, now seen corresponding path program 38 times [2018-02-04 02:52:29,781 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:29,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 17456 proven. 494 refuted. 0 times theorem prover too weak. 27186 trivial. 0 not checked. [2018-02-04 02:52:30,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:30,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 02:52:30,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:30,983 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:52:30,984 INFO L182 omatonBuilderFactory]: Interpolants [30931#true, 30932#false, 30933#(<= 0 main_~i~1), 30934#(<= 1 main_~i~1), 30935#(<= 2 main_~i~1), 30936#(<= 3 main_~i~1), 30937#(<= 4 main_~i~1), 30938#(<= 5 main_~i~1), 30939#(<= 6 main_~i~1), 30940#(<= 7 main_~i~1), 30941#(<= 8 main_~i~1), 30942#(<= 9 main_~i~1), 30943#(<= 10 main_~i~1), 30944#(<= 11 main_~i~1), 30945#(<= 12 main_~i~1), 30946#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 30947#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 30948#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 30949#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 30950#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 30951#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 30952#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 30953#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 30954#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 30955#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 30956#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 30957#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 30958#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 30959#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 30960#(<= |foo_#in~size| 12)] [2018-02-04 02:52:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 17456 proven. 494 refuted. 0 times theorem prover too weak. 27186 trivial. 0 not checked. [2018-02-04 02:52:30,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 02:52:30,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 02:52:30,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:52:30,985 INFO L87 Difference]: Start difference. First operand 884 states and 887 transitions. Second operand 30 states. [2018-02-04 02:52:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:31,473 INFO L93 Difference]: Finished difference Result 893 states and 894 transitions. [2018-02-04 02:52:31,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:52:31,473 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 874 [2018-02-04 02:52:31,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:31,475 INFO L225 Difference]: With dead ends: 893 [2018-02-04 02:52:31,475 INFO L226 Difference]: Without dead ends: 887 [2018-02-04 02:52:31,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=1316, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:52:31,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-02-04 02:52:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2018-02-04 02:52:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-02-04 02:52:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 885 transitions. [2018-02-04 02:52:31,481 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 885 transitions. Word has length 874 [2018-02-04 02:52:31,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:31,481 INFO L432 AbstractCegarLoop]: Abstraction has 884 states and 885 transitions. [2018-02-04 02:52:31,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 02:52:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 885 transitions. [2018-02-04 02:52:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-02-04 02:52:31,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:31,485 INFO L351 BasicCegarLoop]: trace histogram [132, 119, 118, 118, 118, 118, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:31,485 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash -894009052, now seen corresponding path program 39 times [2018-02-04 02:52:31,486 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:31,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-02-04 02:52:32,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:32,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:52:32,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:32,252 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:52:32,252 INFO L182 omatonBuilderFactory]: Interpolants [32768#(<= foo_~i~0 4), 32769#(<= foo_~i~0 5), 32770#(<= foo_~i~0 6), 32771#(<= foo_~i~0 7), 32772#(<= foo_~i~0 8), 32773#(<= foo_~i~0 9), 32774#(<= foo_~i~0 10), 32775#(<= foo_~i~0 11), 32776#(<= foo_~i~0 12), 32777#(and (<= foo_~i~0 12) (<= 0 foo_~i~0)), 32778#(and (<= 1 foo_~i~0) (<= foo_~i~0 13)), 32779#(and (<= foo_~i~0 14) (<= 2 foo_~i~0)), 32762#true, 32763#false, 32764#(= foo_~i~0 0), 32765#(<= foo_~i~0 1), 32766#(<= foo_~i~0 2), 32767#(<= foo_~i~0 3)] [2018-02-04 02:52:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-02-04 02:52:32,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:52:32,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:52:32,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:52:32,254 INFO L87 Difference]: Start difference. First operand 884 states and 885 transitions. Second operand 18 states. [2018-02-04 02:52:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:32,443 INFO L93 Difference]: Finished difference Result 896 states and 898 transitions. [2018-02-04 02:52:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:52:32,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 880 [2018-02-04 02:52:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:32,445 INFO L225 Difference]: With dead ends: 896 [2018-02-04 02:52:32,445 INFO L226 Difference]: Without dead ends: 896 [2018-02-04 02:52:32,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:52:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-02-04 02:52:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 890. [2018-02-04 02:52:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-02-04 02:52:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 892 transitions. [2018-02-04 02:52:32,451 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 892 transitions. Word has length 880 [2018-02-04 02:52:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:32,451 INFO L432 AbstractCegarLoop]: Abstraction has 890 states and 892 transitions. [2018-02-04 02:52:32,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:52:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 892 transitions. [2018-02-04 02:52:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2018-02-04 02:52:32,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:32,455 INFO L351 BasicCegarLoop]: trace histogram [133, 120, 119, 119, 119, 119, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:32,456 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:32,456 INFO L82 PathProgramCache]: Analyzing trace with hash 741635228, now seen corresponding path program 40 times [2018-02-04 02:52:32,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:32,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10732 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-04 02:52:33,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:33,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 02:52:33,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:33,810 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:52:33,810 INFO L182 omatonBuilderFactory]: Interpolants [34624#(<= foo_~size foo_~i~0), 34625#(<= (+ foo_~size 1) foo_~i~0), 34592#true, 34593#false, 34594#(= main_~i~1 0), 34595#(<= main_~i~1 1), 34596#(<= main_~i~1 2), 34597#(<= main_~i~1 3), 34598#(<= main_~i~1 4), 34599#(<= main_~i~1 5), 34600#(<= main_~i~1 6), 34601#(<= main_~i~1 7), 34602#(<= main_~i~1 8), 34603#(<= main_~i~1 9), 34604#(<= main_~i~1 10), 34605#(<= main_~i~1 11), 34606#(<= main_~i~1 12), 34607#(<= main_~i~1 13), 34608#(<= |foo_#in~size| 14), 34609#(<= foo_~size 14), 34610#(<= foo_~size (+ foo_~i~0 14)), 34611#(<= foo_~size (+ foo_~i~0 13)), 34612#(<= foo_~size (+ foo_~i~0 12)), 34613#(<= foo_~size (+ foo_~i~0 11)), 34614#(<= foo_~size (+ foo_~i~0 10)), 34615#(<= foo_~size (+ foo_~i~0 9)), 34616#(<= foo_~size (+ foo_~i~0 8)), 34617#(<= foo_~size (+ foo_~i~0 7)), 34618#(<= foo_~size (+ foo_~i~0 6)), 34619#(<= foo_~size (+ foo_~i~0 5)), 34620#(<= foo_~size (+ foo_~i~0 4)), 34621#(<= foo_~size (+ foo_~i~0 3)), 34622#(<= foo_~size (+ foo_~i~0 2)), 34623#(<= foo_~size (+ foo_~i~0 1))] [2018-02-04 02:52:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10732 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-04 02:52:33,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 02:52:33,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 02:52:33,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:52:33,811 INFO L87 Difference]: Start difference. First operand 890 states and 892 transitions. Second operand 34 states. [2018-02-04 02:52:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:34,411 INFO L93 Difference]: Finished difference Result 994 states and 997 transitions. [2018-02-04 02:52:34,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:52:34,411 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 886 [2018-02-04 02:52:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:34,413 INFO L225 Difference]: With dead ends: 994 [2018-02-04 02:52:34,413 INFO L226 Difference]: Without dead ends: 994 [2018-02-04 02:52:34,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=596, Invalid=1854, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:52:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-02-04 02:52:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 992. [2018-02-04 02:52:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-02-04 02:52:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 995 transitions. [2018-02-04 02:52:34,419 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 995 transitions. Word has length 886 [2018-02-04 02:52:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:34,420 INFO L432 AbstractCegarLoop]: Abstraction has 992 states and 995 transitions. [2018-02-04 02:52:34,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 02:52:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 995 transitions. [2018-02-04 02:52:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-02-04 02:52:34,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:34,424 INFO L351 BasicCegarLoop]: trace histogram [148, 134, 133, 133, 133, 133, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:34,424 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:34,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1908977205, now seen corresponding path program 41 times [2018-02-04 02:52:34,425 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:34,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-02-04 02:52:35,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:35,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 02:52:35,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:35,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:52:35,973 INFO L182 omatonBuilderFactory]: Interpolants [36672#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 36673#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 36674#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 36675#(<= |foo_#in~size| 13), 36644#true, 36645#false, 36646#(<= 0 main_~i~1), 36647#(<= 1 main_~i~1), 36648#(<= 2 main_~i~1), 36649#(<= 3 main_~i~1), 36650#(<= 4 main_~i~1), 36651#(<= 5 main_~i~1), 36652#(<= 6 main_~i~1), 36653#(<= 7 main_~i~1), 36654#(<= 8 main_~i~1), 36655#(<= 9 main_~i~1), 36656#(<= 10 main_~i~1), 36657#(<= 11 main_~i~1), 36658#(<= 12 main_~i~1), 36659#(<= 13 main_~i~1), 36660#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 36661#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 36662#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 36663#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 36664#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 36665#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 36666#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 36667#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 36668#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 36669#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 36670#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 36671#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11))] [2018-02-04 02:52:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-02-04 02:52:35,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 02:52:35,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 02:52:35,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:52:35,974 INFO L87 Difference]: Start difference. First operand 992 states and 995 transitions. Second operand 32 states. [2018-02-04 02:52:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:36,265 INFO L93 Difference]: Finished difference Result 1001 states and 1002 transitions. [2018-02-04 02:52:36,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 02:52:36,265 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 982 [2018-02-04 02:52:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:36,268 INFO L225 Difference]: With dead ends: 1001 [2018-02-04 02:52:36,268 INFO L226 Difference]: Without dead ends: 995 [2018-02-04 02:52:36,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=1515, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 02:52:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2018-02-04 02:52:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 992. [2018-02-04 02:52:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-02-04 02:52:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 993 transitions. [2018-02-04 02:52:36,274 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 993 transitions. Word has length 982 [2018-02-04 02:52:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:36,274 INFO L432 AbstractCegarLoop]: Abstraction has 992 states and 993 transitions. [2018-02-04 02:52:36,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 02:52:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 993 transitions. [2018-02-04 02:52:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-02-04 02:52:36,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:36,279 INFO L351 BasicCegarLoop]: trace histogram [149, 135, 134, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:36,279 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1435708227, now seen corresponding path program 42 times [2018-02-04 02:52:36,280 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:36,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-02-04 02:52:37,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:37,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:52:37,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:37,300 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:52:37,300 INFO L182 omatonBuilderFactory]: Interpolants [38695#true, 38696#false, 38697#(= foo_~i~0 0), 38698#(<= foo_~i~0 1), 38699#(<= foo_~i~0 2), 38700#(<= foo_~i~0 3), 38701#(<= foo_~i~0 4), 38702#(<= foo_~i~0 5), 38703#(<= foo_~i~0 6), 38704#(<= foo_~i~0 7), 38705#(<= foo_~i~0 8), 38706#(<= foo_~i~0 9), 38707#(<= foo_~i~0 10), 38708#(<= foo_~i~0 11), 38709#(<= foo_~i~0 12), 38710#(<= foo_~i~0 13), 38711#(<= foo_~i~0 14), 38712#(and (<= foo_~i~0 14) (<= 0 foo_~i~0)), 38713#(and (<= foo_~i~0 15) (<= 1 foo_~i~0))] [2018-02-04 02:52:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-02-04 02:52:37,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:52:37,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:52:37,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:52:37,301 INFO L87 Difference]: Start difference. First operand 992 states and 993 transitions. Second operand 19 states. [2018-02-04 02:52:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:37,617 INFO L93 Difference]: Finished difference Result 1004 states and 1006 transitions. [2018-02-04 02:52:37,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:52:37,617 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 988 [2018-02-04 02:52:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:37,620 INFO L225 Difference]: With dead ends: 1004 [2018-02-04 02:52:37,620 INFO L226 Difference]: Without dead ends: 1004 [2018-02-04 02:52:37,621 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:52:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-02-04 02:52:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 998. [2018-02-04 02:52:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-02-04 02:52:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1000 transitions. [2018-02-04 02:52:37,631 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1000 transitions. Word has length 988 [2018-02-04 02:52:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:37,632 INFO L432 AbstractCegarLoop]: Abstraction has 998 states and 1000 transitions. [2018-02-04 02:52:37,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:52:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1000 transitions. [2018-02-04 02:52:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-02-04 02:52:37,640 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:37,640 INFO L351 BasicCegarLoop]: trace histogram [150, 136, 135, 135, 135, 135, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:37,640 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:37,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1833618299, now seen corresponding path program 43 times [2018-02-04 02:52:37,641 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:37,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12992 proven. 649 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-02-04 02:52:39,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:39,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 02:52:39,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:52:39,406 INFO L182 omatonBuilderFactory]: Interpolants [40768#(<= foo_~size (+ foo_~i~0 10)), 40769#(<= foo_~size (+ foo_~i~0 9)), 40770#(<= foo_~size (+ foo_~i~0 8)), 40771#(<= foo_~size (+ foo_~i~0 7)), 40772#(<= foo_~size (+ foo_~i~0 6)), 40773#(<= foo_~size (+ foo_~i~0 5)), 40774#(<= foo_~size (+ foo_~i~0 4)), 40775#(<= foo_~size (+ foo_~i~0 3)), 40776#(<= foo_~size (+ foo_~i~0 2)), 40777#(<= foo_~size (+ foo_~i~0 1)), 40778#(<= foo_~size foo_~i~0), 40779#(<= (+ foo_~size 1) foo_~i~0), 40744#true, 40745#false, 40746#(= main_~i~1 0), 40747#(<= main_~i~1 1), 40748#(<= main_~i~1 2), 40749#(<= main_~i~1 3), 40750#(<= main_~i~1 4), 40751#(<= main_~i~1 5), 40752#(<= main_~i~1 6), 40753#(<= main_~i~1 7), 40754#(<= main_~i~1 8), 40755#(<= main_~i~1 9), 40756#(<= main_~i~1 10), 40757#(<= main_~i~1 11), 40758#(<= main_~i~1 12), 40759#(<= main_~i~1 13), 40760#(<= main_~i~1 14), 40761#(<= |foo_#in~size| 15), 40762#(<= foo_~size 15), 40763#(<= foo_~size (+ foo_~i~0 15)), 40764#(<= foo_~size (+ foo_~i~0 14)), 40765#(<= foo_~size (+ foo_~i~0 13)), 40766#(<= foo_~size (+ foo_~i~0 12)), 40767#(<= foo_~size (+ foo_~i~0 11))] [2018-02-04 02:52:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12992 proven. 649 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-02-04 02:52:39,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 02:52:39,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 02:52:39,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:52:39,407 INFO L87 Difference]: Start difference. First operand 998 states and 1000 transitions. Second operand 36 states. [2018-02-04 02:52:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:40,083 INFO L93 Difference]: Finished difference Result 1108 states and 1111 transitions. [2018-02-04 02:52:40,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 02:52:40,083 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 994 [2018-02-04 02:52:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:40,085 INFO L225 Difference]: With dead ends: 1108 [2018-02-04 02:52:40,085 INFO L226 Difference]: Without dead ends: 1108 [2018-02-04 02:52:40,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=667, Invalid=2089, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 02:52:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2018-02-04 02:52:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106. [2018-02-04 02:52:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-02-04 02:52:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1109 transitions. [2018-02-04 02:52:40,091 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1109 transitions. Word has length 994 [2018-02-04 02:52:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:40,091 INFO L432 AbstractCegarLoop]: Abstraction has 1106 states and 1109 transitions. [2018-02-04 02:52:40,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 02:52:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1109 transitions. [2018-02-04 02:52:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2018-02-04 02:52:40,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:40,097 INFO L351 BasicCegarLoop]: trace histogram [166, 151, 150, 150, 150, 150, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:40,097 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash 305834914, now seen corresponding path program 44 times [2018-02-04 02:52:40,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:40,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 73365 backedges. 25919 proven. 660 refuted. 0 times theorem prover too weak. 46786 trivial. 0 not checked. [2018-02-04 02:52:42,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:42,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 02:52:42,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:42,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:52:42,044 INFO L182 omatonBuilderFactory]: Interpolants [43028#true, 43029#false, 43030#(<= 0 main_~i~1), 43031#(<= 1 main_~i~1), 43032#(<= 2 main_~i~1), 43033#(<= 3 main_~i~1), 43034#(<= 4 main_~i~1), 43035#(<= 5 main_~i~1), 43036#(<= 6 main_~i~1), 43037#(<= 7 main_~i~1), 43038#(<= 8 main_~i~1), 43039#(<= 9 main_~i~1), 43040#(<= 10 main_~i~1), 43041#(<= 11 main_~i~1), 43042#(<= 12 main_~i~1), 43043#(<= 13 main_~i~1), 43044#(<= 14 main_~i~1), 43045#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 43046#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 43047#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 43048#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 43049#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 43050#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 43051#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 43052#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 43053#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 43054#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 43055#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 43056#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 43057#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 43058#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 43059#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 43060#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 43061#(<= |foo_#in~size| 14)] [2018-02-04 02:52:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 73365 backedges. 25919 proven. 660 refuted. 0 times theorem prover too weak. 46786 trivial. 0 not checked. [2018-02-04 02:52:42,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 02:52:42,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 02:52:42,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:52:42,045 INFO L87 Difference]: Start difference. First operand 1106 states and 1109 transitions. Second operand 34 states. [2018-02-04 02:52:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:42,690 INFO L93 Difference]: Finished difference Result 1115 states and 1116 transitions. [2018-02-04 02:52:42,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 02:52:42,691 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1096 [2018-02-04 02:52:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:42,693 INFO L225 Difference]: With dead ends: 1115 [2018-02-04 02:52:42,693 INFO L226 Difference]: Without dead ends: 1109 [2018-02-04 02:52:42,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=528, Invalid=1728, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 02:52:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2018-02-04 02:52:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1106. [2018-02-04 02:52:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-02-04 02:52:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1107 transitions. [2018-02-04 02:52:42,700 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1107 transitions. Word has length 1096 [2018-02-04 02:52:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:42,700 INFO L432 AbstractCegarLoop]: Abstraction has 1106 states and 1107 transitions. [2018-02-04 02:52:42,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 02:52:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1107 transitions. [2018-02-04 02:52:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2018-02-04 02:52:42,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:42,706 INFO L351 BasicCegarLoop]: trace histogram [167, 152, 151, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:42,706 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:42,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1521424346, now seen corresponding path program 45 times [2018-02-04 02:52:42,707 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:42,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-02-04 02:52:44,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:44,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:52:44,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:44,021 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:52:44,021 INFO L182 omatonBuilderFactory]: Interpolants [45312#false, 45313#(= foo_~i~0 0), 45314#(and (<= 1 foo_~i~0) (<= foo_~i~0 1)), 45315#(and (<= 2 foo_~i~0) (<= foo_~i~0 2)), 45316#(and (<= 3 foo_~i~0) (<= foo_~i~0 3)), 45317#(and (<= foo_~i~0 4) (<= 4 foo_~i~0)), 45318#(and (<= 5 foo_~i~0) (<= foo_~i~0 5)), 45319#(and (<= foo_~i~0 6) (<= 6 foo_~i~0)), 45320#(and (<= foo_~i~0 7) (<= 7 foo_~i~0)), 45321#(and (<= 8 foo_~i~0) (<= foo_~i~0 8)), 45322#(and (<= foo_~i~0 9) (<= 9 foo_~i~0)), 45323#(and (<= 10 foo_~i~0) (<= foo_~i~0 10)), 45324#(and (<= 11 foo_~i~0) (<= foo_~i~0 11)), 45325#(and (<= foo_~i~0 12) (<= 12 foo_~i~0)), 45326#(and (<= 13 foo_~i~0) (<= foo_~i~0 13)), 45327#(and (<= foo_~i~0 14) (<= 14 foo_~i~0)), 45328#(and (<= foo_~i~0 15) (<= 15 foo_~i~0)), 45329#(and (<= 16 foo_~i~0) (<= foo_~i~0 16)), 45311#true] [2018-02-04 02:52:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-02-04 02:52:44,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:52:44,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:52:44,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:52:44,023 INFO L87 Difference]: Start difference. First operand 1106 states and 1107 transitions. Second operand 19 states. [2018-02-04 02:52:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:44,510 INFO L93 Difference]: Finished difference Result 1118 states and 1120 transitions. [2018-02-04 02:52:44,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:52:44,510 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1102 [2018-02-04 02:52:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:44,512 INFO L225 Difference]: With dead ends: 1118 [2018-02-04 02:52:44,512 INFO L226 Difference]: Without dead ends: 1118 [2018-02-04 02:52:44,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:52:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2018-02-04 02:52:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1112. [2018-02-04 02:52:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-02-04 02:52:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1114 transitions. [2018-02-04 02:52:44,519 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1114 transitions. Word has length 1102 [2018-02-04 02:52:44,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:44,519 INFO L432 AbstractCegarLoop]: Abstraction has 1112 states and 1114 transitions. [2018-02-04 02:52:44,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:52:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1114 transitions. [2018-02-04 02:52:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-02-04 02:52:44,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:44,525 INFO L351 BasicCegarLoop]: trace histogram [168, 153, 152, 152, 152, 152, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:44,525 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:44,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1687333586, now seen corresponding path program 46 times [2018-02-04 02:52:44,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:44,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 15547 proven. 740 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-02-04 02:52:46,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:46,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 02:52:46,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:46,661 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:52:46,661 INFO L182 omatonBuilderFactory]: Interpolants [47560#true, 47561#false, 47562#(= main_~i~1 0), 47563#(<= main_~i~1 1), 47564#(<= main_~i~1 2), 47565#(<= main_~i~1 3), 47566#(<= main_~i~1 4), 47567#(<= main_~i~1 5), 47568#(<= main_~i~1 6), 47569#(<= main_~i~1 7), 47570#(<= main_~i~1 8), 47571#(<= main_~i~1 9), 47572#(<= main_~i~1 10), 47573#(<= main_~i~1 11), 47574#(<= main_~i~1 12), 47575#(<= main_~i~1 13), 47576#(<= main_~i~1 14), 47577#(<= main_~i~1 15), 47578#(<= |foo_#in~size| 16), 47579#(<= foo_~size 16), 47580#(<= foo_~size (+ foo_~i~0 16)), 47581#(<= foo_~size (+ foo_~i~0 15)), 47582#(<= foo_~size (+ foo_~i~0 14)), 47583#(<= foo_~size (+ foo_~i~0 13)), 47584#(<= foo_~size (+ foo_~i~0 12)), 47585#(<= foo_~size (+ foo_~i~0 11)), 47586#(<= foo_~size (+ foo_~i~0 10)), 47587#(<= foo_~size (+ foo_~i~0 9)), 47588#(<= foo_~size (+ foo_~i~0 8)), 47589#(<= foo_~size (+ foo_~i~0 7)), 47590#(<= foo_~size (+ foo_~i~0 6)), 47591#(<= foo_~size (+ foo_~i~0 5)), 47592#(<= foo_~size (+ foo_~i~0 4)), 47593#(<= foo_~size (+ foo_~i~0 3)), 47594#(<= foo_~size (+ foo_~i~0 2)), 47595#(<= foo_~size (+ foo_~i~0 1)), 47596#(<= foo_~size foo_~i~0), 47597#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-04 02:52:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 15547 proven. 740 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-02-04 02:52:46,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 02:52:46,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 02:52:46,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:52:46,662 INFO L87 Difference]: Start difference. First operand 1112 states and 1114 transitions. Second operand 38 states. [2018-02-04 02:52:47,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:47,376 INFO L93 Difference]: Finished difference Result 1228 states and 1231 transitions. [2018-02-04 02:52:47,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:52:47,376 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1108 [2018-02-04 02:52:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:47,379 INFO L225 Difference]: With dead ends: 1228 [2018-02-04 02:52:47,379 INFO L226 Difference]: Without dead ends: 1228 [2018-02-04 02:52:47,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=742, Invalid=2338, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 02:52:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-02-04 02:52:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1226. [2018-02-04 02:52:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-02-04 02:52:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1229 transitions. [2018-02-04 02:52:47,386 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1229 transitions. Word has length 1108 [2018-02-04 02:52:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:47,386 INFO L432 AbstractCegarLoop]: Abstraction has 1226 states and 1229 transitions. [2018-02-04 02:52:47,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 02:52:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1229 transitions. [2018-02-04 02:52:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2018-02-04 02:52:47,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:47,393 INFO L351 BasicCegarLoop]: trace histogram [185, 169, 168, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:47,393 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:47,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1655146865, now seen corresponding path program 47 times [2018-02-04 02:52:47,394 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:47,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-02-04 02:52:49,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:49,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 02:52:49,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:49,798 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:52:49,798 INFO L182 omatonBuilderFactory]: Interpolants [50112#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 50113#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 50114#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 50115#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 50116#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 50117#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 50118#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 50119#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 50120#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 50121#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 50122#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 50123#(<= |foo_#in~size| 15), 50088#true, 50089#false, 50090#(<= 0 main_~i~1), 50091#(<= 1 main_~i~1), 50092#(<= 2 main_~i~1), 50093#(<= 3 main_~i~1), 50094#(<= 4 main_~i~1), 50095#(<= 5 main_~i~1), 50096#(<= 6 main_~i~1), 50097#(<= 7 main_~i~1), 50098#(<= 8 main_~i~1), 50099#(<= 9 main_~i~1), 50100#(<= 10 main_~i~1), 50101#(<= 11 main_~i~1), 50102#(<= 12 main_~i~1), 50103#(<= 13 main_~i~1), 50104#(<= 14 main_~i~1), 50105#(<= 15 main_~i~1), 50106#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 50107#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 50108#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 50109#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 50110#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 50111#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-04 02:52:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-02-04 02:52:49,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 02:52:49,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 02:52:49,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:52:49,800 INFO L87 Difference]: Start difference. First operand 1226 states and 1229 transitions. Second operand 36 states. [2018-02-04 02:52:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:50,312 INFO L93 Difference]: Finished difference Result 1235 states and 1236 transitions. [2018-02-04 02:52:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 02:52:50,312 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1216 [2018-02-04 02:52:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:50,314 INFO L225 Difference]: With dead ends: 1235 [2018-02-04 02:52:50,314 INFO L226 Difference]: Without dead ends: 1229 [2018-02-04 02:52:50,314 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=1955, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 02:52:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-02-04 02:52:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2018-02-04 02:52:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-02-04 02:52:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1227 transitions. [2018-02-04 02:52:50,320 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1227 transitions. Word has length 1216 [2018-02-04 02:52:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:50,320 INFO L432 AbstractCegarLoop]: Abstraction has 1226 states and 1227 transitions. [2018-02-04 02:52:50,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 02:52:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1227 transitions. [2018-02-04 02:52:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-02-04 02:52:50,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:50,326 INFO L351 BasicCegarLoop]: trace histogram [186, 170, 169, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:50,327 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:50,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1276924311, now seen corresponding path program 48 times [2018-02-04 02:52:50,327 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:50,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-02-04 02:52:51,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:51,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:52:51,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:51,931 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:52:51,931 INFO L182 omatonBuilderFactory]: Interpolants [52615#true, 52616#false, 52617#(= foo_~i~0 0), 52618#(<= foo_~i~0 1), 52619#(<= foo_~i~0 2), 52620#(<= foo_~i~0 3), 52621#(<= foo_~i~0 4), 52622#(<= foo_~i~0 5), 52623#(<= foo_~i~0 6), 52624#(<= foo_~i~0 7), 52625#(<= foo_~i~0 8), 52626#(<= foo_~i~0 9), 52627#(<= foo_~i~0 10), 52628#(<= foo_~i~0 11), 52629#(<= foo_~i~0 12), 52630#(<= foo_~i~0 13), 52631#(<= foo_~i~0 14), 52632#(<= foo_~i~0 15), 52633#(<= foo_~i~0 16), 52634#(and (<= 0 foo_~i~0) (<= foo_~i~0 16)), 52635#(and (<= 1 foo_~i~0) (<= foo_~i~0 17))] [2018-02-04 02:52:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-02-04 02:52:51,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:52:51,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:52:51,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:52:51,933 INFO L87 Difference]: Start difference. First operand 1226 states and 1227 transitions. Second operand 21 states. [2018-02-04 02:52:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:52,145 INFO L93 Difference]: Finished difference Result 1238 states and 1240 transitions. [2018-02-04 02:52:52,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:52:52,146 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1222 [2018-02-04 02:52:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:52,148 INFO L225 Difference]: With dead ends: 1238 [2018-02-04 02:52:52,148 INFO L226 Difference]: Without dead ends: 1238 [2018-02-04 02:52:52,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:52:52,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-02-04 02:52:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1232. [2018-02-04 02:52:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-02-04 02:52:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1234 transitions. [2018-02-04 02:52:52,155 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1234 transitions. Word has length 1222 [2018-02-04 02:52:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:52,155 INFO L432 AbstractCegarLoop]: Abstraction has 1232 states and 1234 transitions. [2018-02-04 02:52:52,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:52:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1234 transitions. [2018-02-04 02:52:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-02-04 02:52:52,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:52,162 INFO L351 BasicCegarLoop]: trace histogram [187, 171, 170, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:52,162 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:52,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2048514593, now seen corresponding path program 49 times [2018-02-04 02:52:52,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:52,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 18415 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-02-04 02:52:54,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:54,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 02:52:54,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:54,959 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:52:54,959 INFO L182 omatonBuilderFactory]: Interpolants [55168#(<= foo_~size (+ foo_~i~0 8)), 55169#(<= foo_~size (+ foo_~i~0 7)), 55170#(<= foo_~size (+ foo_~i~0 6)), 55171#(<= foo_~size (+ foo_~i~0 5)), 55172#(<= foo_~size (+ foo_~i~0 4)), 55173#(<= foo_~size (+ foo_~i~0 3)), 55174#(<= foo_~size (+ foo_~i~0 2)), 55175#(<= foo_~size (+ foo_~i~0 1)), 55176#(<= foo_~size foo_~i~0), 55177#(<= (+ foo_~size 1) foo_~i~0), 55138#true, 55139#false, 55140#(= main_~i~1 0), 55141#(<= main_~i~1 1), 55142#(<= main_~i~1 2), 55143#(<= main_~i~1 3), 55144#(<= main_~i~1 4), 55145#(<= main_~i~1 5), 55146#(<= main_~i~1 6), 55147#(<= main_~i~1 7), 55148#(<= main_~i~1 8), 55149#(<= main_~i~1 9), 55150#(<= main_~i~1 10), 55151#(<= main_~i~1 11), 55152#(<= main_~i~1 12), 55153#(<= main_~i~1 13), 55154#(<= main_~i~1 14), 55155#(<= main_~i~1 15), 55156#(<= main_~i~1 16), 55157#(<= |foo_#in~size| 17), 55158#(<= foo_~size 17), 55159#(<= foo_~size (+ foo_~i~0 17)), 55160#(<= foo_~size (+ foo_~i~0 16)), 55161#(<= foo_~size (+ foo_~i~0 15)), 55162#(<= foo_~size (+ foo_~i~0 14)), 55163#(<= foo_~size (+ foo_~i~0 13)), 55164#(<= foo_~size (+ foo_~i~0 12)), 55165#(<= foo_~size (+ foo_~i~0 11)), 55166#(<= foo_~size (+ foo_~i~0 10)), 55167#(<= foo_~size (+ foo_~i~0 9))] [2018-02-04 02:52:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 18415 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-02-04 02:52:54,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 02:52:54,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 02:52:54,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:52:54,961 INFO L87 Difference]: Start difference. First operand 1232 states and 1234 transitions. Second operand 40 states. [2018-02-04 02:52:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:55,887 INFO L93 Difference]: Finished difference Result 1354 states and 1357 transitions. [2018-02-04 02:52:55,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:52:55,888 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1228 [2018-02-04 02:52:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:55,890 INFO L225 Difference]: With dead ends: 1354 [2018-02-04 02:52:55,890 INFO L226 Difference]: Without dead ends: 1354 [2018-02-04 02:52:55,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=821, Invalid=2601, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 02:52:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-02-04 02:52:55,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-02-04 02:52:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-02-04 02:52:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1355 transitions. [2018-02-04 02:52:55,898 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1355 transitions. Word has length 1228 [2018-02-04 02:52:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:55,898 INFO L432 AbstractCegarLoop]: Abstraction has 1352 states and 1355 transitions. [2018-02-04 02:52:55,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 02:52:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1355 transitions. [2018-02-04 02:52:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1343 [2018-02-04 02:52:55,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:55,907 INFO L351 BasicCegarLoop]: trace histogram [205, 188, 187, 187, 187, 187, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:55,907 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1362556088, now seen corresponding path program 50 times [2018-02-04 02:52:55,908 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:55,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:52:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 113016 backedges. 36738 proven. 850 refuted. 0 times theorem prover too weak. 75428 trivial. 0 not checked. [2018-02-04 02:52:58,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:52:58,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 02:52:58,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:52:58,879 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:52:58,879 INFO L182 omatonBuilderFactory]: Interpolants [57922#true, 57923#false, 57924#(<= 0 main_~i~1), 57925#(<= 1 main_~i~1), 57926#(<= 2 main_~i~1), 57927#(<= 3 main_~i~1), 57928#(<= 4 main_~i~1), 57929#(<= 5 main_~i~1), 57930#(<= 6 main_~i~1), 57931#(<= 7 main_~i~1), 57932#(<= 8 main_~i~1), 57933#(<= 9 main_~i~1), 57934#(<= 10 main_~i~1), 57935#(<= 11 main_~i~1), 57936#(<= 12 main_~i~1), 57937#(<= 13 main_~i~1), 57938#(<= 14 main_~i~1), 57939#(<= 15 main_~i~1), 57940#(<= 16 main_~i~1), 57941#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 57942#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 57943#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 57944#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 57945#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 57946#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 57947#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 57948#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 57949#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 57950#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 57951#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 57952#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 57953#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 57954#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 57955#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 57956#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 57957#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 57958#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 57959#(<= |foo_#in~size| 16)] [2018-02-04 02:52:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 113016 backedges. 36738 proven. 850 refuted. 0 times theorem prover too weak. 75428 trivial. 0 not checked. [2018-02-04 02:52:58,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 02:52:58,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 02:52:58,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:52:58,881 INFO L87 Difference]: Start difference. First operand 1352 states and 1355 transitions. Second operand 38 states. [2018-02-04 02:52:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:52:59,659 INFO L93 Difference]: Finished difference Result 1361 states and 1362 transitions. [2018-02-04 02:52:59,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 02:52:59,659 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1342 [2018-02-04 02:52:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:52:59,661 INFO L225 Difference]: With dead ends: 1361 [2018-02-04 02:52:59,661 INFO L226 Difference]: Without dead ends: 1355 [2018-02-04 02:52:59,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=666, Invalid=2196, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 02:52:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2018-02-04 02:52:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1352. [2018-02-04 02:52:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-02-04 02:52:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1353 transitions. [2018-02-04 02:52:59,671 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1353 transitions. Word has length 1342 [2018-02-04 02:52:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:52:59,671 INFO L432 AbstractCegarLoop]: Abstraction has 1352 states and 1353 transitions. [2018-02-04 02:52:59,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 02:52:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1353 transitions. [2018-02-04 02:52:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2018-02-04 02:52:59,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:52:59,679 INFO L351 BasicCegarLoop]: trace histogram [206, 189, 188, 188, 188, 188, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:52:59,679 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:52:59,679 INFO L82 PathProgramCache]: Analyzing trace with hash 811391088, now seen corresponding path program 51 times [2018-02-04 02:52:59,680 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:52:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:52:59,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-02-04 02:53:01,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:01,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:53:01,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:01,643 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:53:01,643 INFO L182 omatonBuilderFactory]: Interpolants [60705#true, 60706#false, 60707#(= foo_~i~0 0), 60708#(<= foo_~i~0 1), 60709#(<= foo_~i~0 2), 60710#(<= foo_~i~0 3), 60711#(<= foo_~i~0 4), 60712#(<= foo_~i~0 5), 60713#(<= foo_~i~0 6), 60714#(<= foo_~i~0 7), 60715#(<= foo_~i~0 8), 60716#(<= foo_~i~0 9), 60717#(<= foo_~i~0 10), 60718#(<= foo_~i~0 11), 60719#(<= foo_~i~0 12), 60720#(<= foo_~i~0 13), 60721#(<= foo_~i~0 14), 60722#(<= foo_~i~0 15), 60723#(<= foo_~i~0 16), 60724#(and (<= 0 foo_~i~0) (<= foo_~i~0 16)), 60725#(and (<= 1 foo_~i~0) (<= foo_~i~0 17)), 60726#(and (<= foo_~i~0 18) (<= 2 foo_~i~0))] [2018-02-04 02:53:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-02-04 02:53:01,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:53:01,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:53:01,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=283, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:53:01,645 INFO L87 Difference]: Start difference. First operand 1352 states and 1353 transitions. Second operand 22 states. [2018-02-04 02:53:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:02,044 INFO L93 Difference]: Finished difference Result 1364 states and 1366 transitions. [2018-02-04 02:53:02,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:53:02,044 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1348 [2018-02-04 02:53:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:02,047 INFO L225 Difference]: With dead ends: 1364 [2018-02-04 02:53:02,047 INFO L226 Difference]: Without dead ends: 1364 [2018-02-04 02:53:02,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:53:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-02-04 02:53:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1358. [2018-02-04 02:53:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-02-04 02:53:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1360 transitions. [2018-02-04 02:53:02,058 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1360 transitions. Word has length 1348 [2018-02-04 02:53:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:02,059 INFO L432 AbstractCegarLoop]: Abstraction has 1358 states and 1360 transitions. [2018-02-04 02:53:02,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:53:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1360 transitions. [2018-02-04 02:53:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2018-02-04 02:53:02,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:02,072 INFO L351 BasicCegarLoop]: trace histogram [207, 190, 189, 189, 189, 189, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:02,072 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash 802628328, now seen corresponding path program 52 times [2018-02-04 02:53:02,073 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:02,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 21614 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-02-04 02:53:05,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:05,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 02:53:05,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:05,456 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:53:05,456 INFO L182 omatonBuilderFactory]: Interpolants [63488#(<= main_~i~1 3), 63489#(<= main_~i~1 4), 63490#(<= main_~i~1 5), 63491#(<= main_~i~1 6), 63492#(<= main_~i~1 7), 63493#(<= main_~i~1 8), 63494#(<= main_~i~1 9), 63495#(<= main_~i~1 10), 63496#(<= main_~i~1 11), 63497#(<= main_~i~1 12), 63498#(<= main_~i~1 13), 63499#(<= main_~i~1 14), 63500#(<= main_~i~1 15), 63501#(<= main_~i~1 16), 63502#(<= main_~i~1 17), 63503#(<= |foo_#in~size| 18), 63504#(<= foo_~size 18), 63505#(<= foo_~size (+ foo_~i~0 18)), 63506#(<= foo_~size (+ foo_~i~0 17)), 63507#(<= foo_~size (+ foo_~i~0 16)), 63508#(<= foo_~size (+ foo_~i~0 15)), 63509#(<= foo_~size (+ foo_~i~0 14)), 63510#(<= foo_~size (+ foo_~i~0 13)), 63511#(<= foo_~size (+ foo_~i~0 12)), 63512#(<= foo_~size (+ foo_~i~0 11)), 63513#(<= foo_~size (+ foo_~i~0 10)), 63514#(<= foo_~size (+ foo_~i~0 9)), 63515#(<= foo_~size (+ foo_~i~0 8)), 63516#(<= foo_~size (+ foo_~i~0 7)), 63517#(<= foo_~size (+ foo_~i~0 6)), 63518#(<= foo_~size (+ foo_~i~0 5)), 63519#(<= foo_~size (+ foo_~i~0 4)), 63520#(<= foo_~size (+ foo_~i~0 3)), 63521#(<= foo_~size (+ foo_~i~0 2)), 63522#(<= foo_~size (+ foo_~i~0 1)), 63523#(<= foo_~size foo_~i~0), 63524#(<= (+ foo_~size 1) foo_~i~0), 63483#true, 63484#false, 63485#(= main_~i~1 0), 63486#(<= main_~i~1 1), 63487#(<= main_~i~1 2)] [2018-02-04 02:53:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 21614 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-02-04 02:53:05,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 02:53:05,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 02:53:05,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1298, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:53:05,458 INFO L87 Difference]: Start difference. First operand 1358 states and 1360 transitions. Second operand 42 states. [2018-02-04 02:53:06,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:06,233 INFO L93 Difference]: Finished difference Result 1486 states and 1489 transitions. [2018-02-04 02:53:06,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 02:53:06,234 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1354 [2018-02-04 02:53:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:06,236 INFO L225 Difference]: With dead ends: 1486 [2018-02-04 02:53:06,237 INFO L226 Difference]: Without dead ends: 1486 [2018-02-04 02:53:06,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=904, Invalid=2878, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 02:53:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2018-02-04 02:53:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1484. [2018-02-04 02:53:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-02-04 02:53:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1487 transitions. [2018-02-04 02:53:06,244 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1487 transitions. Word has length 1354 [2018-02-04 02:53:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:06,245 INFO L432 AbstractCegarLoop]: Abstraction has 1484 states and 1487 transitions. [2018-02-04 02:53:06,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 02:53:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1487 transitions. [2018-02-04 02:53:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1475 [2018-02-04 02:53:06,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:06,254 INFO L351 BasicCegarLoop]: trace histogram [226, 208, 207, 207, 207, 207, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:06,254 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:06,254 INFO L82 PathProgramCache]: Analyzing trace with hash -773621513, now seen corresponding path program 53 times [2018-02-04 02:53:06,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:06,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 43121 proven. 954 refuted. 0 times theorem prover too weak. 93886 trivial. 0 not checked. [2018-02-04 02:53:09,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:09,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 02:53:09,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:09,965 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:53:09,965 INFO L182 omatonBuilderFactory]: Interpolants [66561#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 66560#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 66563#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 66562#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 66565#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 66564#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 66567#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 66566#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 66569#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 66568#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 66571#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 66570#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 66573#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 66572#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 66574#(<= |foo_#in~size| 17), 66535#true, 66537#(<= 0 main_~i~1), 66536#false, 66539#(<= 2 main_~i~1), 66538#(<= 1 main_~i~1), 66541#(<= 4 main_~i~1), 66540#(<= 3 main_~i~1), 66543#(<= 6 main_~i~1), 66542#(<= 5 main_~i~1), 66545#(<= 8 main_~i~1), 66544#(<= 7 main_~i~1), 66547#(<= 10 main_~i~1), 66546#(<= 9 main_~i~1), 66549#(<= 12 main_~i~1), 66548#(<= 11 main_~i~1), 66551#(<= 14 main_~i~1), 66550#(<= 13 main_~i~1), 66553#(<= 16 main_~i~1), 66552#(<= 15 main_~i~1), 66555#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 66554#(<= 17 main_~i~1), 66557#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 66556#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 66559#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 66558#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3))] [2018-02-04 02:53:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 43121 proven. 954 refuted. 0 times theorem prover too weak. 93886 trivial. 0 not checked. [2018-02-04 02:53:09,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 02:53:09,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 02:53:09,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:53:09,967 INFO L87 Difference]: Start difference. First operand 1484 states and 1487 transitions. Second operand 40 states. [2018-02-04 02:53:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:10,498 INFO L93 Difference]: Finished difference Result 1493 states and 1494 transitions. [2018-02-04 02:53:10,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 02:53:10,499 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1474 [2018-02-04 02:53:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:10,502 INFO L225 Difference]: With dead ends: 1493 [2018-02-04 02:53:10,502 INFO L226 Difference]: Without dead ends: 1487 [2018-02-04 02:53:10,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=2451, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 02:53:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-02-04 02:53:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1484. [2018-02-04 02:53:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-02-04 02:53:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1485 transitions. [2018-02-04 02:53:10,510 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1485 transitions. Word has length 1474 [2018-02-04 02:53:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:10,510 INFO L432 AbstractCegarLoop]: Abstraction has 1484 states and 1485 transitions. [2018-02-04 02:53:10,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 02:53:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1485 transitions. [2018-02-04 02:53:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1481 [2018-02-04 02:53:10,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:10,520 INFO L351 BasicCegarLoop]: trace histogram [227, 209, 208, 208, 208, 208, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:10,520 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:10,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1994293615, now seen corresponding path program 54 times [2018-02-04 02:53:10,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:10,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 139242 backedges. 22833 proven. 1083 refuted. 0 times theorem prover too weak. 115326 trivial. 0 not checked. [2018-02-04 02:53:12,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:12,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:53:12,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:12,905 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:53:12,905 INFO L182 omatonBuilderFactory]: Interpolants [69601#(<= foo_~i~0 13), 69600#(<= foo_~i~0 12), 69603#(<= foo_~i~0 15), 69602#(<= foo_~i~0 14), 69605#(<= foo_~i~0 17), 69604#(<= foo_~i~0 16), 69607#(and (<= 0 foo_~i~0) (<= foo_~i~0 18)), 69606#(<= foo_~i~0 18), 69608#(and (<= foo_~i~0 19) (<= 1 foo_~i~0)), 69587#false, 69586#true, 69589#(<= foo_~i~0 1), 69588#(= foo_~i~0 0), 69591#(<= foo_~i~0 3), 69590#(<= foo_~i~0 2), 69593#(<= foo_~i~0 5), 69592#(<= foo_~i~0 4), 69595#(<= foo_~i~0 7), 69594#(<= foo_~i~0 6), 69597#(<= foo_~i~0 9), 69596#(<= foo_~i~0 8), 69599#(<= foo_~i~0 11), 69598#(<= foo_~i~0 10)] [2018-02-04 02:53:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 139242 backedges. 22833 proven. 1083 refuted. 0 times theorem prover too weak. 115326 trivial. 0 not checked. [2018-02-04 02:53:12,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:53:12,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:53:12,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=290, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:53:12,907 INFO L87 Difference]: Start difference. First operand 1484 states and 1485 transitions. Second operand 23 states. [2018-02-04 02:53:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:13,149 INFO L93 Difference]: Finished difference Result 1496 states and 1498 transitions. [2018-02-04 02:53:13,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:53:13,150 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1480 [2018-02-04 02:53:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:13,153 INFO L225 Difference]: With dead ends: 1496 [2018-02-04 02:53:13,153 INFO L226 Difference]: Without dead ends: 1496 [2018-02-04 02:53:13,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=612, Invalid=1028, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:53:13,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2018-02-04 02:53:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1490. [2018-02-04 02:53:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-02-04 02:53:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1492 transitions. [2018-02-04 02:53:13,160 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1492 transitions. Word has length 1480 [2018-02-04 02:53:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:13,160 INFO L432 AbstractCegarLoop]: Abstraction has 1490 states and 1492 transitions. [2018-02-04 02:53:13,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:53:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1492 transitions. [2018-02-04 02:53:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1487 [2018-02-04 02:53:13,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:13,169 INFO L351 BasicCegarLoop]: trace histogram [228, 210, 209, 209, 209, 209, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:13,170 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1714433881, now seen corresponding path program 55 times [2018-02-04 02:53:13,170 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:13,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 140529 backedges. 25162 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-02-04 02:53:17,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:17,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 02:53:17,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:17,259 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:53:17,259 INFO L182 omatonBuilderFactory]: Interpolants [72641#(<= main_~i~1 8), 72640#(<= main_~i~1 7), 72643#(<= main_~i~1 10), 72642#(<= main_~i~1 9), 72645#(<= main_~i~1 12), 72644#(<= main_~i~1 11), 72647#(<= main_~i~1 14), 72646#(<= main_~i~1 13), 72649#(<= main_~i~1 16), 72648#(<= main_~i~1 15), 72651#(<= main_~i~1 18), 72650#(<= main_~i~1 17), 72653#(<= foo_~size 19), 72652#(<= |foo_#in~size| 19), 72655#(<= foo_~size (+ foo_~i~0 18)), 72654#(<= foo_~size (+ foo_~i~0 19)), 72657#(<= foo_~size (+ foo_~i~0 16)), 72656#(<= foo_~size (+ foo_~i~0 17)), 72659#(<= foo_~size (+ foo_~i~0 14)), 72658#(<= foo_~size (+ foo_~i~0 15)), 72661#(<= foo_~size (+ foo_~i~0 12)), 72660#(<= foo_~size (+ foo_~i~0 13)), 72663#(<= foo_~size (+ foo_~i~0 10)), 72662#(<= foo_~size (+ foo_~i~0 11)), 72665#(<= foo_~size (+ foo_~i~0 8)), 72664#(<= foo_~size (+ foo_~i~0 9)), 72667#(<= foo_~size (+ foo_~i~0 6)), 72666#(<= foo_~size (+ foo_~i~0 7)), 72669#(<= foo_~size (+ foo_~i~0 4)), 72668#(<= foo_~size (+ foo_~i~0 5)), 72671#(<= foo_~size (+ foo_~i~0 2)), 72670#(<= foo_~size (+ foo_~i~0 3)), 72673#(<= foo_~size foo_~i~0), 72672#(<= foo_~size (+ foo_~i~0 1)), 72674#(<= (+ foo_~size 1) foo_~i~0), 72631#true, 72633#(= main_~i~1 0), 72632#false, 72635#(<= main_~i~1 2), 72634#(<= main_~i~1 1), 72637#(<= main_~i~1 4), 72636#(<= main_~i~1 3), 72639#(<= main_~i~1 6), 72638#(<= main_~i~1 5)] [2018-02-04 02:53:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 140529 backedges. 25162 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-02-04 02:53:17,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 02:53:17,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 02:53:17,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 02:53:17,262 INFO L87 Difference]: Start difference. First operand 1490 states and 1492 transitions. Second operand 44 states. [2018-02-04 02:53:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:17,889 INFO L93 Difference]: Finished difference Result 1624 states and 1627 transitions. [2018-02-04 02:53:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 02:53:17,889 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1486 [2018-02-04 02:53:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:17,892 INFO L225 Difference]: With dead ends: 1624 [2018-02-04 02:53:17,892 INFO L226 Difference]: Without dead ends: 1624 [2018-02-04 02:53:17,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=991, Invalid=3169, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 02:53:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2018-02-04 02:53:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1622. [2018-02-04 02:53:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-02-04 02:53:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1625 transitions. [2018-02-04 02:53:17,900 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1625 transitions. Word has length 1486 [2018-02-04 02:53:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:17,901 INFO L432 AbstractCegarLoop]: Abstraction has 1622 states and 1625 transitions. [2018-02-04 02:53:17,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 02:53:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1625 transitions. [2018-02-04 02:53:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1613 [2018-02-04 02:53:17,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:17,913 INFO L351 BasicCegarLoop]: trace histogram [248, 229, 228, 228, 228, 228, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:17,913 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2073091154, now seen corresponding path program 56 times [2018-02-04 02:53:17,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:17,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 166801 backedges. 50201 proven. 1064 refuted. 0 times theorem prover too weak. 115536 trivial. 0 not checked. [2018-02-04 02:53:22,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:22,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 02:53:22,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:22,639 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:53:22,639 INFO L182 omatonBuilderFactory]: Interpolants [75969#(<= 4 main_~i~1), 75968#(<= 3 main_~i~1), 75971#(<= 6 main_~i~1), 75970#(<= 5 main_~i~1), 75973#(<= 8 main_~i~1), 75972#(<= 7 main_~i~1), 75975#(<= 10 main_~i~1), 75974#(<= 9 main_~i~1), 75977#(<= 12 main_~i~1), 75976#(<= 11 main_~i~1), 75979#(<= 14 main_~i~1), 75978#(<= 13 main_~i~1), 75981#(<= 16 main_~i~1), 75980#(<= 15 main_~i~1), 75983#(<= 18 main_~i~1), 75982#(<= 17 main_~i~1), 75985#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 75984#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 75987#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 75986#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 75989#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 75988#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 75991#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 75990#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 75993#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 75992#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 75995#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 75994#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 75997#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 75996#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 75999#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 75998#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 76001#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 76000#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 76003#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 19)), 76002#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 76004#(<= |foo_#in~size| 18), 75963#true, 75965#(<= 0 main_~i~1), 75964#false, 75967#(<= 2 main_~i~1), 75966#(<= 1 main_~i~1)] [2018-02-04 02:53:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 166801 backedges. 50201 proven. 1064 refuted. 0 times theorem prover too weak. 115536 trivial. 0 not checked. [2018-02-04 02:53:22,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 02:53:22,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 02:53:22,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1280, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:53:22,642 INFO L87 Difference]: Start difference. First operand 1622 states and 1625 transitions. Second operand 42 states. [2018-02-04 02:53:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:23,300 INFO L93 Difference]: Finished difference Result 1631 states and 1632 transitions. [2018-02-04 02:53:23,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 02:53:23,300 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1612 [2018-02-04 02:53:23,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:23,303 INFO L225 Difference]: With dead ends: 1631 [2018-02-04 02:53:23,303 INFO L226 Difference]: Without dead ends: 1625 [2018-02-04 02:53:23,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=820, Invalid=2720, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 02:53:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2018-02-04 02:53:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1622. [2018-02-04 02:53:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-02-04 02:53:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1623 transitions. [2018-02-04 02:53:23,310 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1623 transitions. Word has length 1612 [2018-02-04 02:53:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:23,310 INFO L432 AbstractCegarLoop]: Abstraction has 1622 states and 1623 transitions. [2018-02-04 02:53:23,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 02:53:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1623 transitions. [2018-02-04 02:53:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1619 [2018-02-04 02:53:23,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:23,321 INFO L351 BasicCegarLoop]: trace histogram [249, 230, 229, 229, 229, 229, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:23,321 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:23,321 INFO L82 PathProgramCache]: Analyzing trace with hash -758475034, now seen corresponding path program 57 times [2018-02-04 02:53:23,322 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:23,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-02-04 02:53:26,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:26,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:53:26,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:26,219 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:53:26,219 INFO L182 omatonBuilderFactory]: Interpolants [79297#(<= foo_~i~0 1), 79296#(= foo_~i~0 0), 79299#(<= foo_~i~0 3), 79298#(<= foo_~i~0 2), 79301#(<= foo_~i~0 5), 79300#(<= foo_~i~0 4), 79303#(<= foo_~i~0 7), 79302#(<= foo_~i~0 6), 79305#(<= foo_~i~0 9), 79304#(<= foo_~i~0 8), 79307#(<= foo_~i~0 11), 79306#(<= foo_~i~0 10), 79309#(<= foo_~i~0 13), 79308#(<= foo_~i~0 12), 79311#(<= foo_~i~0 15), 79310#(<= foo_~i~0 14), 79313#(and (<= 0 foo_~i~0) (<= foo_~i~0 16)), 79312#(<= foo_~i~0 16), 79315#(and (<= foo_~i~0 18) (<= 2 foo_~i~0)), 79314#(and (<= 1 foo_~i~0) (<= foo_~i~0 17)), 79317#(and (<= 4 foo_~i~0) (<= foo_~i~0 20)), 79316#(and (<= foo_~i~0 19) (<= 3 foo_~i~0)), 79295#false, 79294#true] [2018-02-04 02:53:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-02-04 02:53:26,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:53:26,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:53:26,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:53:26,222 INFO L87 Difference]: Start difference. First operand 1622 states and 1623 transitions. Second operand 24 states. [2018-02-04 02:53:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:26,569 INFO L93 Difference]: Finished difference Result 1634 states and 1636 transitions. [2018-02-04 02:53:26,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:53:26,569 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1618 [2018-02-04 02:53:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:26,572 INFO L225 Difference]: With dead ends: 1634 [2018-02-04 02:53:26,572 INFO L226 Difference]: Without dead ends: 1634 [2018-02-04 02:53:26,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=560, Invalid=1246, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 02:53:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2018-02-04 02:53:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1628. [2018-02-04 02:53:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-02-04 02:53:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1630 transitions. [2018-02-04 02:53:26,579 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1630 transitions. Word has length 1618 [2018-02-04 02:53:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:26,580 INFO L432 AbstractCegarLoop]: Abstraction has 1628 states and 1630 transitions. [2018-02-04 02:53:26,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:53:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1630 transitions. [2018-02-04 02:53:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-02-04 02:53:26,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:26,590 INFO L351 BasicCegarLoop]: trace histogram [250, 231, 230, 230, 230, 230, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:26,590 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:26,591 INFO L82 PathProgramCache]: Analyzing trace with hash -828526370, now seen corresponding path program 58 times [2018-02-04 02:53:26,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:26,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29077 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-02-04 02:53:31,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:31,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 02:53:31,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:31,362 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:53:31,362 INFO L182 omatonBuilderFactory]: Interpolants [82625#(<= main_~i~1 5), 82624#(<= main_~i~1 4), 82627#(<= main_~i~1 7), 82626#(<= main_~i~1 6), 82629#(<= main_~i~1 9), 82628#(<= main_~i~1 8), 82631#(<= main_~i~1 11), 82630#(<= main_~i~1 10), 82633#(<= main_~i~1 13), 82632#(<= main_~i~1 12), 82635#(<= main_~i~1 15), 82634#(<= main_~i~1 14), 82637#(<= main_~i~1 17), 82636#(<= main_~i~1 16), 82639#(<= main_~i~1 19), 82638#(<= main_~i~1 18), 82641#(<= foo_~size 20), 82640#(<= |foo_#in~size| 20), 82643#(<= foo_~size (+ foo_~i~0 19)), 82642#(<= foo_~size (+ foo_~i~0 20)), 82645#(<= foo_~size (+ foo_~i~0 17)), 82644#(<= foo_~size (+ foo_~i~0 18)), 82647#(<= foo_~size (+ foo_~i~0 15)), 82646#(<= foo_~size (+ foo_~i~0 16)), 82649#(<= foo_~size (+ foo_~i~0 13)), 82648#(<= foo_~size (+ foo_~i~0 14)), 82651#(<= foo_~size (+ foo_~i~0 11)), 82650#(<= foo_~size (+ foo_~i~0 12)), 82653#(<= foo_~size (+ foo_~i~0 9)), 82652#(<= foo_~size (+ foo_~i~0 10)), 82655#(<= foo_~size (+ foo_~i~0 7)), 82654#(<= foo_~size (+ foo_~i~0 8)), 82657#(<= foo_~size (+ foo_~i~0 5)), 82656#(<= foo_~size (+ foo_~i~0 6)), 82659#(<= foo_~size (+ foo_~i~0 3)), 82658#(<= foo_~size (+ foo_~i~0 4)), 82661#(<= foo_~size (+ foo_~i~0 1)), 82660#(<= foo_~size (+ foo_~i~0 2)), 82663#(<= (+ foo_~size 1) foo_~i~0), 82662#(<= foo_~size foo_~i~0), 82619#false, 82618#true, 82621#(<= main_~i~1 1), 82620#(= main_~i~1 0), 82623#(<= main_~i~1 3), 82622#(<= main_~i~1 2)] [2018-02-04 02:53:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29077 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-02-04 02:53:31,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 02:53:31,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 02:53:31,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=1560, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 02:53:31,365 INFO L87 Difference]: Start difference. First operand 1628 states and 1630 transitions. Second operand 46 states. [2018-02-04 02:53:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:32,073 INFO L93 Difference]: Finished difference Result 1768 states and 1771 transitions. [2018-02-04 02:53:32,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 02:53:32,073 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1624 [2018-02-04 02:53:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:32,076 INFO L225 Difference]: With dead ends: 1768 [2018-02-04 02:53:32,076 INFO L226 Difference]: Without dead ends: 1768 [2018-02-04 02:53:32,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1082, Invalid=3474, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 02:53:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-02-04 02:53:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1766. [2018-02-04 02:53:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2018-02-04 02:53:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 1769 transitions. [2018-02-04 02:53:32,084 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 1769 transitions. Word has length 1624 [2018-02-04 02:53:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:32,084 INFO L432 AbstractCegarLoop]: Abstraction has 1766 states and 1769 transitions. [2018-02-04 02:53:32,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 02:53:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 1769 transitions. [2018-02-04 02:53:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1757 [2018-02-04 02:53:32,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:32,097 INFO L351 BasicCegarLoop]: trace histogram [271, 251, 250, 250, 250, 250, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:32,097 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash -500562851, now seen corresponding path program 59 times [2018-02-04 02:53:32,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:32,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 199920 backedges. 55569 proven. 3846 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-02-04 02:53:38,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:38,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 02:53:38,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:38,168 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:53:38,168 INFO L182 omatonBuilderFactory]: Interpolants [86273#(<= foo_~size (+ foo_~i~0 17)), 86272#(<= foo_~size (+ foo_~i~0 18)), 86275#(<= foo_~size (+ foo_~i~0 15)), 86274#(<= foo_~size (+ foo_~i~0 16)), 86277#(<= foo_~size (+ foo_~i~0 13)), 86276#(<= foo_~size (+ foo_~i~0 14)), 86279#(<= foo_~size (+ foo_~i~0 11)), 86278#(<= foo_~size (+ foo_~i~0 12)), 86281#(<= foo_~size (+ foo_~i~0 9)), 86280#(<= foo_~size (+ foo_~i~0 10)), 86283#(<= foo_~size (+ foo_~i~0 7)), 86282#(<= foo_~size (+ foo_~i~0 8)), 86285#(<= foo_~size (+ foo_~i~0 5)), 86284#(<= foo_~size (+ foo_~i~0 6)), 86287#(<= foo_~size (+ foo_~i~0 3)), 86286#(<= foo_~size (+ foo_~i~0 4)), 86289#(<= foo_~size (+ foo_~i~0 1)), 86288#(<= foo_~size (+ foo_~i~0 2)), 86291#(<= (+ foo_~size 1) foo_~i~0), 86290#(<= foo_~size foo_~i~0), 86243#false, 86242#true, 86245#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 86244#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 86247#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 86246#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 86249#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 86248#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 86251#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 86250#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 86253#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 86252#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 86255#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 86254#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 86257#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 86256#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 86259#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 86258#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 86261#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 86260#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 86263#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 19)), 86262#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 86265#(<= |foo_#in~size| 19), 86264#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 20)), 86267#(<= main_~i~1 19), 86266#(<= main_~i~1 18), 86269#(<= foo_~size 20), 86268#(<= |foo_#in~size| 20), 86271#(<= foo_~size (+ foo_~i~0 19)), 86270#(<= foo_~size (+ foo_~i~0 20))] [2018-02-04 02:53:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 199920 backedges. 55569 proven. 3846 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-02-04 02:53:38,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 02:53:38,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 02:53:38,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=1910, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:53:38,171 INFO L87 Difference]: Start difference. First operand 1766 states and 1769 transitions. Second operand 50 states. [2018-02-04 02:53:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:39,269 INFO L93 Difference]: Finished difference Result 1918 states and 1922 transitions. [2018-02-04 02:53:39,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 02:53:39,269 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1756 [2018-02-04 02:53:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:39,272 INFO L225 Difference]: With dead ends: 1918 [2018-02-04 02:53:39,272 INFO L226 Difference]: Without dead ends: 1918 [2018-02-04 02:53:39,273 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2332, Invalid=6598, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 02:53:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2018-02-04 02:53:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1772. [2018-02-04 02:53:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-02-04 02:53:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 1775 transitions. [2018-02-04 02:53:39,282 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 1775 transitions. Word has length 1756 [2018-02-04 02:53:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:39,282 INFO L432 AbstractCegarLoop]: Abstraction has 1772 states and 1775 transitions. [2018-02-04 02:53:39,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 02:53:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 1775 transitions. [2018-02-04 02:53:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1763 [2018-02-04 02:53:39,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:39,295 INFO L351 BasicCegarLoop]: trace histogram [272, 252, 251, 251, 251, 251, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:39,295 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1828222891, now seen corresponding path program 60 times [2018-02-04 02:53:39,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:39,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 201463 backedges. 30550 proven. 1323 refuted. 0 times theorem prover too weak. 169590 trivial. 0 not checked. [2018-02-04 02:53:42,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:42,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:53:42,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:42,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:53:42,700 INFO L182 omatonBuilderFactory]: Interpolants [90073#false, 90072#true, 90075#(<= foo_~i~0 1), 90074#(= foo_~i~0 0), 90077#(<= foo_~i~0 3), 90076#(<= foo_~i~0 2), 90079#(<= foo_~i~0 5), 90078#(<= foo_~i~0 4), 90081#(<= foo_~i~0 7), 90080#(<= foo_~i~0 6), 90083#(<= foo_~i~0 9), 90082#(<= foo_~i~0 8), 90085#(<= foo_~i~0 11), 90084#(<= foo_~i~0 10), 90087#(<= foo_~i~0 13), 90086#(<= foo_~i~0 12), 90089#(<= foo_~i~0 15), 90088#(<= foo_~i~0 14), 90091#(<= foo_~i~0 17), 90090#(<= foo_~i~0 16), 90093#(<= foo_~i~0 19), 90092#(<= foo_~i~0 18), 90095#(and (<= 0 foo_~i~0) (<= foo_~i~0 20)), 90094#(<= foo_~i~0 20), 90096#(and (<= foo_~i~0 21) (<= 1 foo_~i~0))] [2018-02-04 02:53:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 201463 backedges. 30550 proven. 1323 refuted. 0 times theorem prover too weak. 169590 trivial. 0 not checked. [2018-02-04 02:53:42,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:53:42,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:53:42,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:53:42,703 INFO L87 Difference]: Start difference. First operand 1772 states and 1775 transitions. Second operand 25 states. [2018-02-04 02:53:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:42,990 INFO L93 Difference]: Finished difference Result 1784 states and 1788 transitions. [2018-02-04 02:53:42,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:53:42,991 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1762 [2018-02-04 02:53:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:42,993 INFO L225 Difference]: With dead ends: 1784 [2018-02-04 02:53:42,994 INFO L226 Difference]: Without dead ends: 1784 [2018-02-04 02:53:42,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=739, Invalid=1241, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 02:53:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2018-02-04 02:53:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1778. [2018-02-04 02:53:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-02-04 02:53:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 1782 transitions. [2018-02-04 02:53:43,002 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 1782 transitions. Word has length 1762 [2018-02-04 02:53:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:43,003 INFO L432 AbstractCegarLoop]: Abstraction has 1778 states and 1782 transitions. [2018-02-04 02:53:43,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:53:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 1782 transitions. [2018-02-04 02:53:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1769 [2018-02-04 02:53:43,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:43,020 INFO L351 BasicCegarLoop]: trace histogram [273, 253, 252, 252, 252, 252, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:43,020 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:43,021 INFO L82 PathProgramCache]: Analyzing trace with hash 527799053, now seen corresponding path program 61 times [2018-02-04 02:53:43,021 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:43,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33377 proven. 1285 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-02-04 02:53:48,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:48,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 02:53:48,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:48,930 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:53:48,930 INFO L182 omatonBuilderFactory]: Interpolants [93699#true, 93701#(= main_~i~1 0), 93700#false, 93703#(<= main_~i~1 2), 93702#(<= main_~i~1 1), 93705#(<= main_~i~1 4), 93704#(<= main_~i~1 3), 93707#(<= main_~i~1 6), 93706#(<= main_~i~1 5), 93709#(<= main_~i~1 8), 93708#(<= main_~i~1 7), 93711#(<= main_~i~1 10), 93710#(<= main_~i~1 9), 93713#(<= main_~i~1 12), 93712#(<= main_~i~1 11), 93715#(<= main_~i~1 14), 93714#(<= main_~i~1 13), 93717#(<= main_~i~1 16), 93716#(<= main_~i~1 15), 93719#(<= main_~i~1 18), 93718#(<= main_~i~1 17), 93721#(<= main_~i~1 20), 93720#(<= main_~i~1 19), 93723#(<= foo_~size 21), 93722#(<= |foo_#in~size| 21), 93725#(<= foo_~size (+ foo_~i~0 20)), 93724#(<= foo_~size (+ foo_~i~0 21)), 93727#(<= foo_~size (+ foo_~i~0 18)), 93726#(<= foo_~size (+ foo_~i~0 19)), 93729#(<= foo_~size (+ foo_~i~0 16)), 93728#(<= foo_~size (+ foo_~i~0 17)), 93731#(<= foo_~size (+ foo_~i~0 14)), 93730#(<= foo_~size (+ foo_~i~0 15)), 93733#(<= foo_~size (+ foo_~i~0 12)), 93732#(<= foo_~size (+ foo_~i~0 13)), 93735#(<= foo_~size (+ foo_~i~0 10)), 93734#(<= foo_~size (+ foo_~i~0 11)), 93737#(<= foo_~size (+ foo_~i~0 8)), 93736#(<= foo_~size (+ foo_~i~0 9)), 93739#(<= foo_~size (+ foo_~i~0 6)), 93738#(<= foo_~size (+ foo_~i~0 7)), 93741#(<= foo_~size (+ foo_~i~0 4)), 93740#(<= foo_~size (+ foo_~i~0 5)), 93743#(<= foo_~size (+ foo_~i~0 2)), 93742#(<= foo_~size (+ foo_~i~0 3)), 93745#(<= foo_~size foo_~i~0), 93744#(<= foo_~size (+ foo_~i~0 1)), 93746#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-04 02:53:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33377 proven. 1285 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-02-04 02:53:48,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 02:53:48,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 02:53:48,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 02:53:48,932 INFO L87 Difference]: Start difference. First operand 1778 states and 1782 transitions. Second operand 48 states. [2018-02-04 02:53:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:49,832 INFO L93 Difference]: Finished difference Result 2076 states and 2085 transitions. [2018-02-04 02:53:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 02:53:49,832 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1768 [2018-02-04 02:53:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:49,836 INFO L225 Difference]: With dead ends: 2076 [2018-02-04 02:53:49,837 INFO L226 Difference]: Without dead ends: 2076 [2018-02-04 02:53:49,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1177, Invalid=3793, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 02:53:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2018-02-04 02:53:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2072. [2018-02-04 02:53:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-02-04 02:53:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2081 transitions. [2018-02-04 02:53:49,853 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2081 transitions. Word has length 1768 [2018-02-04 02:53:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:49,854 INFO L432 AbstractCegarLoop]: Abstraction has 2072 states and 2081 transitions. [2018-02-04 02:53:49,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 02:53:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2081 transitions. [2018-02-04 02:53:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1901 [2018-02-04 02:53:49,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:49,872 INFO L351 BasicCegarLoop]: trace histogram [294, 273, 272, 272, 272, 272, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:49,872 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1101666444, now seen corresponding path program 62 times [2018-02-04 02:53:49,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:49,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:53:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-02-04 02:53:56,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:53:56,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 02:53:56,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:53:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:53:56,720 INFO L182 omatonBuilderFactory]: Interpolants [97985#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 21)), 97984#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 20)), 97986#(<= |foo_#in~size| 20), 97941#true, 97943#(<= 0 main_~i~1), 97942#false, 97945#(<= 2 main_~i~1), 97944#(<= 1 main_~i~1), 97947#(<= 4 main_~i~1), 97946#(<= 3 main_~i~1), 97949#(<= 6 main_~i~1), 97948#(<= 5 main_~i~1), 97951#(<= 8 main_~i~1), 97950#(<= 7 main_~i~1), 97953#(<= 10 main_~i~1), 97952#(<= 9 main_~i~1), 97955#(<= 12 main_~i~1), 97954#(<= 11 main_~i~1), 97957#(<= 14 main_~i~1), 97956#(<= 13 main_~i~1), 97959#(<= 16 main_~i~1), 97958#(<= 15 main_~i~1), 97961#(<= 18 main_~i~1), 97960#(<= 17 main_~i~1), 97963#(<= 20 main_~i~1), 97962#(<= 19 main_~i~1), 97965#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 97964#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 97967#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 97966#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 97969#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 97968#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 97971#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 97970#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 97973#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 97972#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 97975#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 97974#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 97977#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 97976#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 97979#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 97978#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 97981#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 97980#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 97983#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 19)), 97982#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18))] [2018-02-04 02:53:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-02-04 02:53:56,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 02:53:56,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 02:53:56,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1540, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 02:53:56,724 INFO L87 Difference]: Start difference. First operand 2072 states and 2081 transitions. Second operand 46 states. [2018-02-04 02:53:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:53:57,161 INFO L93 Difference]: Finished difference Result 1940 states and 1942 transitions. [2018-02-04 02:53:57,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 02:53:57,162 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1900 [2018-02-04 02:53:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:53:57,165 INFO L225 Difference]: With dead ends: 1940 [2018-02-04 02:53:57,166 INFO L226 Difference]: Without dead ends: 1919 [2018-02-04 02:53:57,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=990, Invalid=3300, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 02:53:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2018-02-04 02:53:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1916. [2018-02-04 02:53:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2018-02-04 02:53:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 1917 transitions. [2018-02-04 02:53:57,181 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 1917 transitions. Word has length 1900 [2018-02-04 02:53:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:53:57,182 INFO L432 AbstractCegarLoop]: Abstraction has 1916 states and 1917 transitions. [2018-02-04 02:53:57,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 02:53:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 1917 transitions. [2018-02-04 02:53:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1913 [2018-02-04 02:53:57,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:53:57,207 INFO L351 BasicCegarLoop]: trace histogram [296, 275, 274, 274, 274, 274, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:53:57,207 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:53:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1723381956, now seen corresponding path program 63 times [2018-02-04 02:53:57,209 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:53:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:53:57,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-02-04 02:54:01,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:01,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:54:01,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:01,446 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:54:01,446 INFO L182 omatonBuilderFactory]: Interpolants [101889#(<= foo_~i~0 4), 101888#(<= foo_~i~0 3), 101891#(<= foo_~i~0 6), 101890#(<= foo_~i~0 5), 101893#(<= foo_~i~0 8), 101892#(<= foo_~i~0 7), 101895#(<= foo_~i~0 10), 101894#(<= foo_~i~0 9), 101897#(<= foo_~i~0 12), 101896#(<= foo_~i~0 11), 101899#(<= foo_~i~0 14), 101898#(<= foo_~i~0 13), 101901#(<= foo_~i~0 16), 101900#(<= foo_~i~0 15), 101903#(<= foo_~i~0 18), 101902#(<= foo_~i~0 17), 101905#(<= foo_~i~0 20), 101904#(<= foo_~i~0 19), 101907#(and (<= foo_~i~0 21) (<= 1 foo_~i~0)), 101906#(and (<= 0 foo_~i~0) (<= foo_~i~0 20)), 101908#(and (<= foo_~i~0 22) (<= 2 foo_~i~0)), 101883#true, 101885#(= foo_~i~0 0), 101884#false, 101887#(<= foo_~i~0 2), 101886#(<= foo_~i~0 1)] [2018-02-04 02:54:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-02-04 02:54:01,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:54:01,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:54:01,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:54:01,449 INFO L87 Difference]: Start difference. First operand 1916 states and 1917 transitions. Second operand 26 states. [2018-02-04 02:54:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:01,860 INFO L93 Difference]: Finished difference Result 1928 states and 1930 transitions. [2018-02-04 02:54:01,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:54:01,860 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1912 [2018-02-04 02:54:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:01,866 INFO L225 Difference]: With dead ends: 1928 [2018-02-04 02:54:01,867 INFO L226 Difference]: Without dead ends: 1928 [2018-02-04 02:54:01,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 02:54:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-02-04 02:54:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1922. [2018-02-04 02:54:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-02-04 02:54:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 1924 transitions. [2018-02-04 02:54:01,883 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 1924 transitions. Word has length 1912 [2018-02-04 02:54:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:01,885 INFO L432 AbstractCegarLoop]: Abstraction has 1922 states and 1924 transitions. [2018-02-04 02:54:01,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:54:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 1924 transitions. [2018-02-04 02:54:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2018-02-04 02:54:01,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:01,909 INFO L351 BasicCegarLoop]: trace histogram [297, 276, 275, 275, 275, 275, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:01,909 INFO L371 AbstractCegarLoop]: === Iteration 73 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:54:01,910 INFO L82 PathProgramCache]: Analyzing trace with hash -701609804, now seen corresponding path program 64 times [2018-02-04 02:54:01,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:02,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 241092 backedges. 38080 proven. 1412 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-02-04 02:54:09,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:09,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 02:54:09,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:09,272 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:54:09,272 INFO L182 omatonBuilderFactory]: Interpolants [105801#true, 105803#(= main_~i~1 0), 105802#false, 105805#(<= main_~i~1 2), 105804#(<= main_~i~1 1), 105807#(<= main_~i~1 4), 105806#(<= main_~i~1 3), 105809#(<= main_~i~1 6), 105808#(<= main_~i~1 5), 105811#(<= main_~i~1 8), 105810#(<= main_~i~1 7), 105813#(<= main_~i~1 10), 105812#(<= main_~i~1 9), 105815#(<= main_~i~1 12), 105814#(<= main_~i~1 11), 105817#(<= main_~i~1 14), 105816#(<= main_~i~1 13), 105819#(<= main_~i~1 16), 105818#(<= main_~i~1 15), 105821#(<= main_~i~1 18), 105820#(<= main_~i~1 17), 105823#(<= main_~i~1 20), 105822#(<= main_~i~1 19), 105825#(<= |foo_#in~size| 22), 105824#(<= main_~i~1 21), 105827#(<= foo_~size (+ foo_~i~0 22)), 105826#(<= foo_~size 22), 105829#(<= foo_~size (+ foo_~i~0 20)), 105828#(<= foo_~size (+ foo_~i~0 21)), 105831#(<= foo_~size (+ foo_~i~0 18)), 105830#(<= foo_~size (+ foo_~i~0 19)), 105833#(<= foo_~size (+ foo_~i~0 16)), 105832#(<= foo_~size (+ foo_~i~0 17)), 105835#(<= foo_~size (+ foo_~i~0 14)), 105834#(<= foo_~size (+ foo_~i~0 15)), 105837#(<= foo_~size (+ foo_~i~0 12)), 105836#(<= foo_~size (+ foo_~i~0 13)), 105839#(<= foo_~size (+ foo_~i~0 10)), 105838#(<= foo_~size (+ foo_~i~0 11)), 105841#(<= foo_~size (+ foo_~i~0 8)), 105840#(<= foo_~size (+ foo_~i~0 9)), 105843#(<= foo_~size (+ foo_~i~0 6)), 105842#(<= foo_~size (+ foo_~i~0 7)), 105845#(<= foo_~size (+ foo_~i~0 4)), 105844#(<= foo_~size (+ foo_~i~0 5)), 105847#(<= foo_~size (+ foo_~i~0 2)), 105846#(<= foo_~size (+ foo_~i~0 3)), 105849#(<= foo_~size foo_~i~0), 105848#(<= foo_~size (+ foo_~i~0 1)), 105850#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-04 02:54:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 241092 backedges. 38080 proven. 1412 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-02-04 02:54:09,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 02:54:09,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 02:54:09,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=604, Invalid=1846, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:54:09,275 INFO L87 Difference]: Start difference. First operand 1922 states and 1924 transitions. Second operand 50 states. [2018-02-04 02:54:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:10,223 INFO L93 Difference]: Finished difference Result 2074 states and 2077 transitions. [2018-02-04 02:54:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 02:54:10,223 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1918 [2018-02-04 02:54:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:10,227 INFO L225 Difference]: With dead ends: 2074 [2018-02-04 02:54:10,227 INFO L226 Difference]: Without dead ends: 2074 [2018-02-04 02:54:10,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1276, Invalid=4126, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 02:54:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2018-02-04 02:54:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2072. [2018-02-04 02:54:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-02-04 02:54:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2075 transitions. [2018-02-04 02:54:10,238 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2075 transitions. Word has length 1918 [2018-02-04 02:54:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:10,239 INFO L432 AbstractCegarLoop]: Abstraction has 2072 states and 2075 transitions. [2018-02-04 02:54:10,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 02:54:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2075 transitions. [2018-02-04 02:54:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2063 [2018-02-04 02:54:10,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:10,257 INFO L351 BasicCegarLoop]: trace histogram [320, 298, 297, 297, 297, 297, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:10,257 INFO L371 AbstractCegarLoop]: === Iteration 74 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:54:10,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1744949341, now seen corresponding path program 65 times [2018-02-04 02:54:10,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:10,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 280621 backedges. 75983 proven. 1430 refuted. 0 times theorem prover too weak. 203208 trivial. 0 not checked. [2018-02-04 02:54:18,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:18,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 02:54:18,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:18,526 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:54:18,526 INFO L182 omatonBuilderFactory]: Interpolants [110081#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 110080#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 110083#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 110082#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 110085#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 110084#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 110087#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 110086#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 110089#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 20)), 110088#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 19)), 110091#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 22)), 110090#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 21)), 110092#(<= |foo_#in~size| 21), 110045#true, 110047#(<= 0 main_~i~1), 110046#false, 110049#(<= 2 main_~i~1), 110048#(<= 1 main_~i~1), 110051#(<= 4 main_~i~1), 110050#(<= 3 main_~i~1), 110053#(<= 6 main_~i~1), 110052#(<= 5 main_~i~1), 110055#(<= 8 main_~i~1), 110054#(<= 7 main_~i~1), 110057#(<= 10 main_~i~1), 110056#(<= 9 main_~i~1), 110059#(<= 12 main_~i~1), 110058#(<= 11 main_~i~1), 110061#(<= 14 main_~i~1), 110060#(<= 13 main_~i~1), 110063#(<= 16 main_~i~1), 110062#(<= 15 main_~i~1), 110065#(<= 18 main_~i~1), 110064#(<= 17 main_~i~1), 110067#(<= 20 main_~i~1), 110066#(<= 19 main_~i~1), 110069#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 110068#(<= 21 main_~i~1), 110071#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 110070#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 110073#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 110072#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 110075#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 110074#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 110077#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 110076#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 110079#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 110078#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9))] [2018-02-04 02:54:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 280621 backedges. 75983 proven. 1430 refuted. 0 times theorem prover too weak. 203208 trivial. 0 not checked. [2018-02-04 02:54:18,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 02:54:18,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 02:54:18,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1679, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 02:54:18,530 INFO L87 Difference]: Start difference. First operand 2072 states and 2075 transitions. Second operand 48 states. [2018-02-04 02:54:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:19,149 INFO L93 Difference]: Finished difference Result 2081 states and 2082 transitions. [2018-02-04 02:54:19,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 02:54:19,150 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2062 [2018-02-04 02:54:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:19,154 INFO L225 Difference]: With dead ends: 2081 [2018-02-04 02:54:19,154 INFO L226 Difference]: Without dead ends: 2075 [2018-02-04 02:54:19,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1081, Invalid=3611, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 02:54:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2018-02-04 02:54:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2072. [2018-02-04 02:54:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-02-04 02:54:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2073 transitions. [2018-02-04 02:54:19,169 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2073 transitions. Word has length 2062 [2018-02-04 02:54:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:19,170 INFO L432 AbstractCegarLoop]: Abstraction has 2072 states and 2073 transitions. [2018-02-04 02:54:19,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 02:54:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2073 transitions. [2018-02-04 02:54:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2069 [2018-02-04 02:54:19,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:19,198 INFO L351 BasicCegarLoop]: trace histogram [321, 299, 298, 298, 298, 298, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:19,198 INFO L371 AbstractCegarLoop]: === Iteration 75 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:54:19,199 INFO L82 PathProgramCache]: Analyzing trace with hash -7420133, now seen corresponding path program 66 times [2018-02-04 02:54:19,199 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:19,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 282450 backedges. 39831 proven. 1587 refuted. 0 times theorem prover too weak. 241032 trivial. 0 not checked. [2018-02-04 02:54:24,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:24,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:54:24,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:54:24,247 INFO L182 omatonBuilderFactory]: Interpolants [114305#(<= foo_~i~0 15), 114304#(<= foo_~i~0 14), 114307#(<= foo_~i~0 17), 114306#(<= foo_~i~0 16), 114309#(<= foo_~i~0 19), 114308#(<= foo_~i~0 18), 114311#(<= foo_~i~0 21), 114310#(<= foo_~i~0 20), 114313#(and (<= 0 foo_~i~0) (<= foo_~i~0 22)), 114312#(<= foo_~i~0 22), 114314#(and (<= 1 foo_~i~0) (<= foo_~i~0 23)), 114289#false, 114288#true, 114291#(<= foo_~i~0 1), 114290#(= foo_~i~0 0), 114293#(<= foo_~i~0 3), 114292#(<= foo_~i~0 2), 114295#(<= foo_~i~0 5), 114294#(<= foo_~i~0 4), 114297#(<= foo_~i~0 7), 114296#(<= foo_~i~0 6), 114299#(<= foo_~i~0 9), 114298#(<= foo_~i~0 8), 114301#(<= foo_~i~0 11), 114300#(<= foo_~i~0 10), 114303#(<= foo_~i~0 13), 114302#(<= foo_~i~0 12)] [2018-02-04 02:54:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 282450 backedges. 39831 proven. 1587 refuted. 0 times theorem prover too weak. 241032 trivial. 0 not checked. [2018-02-04 02:54:24,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:54:24,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:54:24,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=396, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:54:24,250 INFO L87 Difference]: Start difference. First operand 2072 states and 2073 transitions. Second operand 27 states. [2018-02-04 02:54:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:24,562 INFO L93 Difference]: Finished difference Result 2084 states and 2086 transitions. [2018-02-04 02:54:24,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:54:24,563 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 2068 [2018-02-04 02:54:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:24,565 INFO L225 Difference]: With dead ends: 2084 [2018-02-04 02:54:24,565 INFO L226 Difference]: Without dead ends: 2084 [2018-02-04 02:54:24,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=878, Invalid=1474, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 02:54:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2018-02-04 02:54:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2078. [2018-02-04 02:54:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2018-02-04 02:54:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2080 transitions. [2018-02-04 02:54:24,574 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2080 transitions. Word has length 2068 [2018-02-04 02:54:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:24,574 INFO L432 AbstractCegarLoop]: Abstraction has 2078 states and 2080 transitions. [2018-02-04 02:54:24,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:54:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2080 transitions. [2018-02-04 02:54:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2075 [2018-02-04 02:54:24,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:24,591 INFO L351 BasicCegarLoop]: trace histogram [322, 300, 299, 299, 299, 299, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:24,591 INFO L371 AbstractCegarLoop]: === Iteration 76 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:54:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1999119699, now seen corresponding path program 67 times [2018-02-04 02:54:24,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:24,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 284285 backedges. 43204 proven. 1545 refuted. 0 times theorem prover too weak. 239536 trivial. 0 not checked. [2018-02-04 02:54:33,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:33,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 02:54:33,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:33,317 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:54:33,317 INFO L182 omatonBuilderFactory]: Interpolants [118529#(<= main_~i~1 6), 118528#(<= main_~i~1 5), 118531#(<= main_~i~1 8), 118530#(<= main_~i~1 7), 118533#(<= main_~i~1 10), 118532#(<= main_~i~1 9), 118535#(<= main_~i~1 12), 118534#(<= main_~i~1 11), 118537#(<= main_~i~1 14), 118536#(<= main_~i~1 13), 118539#(<= main_~i~1 16), 118538#(<= main_~i~1 15), 118541#(<= main_~i~1 18), 118540#(<= main_~i~1 17), 118543#(<= main_~i~1 20), 118542#(<= main_~i~1 19), 118545#(<= main_~i~1 22), 118544#(<= main_~i~1 21), 118547#(<= foo_~size 23), 118546#(<= |foo_#in~size| 23), 118549#(<= foo_~size (+ foo_~i~0 22)), 118548#(<= foo_~size (+ foo_~i~0 23)), 118551#(<= foo_~size (+ foo_~i~0 20)), 118550#(<= foo_~size (+ foo_~i~0 21)), 118553#(<= foo_~size (+ foo_~i~0 18)), 118552#(<= foo_~size (+ foo_~i~0 19)), 118555#(<= foo_~size (+ foo_~i~0 16)), 118554#(<= foo_~size (+ foo_~i~0 17)), 118557#(<= foo_~size (+ foo_~i~0 14)), 118556#(<= foo_~size (+ foo_~i~0 15)), 118559#(<= foo_~size (+ foo_~i~0 12)), 118558#(<= foo_~size (+ foo_~i~0 13)), 118561#(<= foo_~size (+ foo_~i~0 10)), 118560#(<= foo_~size (+ foo_~i~0 11)), 118563#(<= foo_~size (+ foo_~i~0 8)), 118562#(<= foo_~size (+ foo_~i~0 9)), 118565#(<= foo_~size (+ foo_~i~0 6)), 118564#(<= foo_~size (+ foo_~i~0 7)), 118567#(<= foo_~size (+ foo_~i~0 4)), 118566#(<= foo_~size (+ foo_~i~0 5)), 118569#(<= foo_~size (+ foo_~i~0 2)), 118568#(<= foo_~size (+ foo_~i~0 3)), 118571#(<= foo_~size foo_~i~0), 118570#(<= foo_~size (+ foo_~i~0 1)), 118572#(<= (+ foo_~size 1) foo_~i~0), 118521#true, 118523#(= main_~i~1 0), 118522#false, 118525#(<= main_~i~1 2), 118524#(<= main_~i~1 1), 118527#(<= main_~i~1 4), 118526#(<= main_~i~1 3)] [2018-02-04 02:54:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 284285 backedges. 43204 proven. 1545 refuted. 0 times theorem prover too weak. 239536 trivial. 0 not checked. [2018-02-04 02:54:33,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 02:54:33,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 02:54:33,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=1998, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 02:54:33,321 INFO L87 Difference]: Start difference. First operand 2078 states and 2080 transitions. Second operand 52 states. [2018-02-04 02:54:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:34,179 INFO L93 Difference]: Finished difference Result 2236 states and 2239 transitions. [2018-02-04 02:54:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 02:54:34,179 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2074 [2018-02-04 02:54:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:34,182 INFO L225 Difference]: With dead ends: 2236 [2018-02-04 02:54:34,182 INFO L226 Difference]: Without dead ends: 2236 [2018-02-04 02:54:34,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1379, Invalid=4473, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 02:54:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2018-02-04 02:54:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2234. [2018-02-04 02:54:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2018-02-04 02:54:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2237 transitions. [2018-02-04 02:54:34,197 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2237 transitions. Word has length 2074 [2018-02-04 02:54:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:34,199 INFO L432 AbstractCegarLoop]: Abstraction has 2234 states and 2237 transitions. [2018-02-04 02:54:34,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 02:54:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2237 transitions. [2018-02-04 02:54:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2225 [2018-02-04 02:54:34,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:34,218 INFO L351 BasicCegarLoop]: trace histogram [346, 323, 322, 322, 322, 322, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:34,218 INFO L371 AbstractCegarLoop]: === Iteration 77 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:54:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash -811654342, now seen corresponding path program 68 times [2018-02-04 02:54:34,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:34,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 329061 backedges. 86211 proven. 1564 refuted. 0 times theorem prover too weak. 241286 trivial. 0 not checked. [2018-02-04 02:54:44,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:44,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 02:54:44,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:44,078 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:54:44,078 INFO L182 omatonBuilderFactory]: Interpolants [123137#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 19)), 123136#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 123139#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 21)), 123138#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 20)), 123141#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 23)), 123140#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 22)), 123142#(<= |foo_#in~size| 22), 123093#true, 123095#(<= 0 main_~i~1), 123094#false, 123097#(<= 2 main_~i~1), 123096#(<= 1 main_~i~1), 123099#(<= 4 main_~i~1), 123098#(<= 3 main_~i~1), 123101#(<= 6 main_~i~1), 123100#(<= 5 main_~i~1), 123103#(<= 8 main_~i~1), 123102#(<= 7 main_~i~1), 123105#(<= 10 main_~i~1), 123104#(<= 9 main_~i~1), 123107#(<= 12 main_~i~1), 123106#(<= 11 main_~i~1), 123109#(<= 14 main_~i~1), 123108#(<= 13 main_~i~1), 123111#(<= 16 main_~i~1), 123110#(<= 15 main_~i~1), 123113#(<= 18 main_~i~1), 123112#(<= 17 main_~i~1), 123115#(<= 20 main_~i~1), 123114#(<= 19 main_~i~1), 123117#(<= 22 main_~i~1), 123116#(<= 21 main_~i~1), 123119#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 123118#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 123121#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 123120#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 123123#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 123122#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 123125#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 123124#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 123127#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 123126#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 123129#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 123128#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 123131#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 123130#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 123133#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 123132#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 123135#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 123134#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16))] [2018-02-04 02:54:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 329061 backedges. 86211 proven. 1564 refuted. 0 times theorem prover too weak. 241286 trivial. 0 not checked. [2018-02-04 02:54:44,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 02:54:44,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 02:54:44,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=1824, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:54:44,083 INFO L87 Difference]: Start difference. First operand 2234 states and 2237 transitions. Second operand 50 states. [2018-02-04 02:54:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:44,605 INFO L93 Difference]: Finished difference Result 2243 states and 2244 transitions. [2018-02-04 02:54:44,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 02:54:44,605 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2224 [2018-02-04 02:54:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:44,608 INFO L225 Difference]: With dead ends: 2243 [2018-02-04 02:54:44,608 INFO L226 Difference]: Without dead ends: 2237 [2018-02-04 02:54:44,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1176, Invalid=3936, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 02:54:44,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2018-02-04 02:54:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2234. [2018-02-04 02:54:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2018-02-04 02:54:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2235 transitions. [2018-02-04 02:54:44,617 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2235 transitions. Word has length 2224 [2018-02-04 02:54:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:44,618 INFO L432 AbstractCegarLoop]: Abstraction has 2234 states and 2235 transitions. [2018-02-04 02:54:44,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 02:54:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2235 transitions. [2018-02-04 02:54:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2231 [2018-02-04 02:54:44,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:44,644 INFO L351 BasicCegarLoop]: trace histogram [347, 324, 323, 323, 323, 323, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:44,644 INFO L371 AbstractCegarLoop]: === Iteration 78 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:54:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash 155057522, now seen corresponding path program 69 times [2018-02-04 02:54:44,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:44,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:54:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 331042 backedges. 45103 proven. 1728 refuted. 0 times theorem prover too weak. 284211 trivial. 0 not checked. [2018-02-04 02:54:50,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:54:50,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 02:54:50,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:54:50,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:54:50,665 INFO L182 omatonBuilderFactory]: Interpolants [127681#(<= foo_~i~0 15), 127680#(<= foo_~i~0 14), 127683#(and (<= 0 foo_~i~0) (<= foo_~i~0 16)), 127682#(<= foo_~i~0 16), 127685#(and (<= foo_~i~0 18) (<= 2 foo_~i~0)), 127684#(and (<= 1 foo_~i~0) (<= foo_~i~0 17)), 127687#(and (<= 4 foo_~i~0) (<= foo_~i~0 20)), 127686#(and (<= foo_~i~0 19) (<= 3 foo_~i~0)), 127689#(and (<= 6 foo_~i~0) (<= foo_~i~0 22)), 127688#(and (<= foo_~i~0 21) (<= 5 foo_~i~0)), 127691#(and (<= foo_~i~0 24) (<= 8 foo_~i~0)), 127690#(and (<= 7 foo_~i~0) (<= foo_~i~0 23)), 127665#false, 127664#true, 127667#(<= foo_~i~0 1), 127666#(= foo_~i~0 0), 127669#(<= foo_~i~0 3), 127668#(<= foo_~i~0 2), 127671#(<= foo_~i~0 5), 127670#(<= foo_~i~0 4), 127673#(<= foo_~i~0 7), 127672#(<= foo_~i~0 6), 127675#(<= foo_~i~0 9), 127674#(<= foo_~i~0 8), 127677#(<= foo_~i~0 11), 127676#(<= foo_~i~0 10), 127679#(<= foo_~i~0 13), 127678#(<= foo_~i~0 12)] [2018-02-04 02:54:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 331042 backedges. 45103 proven. 1728 refuted. 0 times theorem prover too weak. 284211 trivial. 0 not checked. [2018-02-04 02:54:50,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:54:50,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:54:50,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:54:50,669 INFO L87 Difference]: Start difference. First operand 2234 states and 2235 transitions. Second operand 28 states. [2018-02-04 02:54:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:54:51,182 INFO L93 Difference]: Finished difference Result 2246 states and 2248 transitions. [2018-02-04 02:54:51,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 02:54:51,182 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 2230 [2018-02-04 02:54:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:54:51,185 INFO L225 Difference]: With dead ends: 2246 [2018-02-04 02:54:51,185 INFO L226 Difference]: Without dead ends: 2246 [2018-02-04 02:54:51,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=644, Invalid=1906, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 02:54:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2018-02-04 02:54:51,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2240. [2018-02-04 02:54:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2018-02-04 02:54:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2242 transitions. [2018-02-04 02:54:51,194 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2242 transitions. Word has length 2230 [2018-02-04 02:54:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:54:51,195 INFO L432 AbstractCegarLoop]: Abstraction has 2240 states and 2242 transitions. [2018-02-04 02:54:51,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:54:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2242 transitions. [2018-02-04 02:54:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2237 [2018-02-04 02:54:51,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:54:51,213 INFO L351 BasicCegarLoop]: trace histogram [348, 325, 324, 324, 324, 324, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:54:51,213 INFO L371 AbstractCegarLoop]: === Iteration 79 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:54:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash -866845078, now seen corresponding path program 70 times [2018-02-04 02:54:51,213 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:54:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:54:51,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:55:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 333029 backedges. 48767 proven. 1684 refuted. 0 times theorem prover too weak. 282578 trivial. 0 not checked. [2018-02-04 02:55:01,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:55:01,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 02:55:01,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:55:01,641 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:55:01,641 INFO L182 omatonBuilderFactory]: Interpolants [132226#(= main_~i~1 0), 132227#(<= main_~i~1 1), 132224#true, 132225#false, 132230#(<= main_~i~1 4), 132231#(<= main_~i~1 5), 132228#(<= main_~i~1 2), 132229#(<= main_~i~1 3), 132234#(<= main_~i~1 8), 132235#(<= main_~i~1 9), 132232#(<= main_~i~1 6), 132233#(<= main_~i~1 7), 132238#(<= main_~i~1 12), 132239#(<= main_~i~1 13), 132236#(<= main_~i~1 10), 132237#(<= main_~i~1 11), 132242#(<= main_~i~1 16), 132243#(<= main_~i~1 17), 132240#(<= main_~i~1 14), 132241#(<= main_~i~1 15), 132246#(<= main_~i~1 20), 132247#(<= main_~i~1 21), 132244#(<= main_~i~1 18), 132245#(<= main_~i~1 19), 132250#(<= |foo_#in~size| 24), 132251#(<= foo_~size 24), 132248#(<= main_~i~1 22), 132249#(<= main_~i~1 23), 132254#(<= foo_~size (+ foo_~i~0 22)), 132255#(<= foo_~size (+ foo_~i~0 21)), 132252#(<= foo_~size (+ foo_~i~0 24)), 132253#(<= foo_~size (+ foo_~i~0 23)), 132258#(<= foo_~size (+ foo_~i~0 18)), 132259#(<= foo_~size (+ foo_~i~0 17)), 132256#(<= foo_~size (+ foo_~i~0 20)), 132257#(<= foo_~size (+ foo_~i~0 19)), 132262#(<= foo_~size (+ foo_~i~0 14)), 132263#(<= foo_~size (+ foo_~i~0 13)), 132260#(<= foo_~size (+ foo_~i~0 16)), 132261#(<= foo_~size (+ foo_~i~0 15)), 132266#(<= foo_~size (+ foo_~i~0 10)), 132267#(<= foo_~size (+ foo_~i~0 9)), 132264#(<= foo_~size (+ foo_~i~0 12)), 132265#(<= foo_~size (+ foo_~i~0 11)), 132270#(<= foo_~size (+ foo_~i~0 6)), 132271#(<= foo_~size (+ foo_~i~0 5)), 132268#(<= foo_~size (+ foo_~i~0 8)), 132269#(<= foo_~size (+ foo_~i~0 7)), 132274#(<= foo_~size (+ foo_~i~0 2)), 132275#(<= foo_~size (+ foo_~i~0 1)), 132272#(<= foo_~size (+ foo_~i~0 4)), 132273#(<= foo_~size (+ foo_~i~0 3)), 132276#(<= foo_~size foo_~i~0), 132277#(<= (+ foo_~size 1) foo_~i~0)] [2018-02-04 02:55:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 333029 backedges. 48767 proven. 1684 refuted. 0 times theorem prover too weak. 282578 trivial. 0 not checked. [2018-02-04 02:55:01,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 02:55:01,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 02:55:01,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=2156, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 02:55:01,645 INFO L87 Difference]: Start difference. First operand 2240 states and 2242 transitions. Second operand 54 states. [2018-02-04 02:55:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:55:02,901 INFO L93 Difference]: Finished difference Result 2404 states and 2407 transitions. [2018-02-04 02:55:02,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 02:55:02,902 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2236 [2018-02-04 02:55:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:55:02,905 INFO L225 Difference]: With dead ends: 2404 [2018-02-04 02:55:02,905 INFO L226 Difference]: Without dead ends: 2404 [2018-02-04 02:55:02,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1486, Invalid=4834, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 02:55:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2018-02-04 02:55:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2402. [2018-02-04 02:55:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2402 states. [2018-02-04 02:55:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 2405 transitions. [2018-02-04 02:55:02,919 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 2405 transitions. Word has length 2236 [2018-02-04 02:55:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:55:02,919 INFO L432 AbstractCegarLoop]: Abstraction has 2402 states and 2405 transitions. [2018-02-04 02:55:02,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 02:55:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 2405 transitions. [2018-02-04 02:55:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2393 [2018-02-04 02:55:02,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:55:02,942 INFO L351 BasicCegarLoop]: trace histogram [373, 349, 348, 348, 348, 348, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:55:02,942 INFO L371 AbstractCegarLoop]: === Iteration 80 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:55:02,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1913593545, now seen corresponding path program 71 times [2018-02-04 02:55:02,942 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:55:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:55:03,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 02:55:13,058 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 02:55:13,094 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 02:55:13,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:55:13 BoogieIcfgContainer [2018-02-04 02:55:13,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:55:13,095 INFO L168 Benchmark]: Toolchain (without parser) took 187177.92 ms. Allocated memory was 401.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 359.0 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 817.4 MB. Max. memory is 5.3 GB. [2018-02-04 02:55:13,096 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 401.1 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:55:13,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.74 ms. Allocated memory is still 401.1 MB. Free memory was 359.0 MB in the beginning and 351.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 02:55:13,097 INFO L168 Benchmark]: Boogie Preprocessor took 20.59 ms. Allocated memory is still 401.1 MB. Free memory was 351.0 MB in the beginning and 348.3 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:55:13,097 INFO L168 Benchmark]: RCFGBuilder took 158.17 ms. Allocated memory is still 401.1 MB. Free memory was 348.3 MB in the beginning and 332.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. [2018-02-04 02:55:13,097 INFO L168 Benchmark]: TraceAbstraction took 186850.28 ms. Allocated memory was 401.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 331.0 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 789.4 MB. Max. memory is 5.3 GB. [2018-02-04 02:55:13,098 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.19 ms. Allocated memory is still 401.1 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.74 ms. Allocated memory is still 401.1 MB. Free memory was 359.0 MB in the beginning and 351.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.59 ms. Allocated memory is still 401.1 MB. Free memory was 351.0 MB in the beginning and 348.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 158.17 ms. Allocated memory is still 401.1 MB. Free memory was 348.3 MB in the beginning and 332.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 186850.28 ms. Allocated memory was 401.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 331.0 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 789.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 2393 with TraceHistMax 373, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 45 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 2393 with TraceHistMax 373, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 2393 with TraceHistMax 373, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 45 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 2393 with TraceHistMax 373, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 45 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 2393 with TraceHistMax 373, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 45 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 2393 with TraceHistMax 373, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 186.8s OverallTime, 80 OverallIterations, 373 TraceHistogramMax, 27.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2408 SDtfs, 10718 SDslu, 19952 SDs, 0 SdLazy, 57895 SolverSat, 1426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2689 GetRequests, 130 SyntacticMatches, 6 SemanticMatches, 2553 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22494 ImplicationChecksByTransitivity, 19.1s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2402occurred in iteration=79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 5557036/5601303 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 79 MinimizatonAttempts, 482 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 122.5s InterpolantComputationTime, 63056 NumberOfCodeBlocks, 63056 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 62977 ConstructedInterpolants, 0 QuantifiedInterpolants, 125047211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 79 InterpolantComputations, 6 PerfectInterpolantSequences, 5557036/5601303 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/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-55-13-106.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-55-13-106.csv Completed graceful shutdown