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/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:56:43,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:56:43,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:56:43,868 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:56:43,868 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:56:43,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:56:43,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:56:43,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:56:43,872 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:56:43,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:56:43,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:56:43,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:56:43,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:56:43,875 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:56:43,876 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:56:43,877 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:56:43,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:56:43,881 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:56:43,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:56:43,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:56:43,884 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:56:43,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:56:43,885 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:56:43,885 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:56:43,886 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:56:43,887 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:56:43,887 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:56:43,888 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:56:43,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:56:43,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:56:43,889 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:56:43,889 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:56:43,898 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:56:43,899 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:56:43,900 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:56:43,900 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:56:43,900 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:56:43,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:56:43,900 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:56:43,900 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:56:43,901 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:56:43,901 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:56:43,901 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:56:43,901 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:56:43,901 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:56:43,901 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:56:43,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:56:43,902 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:56:43,902 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:56:43,902 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:56:43,902 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:56:43,902 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:56:43,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:56:43,903 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:56:43,903 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:56:43,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:56:43,941 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:56:43,944 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:56:43,945 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:56:43,945 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:56:43,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-02-04 02:56:44,064 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:56:44,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:56:44,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:56:44,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:56:44,072 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:56:44,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:56:44" (1/1) ... [2018-02-04 02:56:44,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5899baa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44, skipping insertion in model container [2018-02-04 02:56:44,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:56:44" (1/1) ... [2018-02-04 02:56:44,088 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:56:44,102 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:56:44,185 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:56:44,196 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:56:44,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44 WrapperNode [2018-02-04 02:56:44,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:56:44,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:56:44,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:56:44,201 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:56:44,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44" (1/1) ... [2018-02-04 02:56:44,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44" (1/1) ... [2018-02-04 02:56:44,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44" (1/1) ... [2018-02-04 02:56:44,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44" (1/1) ... [2018-02-04 02:56:44,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44" (1/1) ... [2018-02-04 02:56:44,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44" (1/1) ... [2018-02-04 02:56:44,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44" (1/1) ... [2018-02-04 02:56:44,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:56:44,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:56:44,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:56:44,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:56:44,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44" (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:56:44,263 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:56:44,263 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:56:44,263 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 02:56:44,263 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:56:44,264 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:56:44,264 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:56:44,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:56:44,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:56:44,264 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:56:44,264 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 02:56:44,264 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:56:44,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:56:44,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:56:44,390 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:56:44,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:56:44 BoogieIcfgContainer [2018-02-04 02:56:44,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:56:44,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:56:44,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:56:44,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:56:44,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:56:44" (1/3) ... [2018-02-04 02:56:44,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4381504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:56:44, skipping insertion in model container [2018-02-04 02:56:44,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:56:44" (2/3) ... [2018-02-04 02:56:44,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4381504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:56:44, skipping insertion in model container [2018-02-04 02:56:44,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:56:44" (3/3) ... [2018-02-04 02:56:44,396 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-02-04 02:56:44,403 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:56:44,407 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 02:56:44,443 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:56:44,444 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:56:44,444 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:56:44,444 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:56:44,444 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:56:44,444 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:56:44,444 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:56:44,444 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:56:44,444 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:56:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 02:56:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 02:56:44,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:44,460 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:44,460 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 02:56:44,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:44,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:44,579 INFO L134 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:56:44,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:56:44,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:56:44,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:44,582 INFO L134 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:56:44,582 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-02-04 02:56:44,582 INFO L134 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:56:44,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:56:44,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:56:44,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:56:44,592 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 02:56:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:44,642 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 02:56:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:56:44,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 02:56:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:44,651 INFO L225 Difference]: With dead ends: 63 [2018-02-04 02:56:44,651 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 02:56:44,652 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:56:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 02:56:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 02:56:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 02:56:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 02:56:44,731 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 02:56:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:44,731 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 02:56:44,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:56:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 02:56:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:56:44,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:44,732 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:56:44,732 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 02:56:44,733 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:44,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:44,822 INFO L134 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:56:44,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:56:44,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:56:44,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:44,823 INFO L134 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:56:44,824 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= 0 main_~i~1), 167#(= 0 |foo_#in~size|), 168#(and (= foo_~size 0) (= foo_~i~0 0))] [2018-02-04 02:56:44,824 INFO L134 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:56:44,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:56:44,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:56:44,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:56:44,827 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-02-04 02:56:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:44,926 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-02-04 02:56:44,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:56:44,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 02:56:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:44,927 INFO L225 Difference]: With dead ends: 65 [2018-02-04 02:56:44,927 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 02:56:44,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 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:56:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 02:56:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-02-04 02:56:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 02:56:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-04 02:56:44,934 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-02-04 02:56:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:44,934 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-04 02:56:44,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:56:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-04 02:56:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 02:56:44,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:44,935 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:56:44,936 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:44,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-04 02:56:44,937 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:44,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:44,987 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:56:44,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:56:44,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:56:44,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:44,988 INFO L134 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:56:44,988 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(<= 0 main_~i~1), 295#(<= 1 main_~i~1), 296#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-02-04 02:56:44,990 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:56:44,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:56:44,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:56:44,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:56:44,991 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-02-04 02:56:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:45,040 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-02-04 02:56:45,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:56:45,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 02:56:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:45,041 INFO L225 Difference]: With dead ends: 65 [2018-02-04 02:56:45,041 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 02:56:45,042 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:56:45,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 02:56:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-02-04 02:56:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 02:56:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-02-04 02:56:45,047 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 23 [2018-02-04 02:56:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:45,047 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-02-04 02:56:45,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:56:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-02-04 02:56:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 02:56:45,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:45,048 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:45,048 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash 621927392, now seen corresponding path program 1 times [2018-02-04 02:56:45,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:45,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:56:45,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:56:45,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:56:45,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:45,087 INFO L134 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:56:45,087 INFO L182 omatonBuilderFactory]: Interpolants [416#false, 417#(= foo_~i~0 0), 415#true] [2018-02-04 02:56:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:56:45,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:56:45,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:56:45,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:56:45,088 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-02-04 02:56:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:45,119 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-02-04 02:56:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:56:45,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-04 02:56:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:45,123 INFO L225 Difference]: With dead ends: 64 [2018-02-04 02:56:45,123 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 02:56:45,124 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:56:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 02:56:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-02-04 02:56:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 02:56:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-04 02:56:45,128 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-02-04 02:56:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:45,129 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-04 02:56:45,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:56:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-04 02:56:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 02:56:45,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:45,130 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:45,130 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880015, now seen corresponding path program 1 times [2018-02-04 02:56:45,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:45,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:56:45,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:45,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:56:45,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:45,249 INFO L134 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:56:45,249 INFO L182 omatonBuilderFactory]: Interpolants [544#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 31)), 538#true, 539#false, 540#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 541#(and (= 32 (select |#length| main_~c~0.base)) (= 0 main_~c~0.offset)), 542#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 543#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0))] [2018-02-04 02:56:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:56:45,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:56:45,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:56:45,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:56:45,250 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 7 states. [2018-02-04 02:56:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:45,317 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-02-04 02:56:45,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:56:45,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 02:56:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:45,319 INFO L225 Difference]: With dead ends: 58 [2018-02-04 02:56:45,319 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 02:56:45,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:56:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 02:56:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-02-04 02:56:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 02:56:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-04 02:56:45,324 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 29 [2018-02-04 02:56:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:45,324 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-04 02:56:45,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:56:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-04 02:56:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 02:56:45,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:45,325 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:45,325 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880014, now seen corresponding path program 1 times [2018-02-04 02:56:45,326 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:45,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:56:45,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:45,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 02:56:45,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:45,372 INFO L134 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:56:45,372 INFO L182 omatonBuilderFactory]: Interpolants [666#true, 667#false, 668#(= 1 (select |#valid| |main_~#mask~0.base|)), 669#(= 1 (select |#valid| main_~c~0.base)), 670#(= 1 (select |#valid| |foo_#in~b.base|)), 671#(= 1 (select |#valid| foo_~b.base))] [2018-02-04 02:56:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:56:45,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:56:45,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:56:45,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:56:45,373 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-02-04 02:56:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:45,414 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 02:56:45,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:56:45,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-04 02:56:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:45,415 INFO L225 Difference]: With dead ends: 54 [2018-02-04 02:56:45,415 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 02:56:45,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:56:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 02:56:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 02:56:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 02:56:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-04 02:56:45,419 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 29 [2018-02-04 02:56:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:45,420 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-04 02:56:45,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:56:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-04 02:56:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:56:45,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:45,421 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:56:45,421 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-04 02:56:45,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:45,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:45,481 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:56:45,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:45,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:56:45,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:45,481 INFO L134 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:56:45,481 INFO L182 omatonBuilderFactory]: Interpolants [785#true, 786#false, 787#(= main_~i~1 0), 788#(= foo_~i~0 0), 789#(= |foo_#res| 0), 790#(and (= |main_#t~ret3| 0) (= main_~i~1 0)), 791#(= (select main_~b~0 0) 0), 792#(= main_~i~1 (select main_~b~0 main_~i~1))] [2018-02-04 02:56:45,482 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:56:45,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:56:45,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:56:45,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:56:45,482 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 8 states. [2018-02-04 02:56:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:45,572 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 02:56:45,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:56:45,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 02:56:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:45,573 INFO L225 Difference]: With dead ends: 80 [2018-02-04 02:56:45,573 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 02:56:45,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:56:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 02:56:45,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-02-04 02:56:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 02:56:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 02:56:45,577 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 31 [2018-02-04 02:56:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:45,577 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 02:56:45,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:56:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 02:56:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 02:56:45,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:45,577 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:45,578 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:45,578 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-02-04 02:56:45,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:45,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:56:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:56:45,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:45,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:56:45,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:45,621 INFO L134 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:56:45,621 INFO L182 omatonBuilderFactory]: Interpolants [944#(= main_~i~1 0), 945#(<= main_~i~1 1), 946#(<= |foo_#in~size| 1), 947#(<= foo_~size 1), 948#(<= foo_~size (+ foo_~i~0 1)), 949#(<= foo_~size foo_~i~0), 942#true, 943#false] [2018-02-04 02:56:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:56:45,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:56:45,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:56:45,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:56:45,622 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2018-02-04 02:56:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:45,735 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-02-04 02:56:45,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:56:45,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-04 02:56:45,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:45,736 INFO L225 Difference]: With dead ends: 92 [2018-02-04 02:56:45,736 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 02:56:45,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:56:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 02:56:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-02-04 02:56:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 02:56:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 02:56:45,741 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 34 [2018-02-04 02:56:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:45,741 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 02:56:45,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:56:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 02:56:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 02:56:45,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:45,742 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:45,742 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:45,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2137316393, now seen corresponding path program 2 times [2018-02-04 02:56:45,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:45,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 02:56:45,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:45,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 02:56:45,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:45,787 INFO L134 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:56:45,787 INFO L182 omatonBuilderFactory]: Interpolants [1125#true, 1126#false, 1127#(= main_~i~1 0), 1128#(<= main_~i~1 1), 1129#(<= main_~i~1 2)] [2018-02-04 02:56:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 02:56:45,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:56:45,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:56:45,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:56:45,788 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 5 states. [2018-02-04 02:56:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:45,830 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-02-04 02:56:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:56:45,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-04 02:56:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:45,831 INFO L225 Difference]: With dead ends: 108 [2018-02-04 02:56:45,831 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 02:56:45,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:56:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 02:56:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2018-02-04 02:56:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 02:56:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-02-04 02:56:45,836 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 43 [2018-02-04 02:56:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:45,837 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-02-04 02:56:45,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:56:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-02-04 02:56:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 02:56:45,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:45,838 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:45,838 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash 763161719, now seen corresponding path program 2 times [2018-02-04 02:56:45,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:45,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 02:56:45,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:56:45,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:56:45,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:45,897 INFO L134 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:56:45,898 INFO L182 omatonBuilderFactory]: Interpolants [1328#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 1329#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~i~0)), 1330#(<= |foo_#in~size| 0), 1324#true, 1325#false, 1326#(<= 0 main_~i~1), 1327#(<= 1 main_~i~1)] [2018-02-04 02:56:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 02:56:45,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:56:45,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:56:45,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:56:45,899 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 7 states. [2018-02-04 02:56:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:45,999 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-02-04 02:56:45,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:56:45,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-02-04 02:56:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:46,000 INFO L225 Difference]: With dead ends: 100 [2018-02-04 02:56:46,000 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 02:56:46,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:56:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 02:56:46,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-02-04 02:56:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 02:56:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-02-04 02:56:46,004 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 46 [2018-02-04 02:56:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:46,004 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-02-04 02:56:46,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:56:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-02-04 02:56:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 02:56:46,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:46,005 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:46,005 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:46,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1798255855, now seen corresponding path program 3 times [2018-02-04 02:56:46,006 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:46,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-04 02:56:46,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:46,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:56:46,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:56:46,086 INFO L182 omatonBuilderFactory]: Interpolants [1520#false, 1521#(<= main_~i~1 31), 1522#(<= |foo_#in~size| 31), 1523#(<= foo_~size 31), 1524#(and (<= 0 foo_~i~0) (<= foo_~size 31)), 1525#(and (<= 1 foo_~i~0) (<= foo_~size 31)), 1526#(and (<= 1 foo_~i~0) (<= foo_~i~0 30)), 1519#true] [2018-02-04 02:56:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-04 02:56:46,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:56:46,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:56:46,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:56:46,087 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-02-04 02:56:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:46,164 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-04 02:56:46,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:56:46,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-02-04 02:56:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:46,166 INFO L225 Difference]: With dead ends: 90 [2018-02-04 02:56:46,166 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 02:56:46,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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:56:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 02:56:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-02-04 02:56:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 02:56:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-02-04 02:56:46,170 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 52 [2018-02-04 02:56:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:46,170 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-02-04 02:56:46,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:56:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-02-04 02:56:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:56:46,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:46,171 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:46,171 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1970492696, now seen corresponding path program 1 times [2018-02-04 02:56:46,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:46,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 02:56:46,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:46,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:56:46,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:46,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:56:46,224 INFO L182 omatonBuilderFactory]: Interpolants [1712#(<= main_~i~1 3), 1707#true, 1708#false, 1709#(= main_~i~1 0), 1710#(<= main_~i~1 1), 1711#(<= main_~i~1 2)] [2018-02-04 02:56:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 02:56:46,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:56:46,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:56:46,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:56:46,225 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-02-04 02:56:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:46,271 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-02-04 02:56:46,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:56:46,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-02-04 02:56:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:46,273 INFO L225 Difference]: With dead ends: 122 [2018-02-04 02:56:46,273 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 02:56:46,273 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:56:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 02:56:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2018-02-04 02:56:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 02:56:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-02-04 02:56:46,277 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 67 [2018-02-04 02:56:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:46,277 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-02-04 02:56:46,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:56:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2018-02-04 02:56:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 02:56:46,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:46,280 INFO L351 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:46,280 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:46,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1320798415, now seen corresponding path program 2 times [2018-02-04 02:56:46,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:46,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:56:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-02-04 02:56:46,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:46,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:56:46,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 02:56:46,343 INFO L182 omatonBuilderFactory]: Interpolants [1936#(<= main_~i~1 4), 1930#true, 1931#false, 1932#(= main_~i~1 0), 1933#(<= main_~i~1 1), 1934#(<= main_~i~1 2), 1935#(<= main_~i~1 3)] [2018-02-04 02:56:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-02-04 02:56:46,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:56:46,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:56:46,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:56:46,344 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 7 states. [2018-02-04 02:56:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:46,383 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-02-04 02:56:46,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:56:46,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-02-04 02:56:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:46,384 INFO L225 Difference]: With dead ends: 138 [2018-02-04 02:56:46,384 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 02:56:46,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:56:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 02:56:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2018-02-04 02:56:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 02:56:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2018-02-04 02:56:46,388 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 85 [2018-02-04 02:56:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:46,389 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2018-02-04 02:56:46,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:56:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2018-02-04 02:56:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 02:56:46,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:46,390 INFO L351 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:46,391 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:46,391 INFO L82 PathProgramCache]: Analyzing trace with hash -825580742, now seen corresponding path program 3 times [2018-02-04 02:56:46,392 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:46,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 02:56:46,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:46,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:56:46,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 02:56:46,514 INFO L182 omatonBuilderFactory]: Interpolants [2181#true, 2182#false, 2183#(= main_~i~1 0), 2184#(<= main_~i~1 1), 2185#(<= main_~i~1 2), 2186#(<= main_~i~1 3), 2187#(<= main_~i~1 4), 2188#(<= main_~i~1 5)] [2018-02-04 02:56:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 02:56:46,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:56:46,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:56:46,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:56:46,516 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 8 states. [2018-02-04 02:56:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:46,596 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-02-04 02:56:46,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:56:46,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2018-02-04 02:56:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:46,598 INFO L225 Difference]: With dead ends: 154 [2018-02-04 02:56:46,598 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 02:56:46,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:56:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 02:56:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2018-02-04 02:56:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 02:56:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-02-04 02:56:46,602 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 103 [2018-02-04 02:56:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:46,606 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-02-04 02:56:46,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:56:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-02-04 02:56:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 02:56:46,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:46,608 INFO L351 BasicCegarLoop]: trace histogram [11, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:46,608 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:46,608 INFO L82 PathProgramCache]: Analyzing trace with hash 797540099, now seen corresponding path program 4 times [2018-02-04 02:56:46,609 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:46,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-02-04 02:56:46,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:46,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:56:46,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 02:56:46,713 INFO L182 omatonBuilderFactory]: Interpolants [2464#(<= |foo_#in~size| 1), 2465#(<= main_~i~1 1), 2466#(<= main_~i~1 2), 2460#true, 2461#false, 2462#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 2463#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-04 02:56:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-02-04 02:56:46,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:56:46,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:56:46,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:56:46,714 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 7 states. [2018-02-04 02:56:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:46,824 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2018-02-04 02:56:46,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:56:46,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-02-04 02:56:46,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:46,826 INFO L225 Difference]: With dead ends: 168 [2018-02-04 02:56:46,827 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 02:56:46,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:56:46,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 02:56:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2018-02-04 02:56:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 02:56:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2018-02-04 02:56:46,833 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 121 [2018-02-04 02:56:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:46,834 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2018-02-04 02:56:46,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:56:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2018-02-04 02:56:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 02:56:46,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:46,835 INFO L351 BasicCegarLoop]: trace histogram [12, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:46,836 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:46,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1854228341, now seen corresponding path program 5 times [2018-02-04 02:56:46,837 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:46,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 94 proven. 55 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-02-04 02:56:46,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:46,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:56:46,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-02-04 02:56:46,923 INFO L182 omatonBuilderFactory]: Interpolants [2768#(<= 1 main_~i~1), 2769#(<= 2 main_~i~1), 2770#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 2771#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 2772#(<= |foo_#in~size| 1), 2765#true, 2766#false, 2767#(<= 0 main_~i~1)] [2018-02-04 02:56:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 94 proven. 55 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-02-04 02:56:46,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:56:46,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:56:46,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:56:46,924 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand 8 states. [2018-02-04 02:56:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:47,031 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-02-04 02:56:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:56:47,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-02-04 02:56:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:47,033 INFO L225 Difference]: With dead ends: 140 [2018-02-04 02:56:47,033 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 02:56:47,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:56:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 02:56:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2018-02-04 02:56:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 02:56:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-02-04 02:56:47,037 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 127 [2018-02-04 02:56:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:47,038 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-02-04 02:56:47,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:56:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-02-04 02:56:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 02:56:47,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:47,040 INFO L351 BasicCegarLoop]: trace histogram [15, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:47,040 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1667069347, now seen corresponding path program 6 times [2018-02-04 02:56:47,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:47,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-02-04 02:56:47,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:47,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:56:47,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-02-04 02:56:47,156 INFO L182 omatonBuilderFactory]: Interpolants [3040#true, 3041#false, 3042#(= main_~i~1 0), 3043#(<= main_~i~1 1), 3044#(<= main_~i~1 2), 3045#(<= main_~i~1 3), 3046#(<= main_~i~1 4), 3047#(<= main_~i~1 5), 3048#(<= main_~i~1 6)] [2018-02-04 02:56:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-02-04 02:56:47,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:56:47,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:56:47,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:56:47,157 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 9 states. [2018-02-04 02:56:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:47,243 INFO L93 Difference]: Finished difference Result 176 states and 184 transitions. [2018-02-04 02:56:47,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:56:47,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 145 [2018-02-04 02:56:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:47,245 INFO L225 Difference]: With dead ends: 176 [2018-02-04 02:56:47,245 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 02:56:47,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:56:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 02:56:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 134. [2018-02-04 02:56:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 02:56:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2018-02-04 02:56:47,249 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 145 [2018-02-04 02:56:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:47,249 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2018-02-04 02:56:47,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:56:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2018-02-04 02:56:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 02:56:47,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:47,251 INFO L351 BasicCegarLoop]: trace histogram [18, 11, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:47,251 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:47,251 INFO L82 PathProgramCache]: Analyzing trace with hash -418963468, now seen corresponding path program 7 times [2018-02-04 02:56:47,252 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:47,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 206 proven. 10 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-02-04 02:56:47,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:47,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:56:47,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-04 02:56:47,366 INFO L182 omatonBuilderFactory]: Interpolants [3360#false, 3361#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3362#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 3363#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 3364#(<= |foo_#in~size| 2), 3365#(<= main_~i~1 2), 3366#(<= main_~i~1 3), 3359#true] [2018-02-04 02:56:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 206 proven. 10 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-02-04 02:56:47,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:56:47,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:56:47,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:56:47,367 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand 8 states. [2018-02-04 02:56:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:47,486 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2018-02-04 02:56:47,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:56:47,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2018-02-04 02:56:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:47,488 INFO L225 Difference]: With dead ends: 193 [2018-02-04 02:56:47,488 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 02:56:47,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:56:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 02:56:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2018-02-04 02:56:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 02:56:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2018-02-04 02:56:47,495 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 169 [2018-02-04 02:56:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:47,495 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2018-02-04 02:56:47,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:56:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2018-02-04 02:56:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-02-04 02:56:47,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:47,498 INFO L351 BasicCegarLoop]: trace histogram [19, 12, 12, 12, 12, 12, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:47,498 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:47,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1459740484, now seen corresponding path program 8 times [2018-02-04 02:56:47,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:47,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2018-02-04 02:56:47,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:47,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:56:47,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-02-04 02:56:47,677 INFO L182 omatonBuilderFactory]: Interpolants [3712#(<= main_~i~1 1), 3713#(<= main_~i~1 2), 3714#(<= main_~i~1 3), 3715#(<= main_~i~1 4), 3716#(<= main_~i~1 5), 3717#(<= main_~i~1 6), 3718#(<= main_~i~1 7), 3709#true, 3710#false, 3711#(= main_~i~1 0)] [2018-02-04 02:56:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2018-02-04 02:56:47,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:56:47,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:56:47,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:56:47,678 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 10 states. [2018-02-04 02:56:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:47,757 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2018-02-04 02:56:47,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:56:47,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 175 [2018-02-04 02:56:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:47,759 INFO L225 Difference]: With dead ends: 211 [2018-02-04 02:56:47,759 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 02:56:47,759 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:56:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 02:56:47,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 154. [2018-02-04 02:56:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 02:56:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2018-02-04 02:56:47,762 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 175 [2018-02-04 02:56:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:47,763 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2018-02-04 02:56:47,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:56:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2018-02-04 02:56:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-02-04 02:56:47,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:47,764 INFO L351 BasicCegarLoop]: trace histogram [22, 14, 14, 14, 14, 14, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:47,764 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:47,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1367975757, now seen corresponding path program 9 times [2018-02-04 02:56:47,765 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:47,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:56:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 201 proven. 172 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2018-02-04 02:56:47,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:47,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:56:47,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-04 02:56:47,890 INFO L182 omatonBuilderFactory]: Interpolants [4084#true, 4085#false, 4086#(<= 0 main_~i~1), 4087#(<= 1 main_~i~1), 4088#(<= 2 main_~i~1), 4089#(<= 3 main_~i~1), 4090#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 4091#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 4092#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 4093#(<= |foo_#in~size| 2)] [2018-02-04 02:56:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 201 proven. 172 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2018-02-04 02:56:47,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:56:47,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:56:47,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:56:47,891 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 10 states. [2018-02-04 02:56:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:48,070 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2018-02-04 02:56:48,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:56:48,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-02-04 02:56:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:48,072 INFO L225 Difference]: With dead ends: 173 [2018-02-04 02:56:48,072 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 02:56:48,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:56:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 02:56:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2018-02-04 02:56:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 02:56:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2018-02-04 02:56:48,077 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 199 [2018-02-04 02:56:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:48,077 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2018-02-04 02:56:48,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:56:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2018-02-04 02:56:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-02-04 02:56:48,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:48,081 INFO L351 BasicCegarLoop]: trace histogram [26, 18, 18, 18, 18, 18, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:48,081 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash 354968301, now seen corresponding path program 10 times [2018-02-04 02:56:48,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:48,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:56:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-02-04 02:56:48,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:48,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:56:48,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-02-04 02:56:48,279 INFO L182 omatonBuilderFactory]: Interpolants [4432#(<= main_~i~1 3), 4433#(<= main_~i~1 4), 4434#(<= main_~i~1 5), 4435#(<= main_~i~1 6), 4436#(<= main_~i~1 7), 4437#(<= main_~i~1 8), 4427#true, 4428#false, 4429#(= main_~i~1 0), 4430#(<= main_~i~1 1), 4431#(<= main_~i~1 2)] [2018-02-04 02:56:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-02-04 02:56:48,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:56:48,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:56:48,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:56:48,281 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 11 states. [2018-02-04 02:56:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:48,392 INFO L93 Difference]: Finished difference Result 217 states and 228 transitions. [2018-02-04 02:56:48,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:56:48,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 223 [2018-02-04 02:56:48,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:48,394 INFO L225 Difference]: With dead ends: 217 [2018-02-04 02:56:48,394 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 02:56:48,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:56:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 02:56:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 165. [2018-02-04 02:56:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 02:56:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 183 transitions. [2018-02-04 02:56:48,398 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 183 transitions. Word has length 223 [2018-02-04 02:56:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:48,398 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 183 transitions. [2018-02-04 02:56:48,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:56:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2018-02-04 02:56:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-04 02:56:48,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:48,400 INFO L351 BasicCegarLoop]: trace histogram [30, 21, 21, 21, 21, 21, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:48,400 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:48,400 INFO L82 PathProgramCache]: Analyzing trace with hash 704000134, now seen corresponding path program 11 times [2018-02-04 02:56:48,401 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:48,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 482 proven. 24 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-02-04 02:56:48,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:48,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:56:48,578 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-04 02:56:48,579 INFO L182 omatonBuilderFactory]: Interpolants [4820#true, 4821#false, 4822#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 4823#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 4824#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 4825#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 4826#(<= |foo_#in~size| 3), 4827#(<= main_~i~1 3), 4828#(<= main_~i~1 4)] [2018-02-04 02:56:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 482 proven. 24 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-02-04 02:56:48,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:56:48,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:56:48,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:56:48,580 INFO L87 Difference]: Start difference. First operand 165 states and 183 transitions. Second operand 9 states. [2018-02-04 02:56:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:48,709 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2018-02-04 02:56:48,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:56:48,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 253 [2018-02-04 02:56:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:48,712 INFO L225 Difference]: With dead ends: 240 [2018-02-04 02:56:48,713 INFO L226 Difference]: Without dead ends: 240 [2018-02-04 02:56:48,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:56:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-04 02:56:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 174. [2018-02-04 02:56:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 02:56:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 199 transitions. [2018-02-04 02:56:48,718 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 199 transitions. Word has length 253 [2018-02-04 02:56:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:48,719 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 199 transitions. [2018-02-04 02:56:48,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:56:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 199 transitions. [2018-02-04 02:56:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-02-04 02:56:48,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:48,721 INFO L351 BasicCegarLoop]: trace histogram [31, 22, 22, 22, 22, 22, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:48,721 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1269758926, now seen corresponding path program 12 times [2018-02-04 02:56:48,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:48,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 606 proven. 44 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-02-04 02:56:48,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:48,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:56:48,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-04 02:56:48,902 INFO L182 omatonBuilderFactory]: Interpolants [5251#true, 5252#false, 5253#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 5254#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 5255#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 5256#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 5257#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 5258#(<= |foo_#in~size| 4), 5259#(<= main_~i~1 4), 5260#(<= main_~i~1 5)] [2018-02-04 02:56:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 606 proven. 44 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-02-04 02:56:48,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:56:48,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:56:48,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:56:48,903 INFO L87 Difference]: Start difference. First operand 174 states and 199 transitions. Second operand 10 states. [2018-02-04 02:56:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:49,056 INFO L93 Difference]: Finished difference Result 249 states and 297 transitions. [2018-02-04 02:56:49,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:56:49,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-02-04 02:56:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:49,059 INFO L225 Difference]: With dead ends: 249 [2018-02-04 02:56:49,059 INFO L226 Difference]: Without dead ends: 249 [2018-02-04 02:56:49,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:56:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-04 02:56:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 180. [2018-02-04 02:56:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 02:56:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2018-02-04 02:56:49,066 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 259 [2018-02-04 02:56:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:49,066 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2018-02-04 02:56:49,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:56:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2018-02-04 02:56:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-02-04 02:56:49,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:49,068 INFO L351 BasicCegarLoop]: trace histogram [32, 23, 23, 23, 23, 23, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:49,069 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1255919338, now seen corresponding path program 13 times [2018-02-04 02:56:49,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:49,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2018-02-04 02:56:49,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:49,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:56:49,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-02-04 02:56:49,293 INFO L182 omatonBuilderFactory]: Interpolants [5700#true, 5701#false, 5702#(= main_~i~1 0), 5703#(<= main_~i~1 1), 5704#(<= main_~i~1 2), 5705#(<= main_~i~1 3), 5706#(<= main_~i~1 4), 5707#(<= main_~i~1 5), 5708#(<= main_~i~1 6), 5709#(<= main_~i~1 7), 5710#(<= main_~i~1 8), 5711#(<= main_~i~1 9)] [2018-02-04 02:56:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2018-02-04 02:56:49,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:56:49,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:56:49,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:56:49,294 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand 12 states. [2018-02-04 02:56:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:49,417 INFO L93 Difference]: Finished difference Result 258 states and 280 transitions. [2018-02-04 02:56:49,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:56:49,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 265 [2018-02-04 02:56:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:49,419 INFO L225 Difference]: With dead ends: 258 [2018-02-04 02:56:49,419 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 02:56:49,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:56:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 02:56:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 191. [2018-02-04 02:56:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 02:56:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-02-04 02:56:49,423 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 265 [2018-02-04 02:56:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:49,423 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-02-04 02:56:49,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:56:49,423 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-02-04 02:56:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-02-04 02:56:49,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:49,425 INFO L351 BasicCegarLoop]: trace histogram [36, 26, 26, 26, 26, 26, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:49,425 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:49,425 INFO L82 PathProgramCache]: Analyzing trace with hash -478351505, now seen corresponding path program 14 times [2018-02-04 02:56:49,426 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:49,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 534 proven. 139 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-02-04 02:56:49,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:49,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:56:49,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 129 proven. 20 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-02-04 02:56:49,581 INFO L182 omatonBuilderFactory]: Interpolants [6161#true, 6162#false, 6163#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 6164#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 6165#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 6166#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 6167#(<= |foo_#in~size| 3), 6168#(<= main_~i~1 3), 6169#(<= main_~i~1 4), 6170#(<= main_~i~1 5)] [2018-02-04 02:56:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 534 proven. 139 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-02-04 02:56:49,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:56:49,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:56:49,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:56:49,582 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 10 states. [2018-02-04 02:56:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:49,724 INFO L93 Difference]: Finished difference Result 303 states and 375 transitions. [2018-02-04 02:56:49,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:56:49,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 295 [2018-02-04 02:56:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:49,727 INFO L225 Difference]: With dead ends: 303 [2018-02-04 02:56:49,727 INFO L226 Difference]: Without dead ends: 303 [2018-02-04 02:56:49,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:56:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-04 02:56:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 194. [2018-02-04 02:56:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 02:56:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-02-04 02:56:49,736 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 295 [2018-02-04 02:56:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:49,736 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-02-04 02:56:49,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:56:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-02-04 02:56:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-02-04 02:56:49,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:49,738 INFO L351 BasicCegarLoop]: trace histogram [37, 27, 27, 27, 27, 27, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:49,739 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:49,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1133567817, now seen corresponding path program 15 times [2018-02-04 02:56:49,740 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:49,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3206 backedges. 658 proven. 191 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-02-04 02:56:49,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:49,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:56:49,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 114 proven. 26 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-02-04 02:56:49,961 INFO L182 omatonBuilderFactory]: Interpolants [6676#true, 6677#false, 6678#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 6679#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 6680#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 6681#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 6682#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 6683#(<= |foo_#in~size| 4), 6684#(<= main_~i~1 4), 6685#(<= main_~i~1 5), 6686#(<= main_~i~1 6)] [2018-02-04 02:56:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3206 backedges. 658 proven. 191 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-02-04 02:56:49,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:56:49,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:56:49,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:56:49,963 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 11 states. [2018-02-04 02:56:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:50,133 INFO L93 Difference]: Finished difference Result 307 states and 379 transitions. [2018-02-04 02:56:50,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:56:50,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 301 [2018-02-04 02:56:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:50,136 INFO L225 Difference]: With dead ends: 307 [2018-02-04 02:56:50,136 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 02:56:50,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:56:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 02:56:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 191. [2018-02-04 02:56:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 02:56:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-02-04 02:56:50,145 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 301 [2018-02-04 02:56:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:50,145 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-02-04 02:56:50,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:56:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-02-04 02:56:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 02:56:50,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:50,148 INFO L351 BasicCegarLoop]: trace histogram [38, 28, 28, 28, 28, 28, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:50,148 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1980154881, now seen corresponding path program 16 times [2018-02-04 02:56:50,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:50,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3388 backedges. 909 proven. 70 refuted. 0 times theorem prover too weak. 2409 trivial. 0 not checked. [2018-02-04 02:56:50,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:50,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:56:50,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-02-04 02:56:50,392 INFO L182 omatonBuilderFactory]: Interpolants [7200#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 7201#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 7202#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 7203#(<= |foo_#in~size| 5), 7204#(<= main_~i~1 5), 7205#(<= main_~i~1 6), 7195#true, 7196#false, 7197#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 7198#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 7199#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 02:56:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3388 backedges. 909 proven. 70 refuted. 0 times theorem prover too weak. 2409 trivial. 0 not checked. [2018-02-04 02:56:50,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:56:50,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:56:50,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:56:50,394 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 11 states. [2018-02-04 02:56:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:50,553 INFO L93 Difference]: Finished difference Result 277 states and 347 transitions. [2018-02-04 02:56:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:56:50,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 307 [2018-02-04 02:56:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:50,556 INFO L225 Difference]: With dead ends: 277 [2018-02-04 02:56:50,556 INFO L226 Difference]: Without dead ends: 277 [2018-02-04 02:56:50,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:56:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-04 02:56:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 200. [2018-02-04 02:56:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 02:56:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 237 transitions. [2018-02-04 02:56:50,563 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 237 transitions. Word has length 307 [2018-02-04 02:56:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:50,564 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 237 transitions. [2018-02-04 02:56:50,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:56:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 237 transitions. [2018-02-04 02:56:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-02-04 02:56:50,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:50,566 INFO L351 BasicCegarLoop]: trace histogram [39, 29, 29, 29, 29, 29, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:50,566 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1120913543, now seen corresponding path program 17 times [2018-02-04 02:56:50,567 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:50,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 374 proven. 479 refuted. 0 times theorem prover too weak. 2723 trivial. 0 not checked. [2018-02-04 02:56:50,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:50,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:56:50,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 37 proven. 109 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-02-04 02:56:50,845 INFO L182 omatonBuilderFactory]: Interpolants [7696#false, 7697#(<= 0 main_~i~1), 7698#(<= 1 main_~i~1), 7699#(<= 2 main_~i~1), 7700#(<= 3 main_~i~1), 7701#(<= 4 main_~i~1), 7702#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 7703#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 7704#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 7705#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 7706#(<= |foo_#in~size| 3), 7695#true] [2018-02-04 02:56:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 374 proven. 479 refuted. 0 times theorem prover too weak. 2723 trivial. 0 not checked. [2018-02-04 02:56:50,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:56:50,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:56:50,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:56:50,847 INFO L87 Difference]: Start difference. First operand 200 states and 237 transitions. Second operand 12 states. [2018-02-04 02:56:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:51,081 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2018-02-04 02:56:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:56:51,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 313 [2018-02-04 02:56:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:51,082 INFO L225 Difference]: With dead ends: 223 [2018-02-04 02:56:51,082 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 02:56:51,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:56:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 02:56:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2018-02-04 02:56:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 02:56:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 241 transitions. [2018-02-04 02:56:51,087 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 241 transitions. Word has length 313 [2018-02-04 02:56:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:51,088 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 241 transitions. [2018-02-04 02:56:51,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:56:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 241 transitions. [2018-02-04 02:56:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-04 02:56:51,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:51,090 INFO L351 BasicCegarLoop]: trace histogram [43, 33, 33, 33, 33, 33, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:51,090 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1555650855, now seen corresponding path program 18 times [2018-02-04 02:56:51,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:51,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4388 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2018-02-04 02:56:51,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:51,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:56:51,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-02-04 02:56:51,343 INFO L182 omatonBuilderFactory]: Interpolants [8141#true, 8142#false, 8143#(= main_~i~1 0), 8144#(<= main_~i~1 1), 8145#(<= main_~i~1 2), 8146#(<= main_~i~1 3), 8147#(<= main_~i~1 4), 8148#(<= main_~i~1 5), 8149#(<= main_~i~1 6), 8150#(<= main_~i~1 7), 8151#(<= main_~i~1 8), 8152#(<= main_~i~1 9), 8153#(<= main_~i~1 10)] [2018-02-04 02:56:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4388 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2018-02-04 02:56:51,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:56:51,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:56:51,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:56:51,345 INFO L87 Difference]: Start difference. First operand 203 states and 241 transitions. Second operand 13 states. [2018-02-04 02:56:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:51,483 INFO L93 Difference]: Finished difference Result 306 states and 350 transitions. [2018-02-04 02:56:51,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:56:51,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 337 [2018-02-04 02:56:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:51,486 INFO L225 Difference]: With dead ends: 306 [2018-02-04 02:56:51,486 INFO L226 Difference]: Without dead ends: 306 [2018-02-04 02:56:51,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:56:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-04 02:56:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 214. [2018-02-04 02:56:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 02:56:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2018-02-04 02:56:51,493 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 337 [2018-02-04 02:56:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:51,494 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2018-02-04 02:56:51,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:56:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2018-02-04 02:56:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-02-04 02:56:51,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:51,497 INFO L351 BasicCegarLoop]: trace histogram [48, 37, 37, 37, 37, 37, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:51,497 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:51,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1011854648, now seen corresponding path program 19 times [2018-02-04 02:56:51,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:51,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5492 backedges. 814 proven. 370 refuted. 0 times theorem prover too weak. 4308 trivial. 0 not checked. [2018-02-04 02:56:51,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:51,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:56:51,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 150 proven. 52 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-02-04 02:56:51,811 INFO L182 omatonBuilderFactory]: Interpolants [8674#true, 8675#false, 8676#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 8677#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 8678#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 8679#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 8680#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 8681#(<= |foo_#in~size| 4), 8682#(<= main_~i~1 4), 8683#(<= main_~i~1 5), 8684#(<= main_~i~1 6), 8685#(<= main_~i~1 7)] [2018-02-04 02:56:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5492 backedges. 814 proven. 370 refuted. 0 times theorem prover too weak. 4308 trivial. 0 not checked. [2018-02-04 02:56:51,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:56:51,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:56:51,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:56:51,812 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand 12 states. [2018-02-04 02:56:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:52,019 INFO L93 Difference]: Finished difference Result 370 states and 469 transitions. [2018-02-04 02:56:52,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:56:52,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 373 [2018-02-04 02:56:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:52,023 INFO L225 Difference]: With dead ends: 370 [2018-02-04 02:56:52,023 INFO L226 Difference]: Without dead ends: 370 [2018-02-04 02:56:52,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:56:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-04 02:56:52,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 214. [2018-02-04 02:56:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 02:56:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2018-02-04 02:56:52,032 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 373 [2018-02-04 02:56:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:52,033 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2018-02-04 02:56:52,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:56:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2018-02-04 02:56:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-02-04 02:56:52,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:52,035 INFO L351 BasicCegarLoop]: trace histogram [49, 38, 38, 38, 38, 38, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:52,035 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:52,035 INFO L82 PathProgramCache]: Analyzing trace with hash -339687920, now seen corresponding path program 20 times [2018-02-04 02:56:52,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:52,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 1095 proven. 281 refuted. 0 times theorem prover too weak. 4360 trivial. 0 not checked. [2018-02-04 02:56:52,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:52,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:56:52,365 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 173 proven. 32 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-02-04 02:56:52,366 INFO L182 omatonBuilderFactory]: Interpolants [9280#true, 9281#false, 9282#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 9283#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 9284#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 9285#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 9286#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 9287#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 9288#(<= |foo_#in~size| 5), 9289#(<= main_~i~1 5), 9290#(<= main_~i~1 6), 9291#(<= main_~i~1 7)] [2018-02-04 02:56:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 1095 proven. 281 refuted. 0 times theorem prover too weak. 4360 trivial. 0 not checked. [2018-02-04 02:56:52,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:56:52,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:56:52,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:56:52,367 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand 12 states. [2018-02-04 02:56:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:52,568 INFO L93 Difference]: Finished difference Result 341 states and 426 transitions. [2018-02-04 02:56:52,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:56:52,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 379 [2018-02-04 02:56:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:52,571 INFO L225 Difference]: With dead ends: 341 [2018-02-04 02:56:52,571 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 02:56:52,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:56:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 02:56:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 214. [2018-02-04 02:56:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 02:56:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2018-02-04 02:56:52,583 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 379 [2018-02-04 02:56:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:52,583 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2018-02-04 02:56:52,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:56:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2018-02-04 02:56:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-02-04 02:56:52,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:52,586 INFO L351 BasicCegarLoop]: trace histogram [50, 39, 39, 39, 39, 39, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:52,586 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:52,586 INFO L82 PathProgramCache]: Analyzing trace with hash 77081240, now seen corresponding path program 21 times [2018-02-04 02:56:52,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:52,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5986 backedges. 1466 proven. 102 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-02-04 02:56:52,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:52,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:56:52,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-02-04 02:56:52,901 INFO L182 omatonBuilderFactory]: Interpolants [9859#true, 9860#false, 9861#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 9862#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 9863#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 9864#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 9865#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 9866#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 9867#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 9868#(<= |foo_#in~size| 6), 9869#(<= main_~i~1 6), 9870#(<= main_~i~1 7)] [2018-02-04 02:56:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5986 backedges. 1466 proven. 102 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-02-04 02:56:52,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:56:52,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:56:52,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:56:52,902 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand 12 states. [2018-02-04 02:56:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:53,044 INFO L93 Difference]: Finished difference Result 305 states and 387 transitions. [2018-02-04 02:56:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:56:53,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 385 [2018-02-04 02:56:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:53,046 INFO L225 Difference]: With dead ends: 305 [2018-02-04 02:56:53,046 INFO L226 Difference]: Without dead ends: 305 [2018-02-04 02:56:53,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:56:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-04 02:56:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 223. [2018-02-04 02:56:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 02:56:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 274 transitions. [2018-02-04 02:56:53,054 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 274 transitions. Word has length 385 [2018-02-04 02:56:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:53,055 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 274 transitions. [2018-02-04 02:56:53,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:56:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 274 transitions. [2018-02-04 02:56:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-02-04 02:56:53,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:53,058 INFO L351 BasicCegarLoop]: trace histogram [51, 40, 40, 40, 40, 40, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:53,058 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:53,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2006818912, now seen corresponding path program 22 times [2018-02-04 02:56:53,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:53,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6242 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 5890 trivial. 0 not checked. [2018-02-04 02:56:53,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:53,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:56:53,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-02-04 02:56:53,347 INFO L182 omatonBuilderFactory]: Interpolants [10413#true, 10414#false, 10415#(= main_~i~1 0), 10416#(<= main_~i~1 1), 10417#(<= main_~i~1 2), 10418#(<= main_~i~1 3), 10419#(<= main_~i~1 4), 10420#(<= main_~i~1 5), 10421#(<= main_~i~1 6), 10422#(<= main_~i~1 7), 10423#(<= main_~i~1 8), 10424#(<= main_~i~1 9), 10425#(<= main_~i~1 10), 10426#(<= main_~i~1 11)] [2018-02-04 02:56:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6242 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 5890 trivial. 0 not checked. [2018-02-04 02:56:53,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:56:53,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:56:53,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:56:53,348 INFO L87 Difference]: Start difference. First operand 223 states and 274 transitions. Second operand 14 states. [2018-02-04 02:56:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:53,507 INFO L93 Difference]: Finished difference Result 357 states and 434 transitions. [2018-02-04 02:56:53,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:56:53,507 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 391 [2018-02-04 02:56:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:53,509 INFO L225 Difference]: With dead ends: 357 [2018-02-04 02:56:53,510 INFO L226 Difference]: Without dead ends: 357 [2018-02-04 02:56:53,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:56:53,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-04 02:56:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 234. [2018-02-04 02:56:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 02:56:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-02-04 02:56:53,518 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 391 [2018-02-04 02:56:53,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:53,518 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-02-04 02:56:53,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:56:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-02-04 02:56:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-02-04 02:56:53,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:53,522 INFO L351 BasicCegarLoop]: trace histogram [56, 44, 44, 44, 44, 44, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:53,522 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:53,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1326020417, now seen corresponding path program 23 times [2018-02-04 02:56:53,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:53,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:56:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7548 backedges. 866 proven. 581 refuted. 0 times theorem prover too weak. 6101 trivial. 0 not checked. [2018-02-04 02:56:53,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:53,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:56:53,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 150 proven. 78 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-02-04 02:56:53,823 INFO L182 omatonBuilderFactory]: Interpolants [11018#true, 11019#false, 11020#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11021#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11022#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11023#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 11024#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11025#(<= |foo_#in~size| 4), 11026#(<= main_~i~1 4), 11027#(<= main_~i~1 5), 11028#(<= main_~i~1 6), 11029#(<= main_~i~1 7), 11030#(<= main_~i~1 8)] [2018-02-04 02:56:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7548 backedges. 866 proven. 581 refuted. 0 times theorem prover too weak. 6101 trivial. 0 not checked. [2018-02-04 02:56:53,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:56:53,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:56:53,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:56:53,824 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-02-04 02:56:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:53,966 INFO L93 Difference]: Finished difference Result 437 states and 597 transitions. [2018-02-04 02:56:53,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:56:53,966 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 427 [2018-02-04 02:56:53,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:53,969 INFO L225 Difference]: With dead ends: 437 [2018-02-04 02:56:53,969 INFO L226 Difference]: Without dead ends: 437 [2018-02-04 02:56:53,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:56:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-04 02:56:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 234. [2018-02-04 02:56:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 02:56:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-02-04 02:56:53,977 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 427 [2018-02-04 02:56:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:53,977 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-02-04 02:56:53,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:56:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-02-04 02:56:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-02-04 02:56:53,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:53,979 INFO L351 BasicCegarLoop]: trace histogram [57, 45, 45, 45, 45, 45, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:53,979 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1293788297, now seen corresponding path program 24 times [2018-02-04 02:56:53,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:54,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7836 backedges. 1153 proven. 530 refuted. 0 times theorem prover too weak. 6153 trivial. 0 not checked. [2018-02-04 02:56:54,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:54,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:56:54,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 173 proven. 64 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-02-04 02:56:54,293 INFO L182 omatonBuilderFactory]: Interpolants [11712#true, 11713#false, 11714#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11715#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11716#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11717#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 11718#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11719#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 11720#(<= |foo_#in~size| 5), 11721#(<= main_~i~1 5), 11722#(<= main_~i~1 6), 11723#(<= main_~i~1 7), 11724#(<= main_~i~1 8)] [2018-02-04 02:56:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7836 backedges. 1153 proven. 530 refuted. 0 times theorem prover too weak. 6153 trivial. 0 not checked. [2018-02-04 02:56:54,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:56:54,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:56:54,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:56:54,294 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-02-04 02:56:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:54,448 INFO L93 Difference]: Finished difference Result 410 states and 555 transitions. [2018-02-04 02:56:54,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:56:54,448 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 433 [2018-02-04 02:56:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:54,450 INFO L225 Difference]: With dead ends: 410 [2018-02-04 02:56:54,451 INFO L226 Difference]: Without dead ends: 410 [2018-02-04 02:56:54,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:56:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-04 02:56:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 234. [2018-02-04 02:56:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 02:56:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-02-04 02:56:54,460 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 433 [2018-02-04 02:56:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:54,460 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-02-04 02:56:54,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:56:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-02-04 02:56:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-02-04 02:56:54,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:54,464 INFO L351 BasicCegarLoop]: trace histogram [58, 46, 46, 46, 46, 46, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:54,464 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash -456174831, now seen corresponding path program 25 times [2018-02-04 02:56:54,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:54,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8130 backedges. 1530 proven. 389 refuted. 0 times theorem prover too weak. 6211 trivial. 0 not checked. [2018-02-04 02:56:54,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:54,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:56:54,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 211 proven. 38 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-02-04 02:56:54,742 INFO L182 omatonBuilderFactory]: Interpolants [12384#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 12385#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 12386#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 12387#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 12388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 12389#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 12390#(<= |foo_#in~size| 6), 12391#(<= main_~i~1 6), 12392#(<= main_~i~1 7), 12393#(<= main_~i~1 8), 12381#true, 12382#false, 12383#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-04 02:56:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 8130 backedges. 1530 proven. 389 refuted. 0 times theorem prover too weak. 6211 trivial. 0 not checked. [2018-02-04 02:56:54,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:56:54,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:56:54,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:56:54,743 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-02-04 02:56:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:54,905 INFO L93 Difference]: Finished difference Result 375 states and 497 transitions. [2018-02-04 02:56:54,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:56:54,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 439 [2018-02-04 02:56:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:54,908 INFO L225 Difference]: With dead ends: 375 [2018-02-04 02:56:54,908 INFO L226 Difference]: Without dead ends: 375 [2018-02-04 02:56:54,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:56:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-02-04 02:56:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 234. [2018-02-04 02:56:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 02:56:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-02-04 02:56:54,916 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 439 [2018-02-04 02:56:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:54,917 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-02-04 02:56:54,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:56:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-02-04 02:56:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-02-04 02:56:54,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:54,921 INFO L351 BasicCegarLoop]: trace histogram [59, 47, 47, 47, 47, 47, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:54,921 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1762811175, now seen corresponding path program 26 times [2018-02-04 02:56:54,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:54,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8430 backedges. 2015 proven. 140 refuted. 0 times theorem prover too weak. 6275 trivial. 0 not checked. [2018-02-04 02:56:55,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:55,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:56:55,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-02-04 02:56:55,317 INFO L182 omatonBuilderFactory]: Interpolants [13024#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 13025#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 13026#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 13027#(<= |foo_#in~size| 7), 13028#(<= main_~i~1 7), 13029#(<= main_~i~1 8), 13017#true, 13018#false, 13019#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 13020#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 13021#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 13022#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 13023#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4))] [2018-02-04 02:56:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8430 backedges. 2015 proven. 140 refuted. 0 times theorem prover too weak. 6275 trivial. 0 not checked. [2018-02-04 02:56:55,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:56:55,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:56:55,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:56:55,318 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-02-04 02:56:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:55,466 INFO L93 Difference]: Finished difference Result 333 states and 443 transitions. [2018-02-04 02:56:55,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:56:55,467 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 445 [2018-02-04 02:56:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:55,469 INFO L225 Difference]: With dead ends: 333 [2018-02-04 02:56:55,469 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 02:56:55,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:56:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 02:56:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 243. [2018-02-04 02:56:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 02:56:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 309 transitions. [2018-02-04 02:56:55,477 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 309 transitions. Word has length 445 [2018-02-04 02:56:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:55,477 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 309 transitions. [2018-02-04 02:56:55,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:56:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 309 transitions. [2018-02-04 02:56:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-02-04 02:56:55,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:55,481 INFO L351 BasicCegarLoop]: trace histogram [60, 48, 48, 48, 48, 48, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:55,481 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1871830047, now seen corresponding path program 27 times [2018-02-04 02:56:55,482 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:55,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8736 backedges. 631 proven. 1006 refuted. 0 times theorem prover too weak. 7099 trivial. 0 not checked. [2018-02-04 02:56:55,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:55,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:56:55,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 63 proven. 162 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2018-02-04 02:56:55,858 INFO L182 omatonBuilderFactory]: Interpolants [13632#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 13633#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 13634#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 13635#(<= |foo_#in~size| 4), 13622#true, 13623#false, 13624#(<= 0 main_~i~1), 13625#(<= 1 main_~i~1), 13626#(<= 2 main_~i~1), 13627#(<= 3 main_~i~1), 13628#(<= 4 main_~i~1), 13629#(<= 5 main_~i~1), 13630#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 13631#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-04 02:56:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8736 backedges. 631 proven. 1006 refuted. 0 times theorem prover too weak. 7099 trivial. 0 not checked. [2018-02-04 02:56:55,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:56:55,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:56:55,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:56:55,859 INFO L87 Difference]: Start difference. First operand 243 states and 309 transitions. Second operand 14 states. [2018-02-04 02:56:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:56,074 INFO L93 Difference]: Finished difference Result 268 states and 322 transitions. [2018-02-04 02:56:56,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:56:56,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 451 [2018-02-04 02:56:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:56,076 INFO L225 Difference]: With dead ends: 268 [2018-02-04 02:56:56,076 INFO L226 Difference]: Without dead ends: 268 [2018-02-04 02:56:56,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:56:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-04 02:56:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 243. [2018-02-04 02:56:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 02:56:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 302 transitions. [2018-02-04 02:56:56,081 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 302 transitions. Word has length 451 [2018-02-04 02:56:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:56,082 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 302 transitions. [2018-02-04 02:56:56,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:56:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 302 transitions. [2018-02-04 02:56:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-02-04 02:56:56,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:56,085 INFO L351 BasicCegarLoop]: trace histogram [63, 51, 51, 51, 51, 51, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:56,085 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash -872769991, now seen corresponding path program 28 times [2018-02-04 02:56:56,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:56,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9690 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9270 trivial. 0 not checked. [2018-02-04 02:56:56,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:56,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:56:56,412 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2018-02-04 02:56:56,412 INFO L182 omatonBuilderFactory]: Interpolants [14157#true, 14158#false, 14159#(= main_~i~1 0), 14160#(<= main_~i~1 1), 14161#(<= main_~i~1 2), 14162#(<= main_~i~1 3), 14163#(<= main_~i~1 4), 14164#(<= main_~i~1 5), 14165#(<= main_~i~1 6), 14166#(<= main_~i~1 7), 14167#(<= main_~i~1 8), 14168#(<= main_~i~1 9), 14169#(<= main_~i~1 10), 14170#(<= main_~i~1 11), 14171#(<= main_~i~1 12)] [2018-02-04 02:56:56,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9690 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9270 trivial. 0 not checked. [2018-02-04 02:56:56,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:56:56,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:56:56,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:56:56,413 INFO L87 Difference]: Start difference. First operand 243 states and 302 transitions. Second operand 15 states. [2018-02-04 02:56:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:56,533 INFO L93 Difference]: Finished difference Result 382 states and 466 transitions. [2018-02-04 02:56:56,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:56:56,533 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 469 [2018-02-04 02:56:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:56,535 INFO L225 Difference]: With dead ends: 382 [2018-02-04 02:56:56,535 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 02:56:56,536 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:56:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 02:56:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 254. [2018-02-04 02:56:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 02:56:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-02-04 02:56:56,542 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 469 [2018-02-04 02:56:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:56,542 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-02-04 02:56:56,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:56:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-02-04 02:56:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2018-02-04 02:56:56,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:56,546 INFO L351 BasicCegarLoop]: trace histogram [69, 56, 56, 56, 56, 56, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:56,546 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:56,546 INFO L82 PathProgramCache]: Analyzing trace with hash -677191454, now seen corresponding path program 29 times [2018-02-04 02:56:56,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:56,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11658 backedges. 1307 proven. 817 refuted. 0 times theorem prover too weak. 9534 trivial. 0 not checked. [2018-02-04 02:56:56,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:56,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:56:56,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 200 proven. 96 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-02-04 02:56:56,929 INFO L182 omatonBuilderFactory]: Interpolants [14816#(<= |foo_#in~size| 5), 14817#(<= main_~i~1 5), 14818#(<= main_~i~1 6), 14819#(<= main_~i~1 7), 14820#(<= main_~i~1 8), 14821#(<= main_~i~1 9), 14808#true, 14809#false, 14810#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 14811#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 14812#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 14813#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 14814#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 14815#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-04 02:56:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 11658 backedges. 1307 proven. 817 refuted. 0 times theorem prover too weak. 9534 trivial. 0 not checked. [2018-02-04 02:56:56,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:56:56,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:56:56,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:56:56,930 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-02-04 02:56:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:57,073 INFO L93 Difference]: Finished difference Result 483 states and 670 transitions. [2018-02-04 02:56:57,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:56:57,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 511 [2018-02-04 02:56:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:57,077 INFO L225 Difference]: With dead ends: 483 [2018-02-04 02:56:57,077 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 02:56:57,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:56:57,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 02:56:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 254. [2018-02-04 02:56:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 02:56:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-02-04 02:56:57,083 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 511 [2018-02-04 02:56:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:57,084 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-02-04 02:56:57,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:56:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-02-04 02:56:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-02-04 02:56:57,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:57,086 INFO L351 BasicCegarLoop]: trace histogram [70, 57, 57, 57, 57, 57, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:57,086 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:57,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2088382826, now seen corresponding path program 30 times [2018-02-04 02:56:57,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:57,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12020 backedges. 1708 proven. 720 refuted. 0 times theorem prover too weak. 9592 trivial. 0 not checked. [2018-02-04 02:56:57,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:57,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:56:57,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 229 proven. 76 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-02-04 02:56:57,400 INFO L182 omatonBuilderFactory]: Interpolants [15584#(<= main_~i~1 9), 15571#true, 15572#false, 15573#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 15574#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 15575#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 15576#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 15577#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 15578#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 15579#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 15580#(<= |foo_#in~size| 6), 15581#(<= main_~i~1 6), 15582#(<= main_~i~1 7), 15583#(<= main_~i~1 8)] [2018-02-04 02:56:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12020 backedges. 1708 proven. 720 refuted. 0 times theorem prover too weak. 9592 trivial. 0 not checked. [2018-02-04 02:56:57,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:56:57,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:56:57,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:56:57,401 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-02-04 02:56:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:57,540 INFO L93 Difference]: Finished difference Result 450 states and 618 transitions. [2018-02-04 02:56:57,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:56:57,540 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 517 [2018-02-04 02:56:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:57,542 INFO L225 Difference]: With dead ends: 450 [2018-02-04 02:56:57,542 INFO L226 Difference]: Without dead ends: 450 [2018-02-04 02:56:57,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:56:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-02-04 02:56:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 254. [2018-02-04 02:56:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 02:56:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-02-04 02:56:57,548 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 517 [2018-02-04 02:56:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:57,549 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-02-04 02:56:57,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:56:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-02-04 02:56:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-02-04 02:56:57,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:57,551 INFO L351 BasicCegarLoop]: trace histogram [71, 58, 58, 58, 58, 58, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:57,551 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1038597326, now seen corresponding path program 31 times [2018-02-04 02:56:57,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:57,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12388 backedges. 2217 proven. 515 refuted. 0 times theorem prover too weak. 9656 trivial. 0 not checked. [2018-02-04 02:56:57,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:57,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:56:57,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 273 proven. 44 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-02-04 02:56:57,893 INFO L182 omatonBuilderFactory]: Interpolants [16303#true, 16304#false, 16305#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 16306#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 16307#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 16308#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 16309#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 16310#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 16311#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 16312#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 16313#(<= |foo_#in~size| 7), 16314#(<= main_~i~1 7), 16315#(<= main_~i~1 8), 16316#(<= main_~i~1 9)] [2018-02-04 02:56:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12388 backedges. 2217 proven. 515 refuted. 0 times theorem prover too weak. 9656 trivial. 0 not checked. [2018-02-04 02:56:57,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:56:57,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:56:57,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:56:57,894 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-02-04 02:56:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:58,063 INFO L93 Difference]: Finished difference Result 409 states and 550 transitions. [2018-02-04 02:56:58,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:56:58,064 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 523 [2018-02-04 02:56:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:58,065 INFO L225 Difference]: With dead ends: 409 [2018-02-04 02:56:58,066 INFO L226 Difference]: Without dead ends: 409 [2018-02-04 02:56:58,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:56:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-04 02:56:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 254. [2018-02-04 02:56:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 02:56:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-02-04 02:56:58,073 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 523 [2018-02-04 02:56:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:58,073 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-02-04 02:56:58,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:56:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-02-04 02:56:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-02-04 02:56:58,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:58,077 INFO L351 BasicCegarLoop]: trace histogram [72, 59, 59, 59, 59, 59, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:58,077 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:58,077 INFO L82 PathProgramCache]: Analyzing trace with hash 857384506, now seen corresponding path program 32 times [2018-02-04 02:56:58,078 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:58,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12762 backedges. 2852 proven. 184 refuted. 0 times theorem prover too weak. 9726 trivial. 0 not checked. [2018-02-04 02:56:58,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:58,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:56:58,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-02-04 02:56:58,464 INFO L182 omatonBuilderFactory]: Interpolants [16996#true, 16997#false, 16998#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 16999#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 17000#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 17001#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 17002#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 17003#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 17004#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 17005#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 17006#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 17007#(<= |foo_#in~size| 8), 17008#(<= main_~i~1 8), 17009#(<= main_~i~1 9)] [2018-02-04 02:56:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12762 backedges. 2852 proven. 184 refuted. 0 times theorem prover too weak. 9726 trivial. 0 not checked. [2018-02-04 02:56:58,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:56:58,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:56:58,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:56:58,466 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-02-04 02:56:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:58,670 INFO L93 Difference]: Finished difference Result 361 states and 487 transitions. [2018-02-04 02:56:58,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:56:58,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 529 [2018-02-04 02:56:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:58,672 INFO L225 Difference]: With dead ends: 361 [2018-02-04 02:56:58,672 INFO L226 Difference]: Without dead ends: 361 [2018-02-04 02:56:58,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:56:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-04 02:56:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 263. [2018-02-04 02:56:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 02:56:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 338 transitions. [2018-02-04 02:56:58,679 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 338 transitions. Word has length 529 [2018-02-04 02:56:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:58,679 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 338 transitions. [2018-02-04 02:56:58,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:56:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 338 transitions. [2018-02-04 02:56:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-02-04 02:56:58,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:58,683 INFO L351 BasicCegarLoop]: trace histogram [73, 60, 60, 60, 60, 60, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:58,683 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:58,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1422482050, now seen corresponding path program 33 times [2018-02-04 02:56:58,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:58,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 13142 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 12648 trivial. 0 not checked. [2018-02-04 02:56:59,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:59,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:56:59,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2018-02-04 02:56:59,096 INFO L182 omatonBuilderFactory]: Interpolants [17664#(<= main_~i~1 10), 17665#(<= main_~i~1 11), 17666#(<= main_~i~1 12), 17667#(<= main_~i~1 13), 17652#true, 17653#false, 17654#(= main_~i~1 0), 17655#(<= main_~i~1 1), 17656#(<= main_~i~1 2), 17657#(<= main_~i~1 3), 17658#(<= main_~i~1 4), 17659#(<= main_~i~1 5), 17660#(<= main_~i~1 6), 17661#(<= main_~i~1 7), 17662#(<= main_~i~1 8), 17663#(<= main_~i~1 9)] [2018-02-04 02:56:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13142 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 12648 trivial. 0 not checked. [2018-02-04 02:56:59,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:56:59,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:56:59,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:56:59,097 INFO L87 Difference]: Start difference. First operand 263 states and 338 transitions. Second operand 16 states. [2018-02-04 02:56:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:59,192 INFO L93 Difference]: Finished difference Result 439 states and 572 transitions. [2018-02-04 02:56:59,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:56:59,193 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 535 [2018-02-04 02:56:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:59,194 INFO L225 Difference]: With dead ends: 439 [2018-02-04 02:56:59,194 INFO L226 Difference]: Without dead ends: 439 [2018-02-04 02:56:59,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:56:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-04 02:56:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 274. [2018-02-04 02:56:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 02:56:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-02-04 02:56:59,202 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 535 [2018-02-04 02:56:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:59,202 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-02-04 02:56:59,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:56:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-02-04 02:56:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-02-04 02:56:59,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:59,205 INFO L351 BasicCegarLoop]: trace histogram [79, 65, 65, 65, 65, 65, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:59,205 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:59,205 INFO L82 PathProgramCache]: Analyzing trace with hash -688793877, now seen corresponding path program 34 times [2018-02-04 02:56:59,206 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:59,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:56:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15420 backedges. 1365 proven. 1142 refuted. 0 times theorem prover too weak. 12913 trivial. 0 not checked. [2018-02-04 02:56:59,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:56:59,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:56:59,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:56:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1896 backedges. 200 proven. 128 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-04 02:56:59,684 INFO L182 omatonBuilderFactory]: Interpolants [18381#true, 18382#false, 18383#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 18384#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 18385#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 18386#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 18387#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 18388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 18389#(<= |foo_#in~size| 5), 18390#(<= main_~i~1 5), 18391#(<= main_~i~1 6), 18392#(<= main_~i~1 7), 18393#(<= main_~i~1 8), 18394#(<= main_~i~1 9), 18395#(<= main_~i~1 10)] [2018-02-04 02:56:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15420 backedges. 1365 proven. 1142 refuted. 0 times theorem prover too weak. 12913 trivial. 0 not checked. [2018-02-04 02:56:59,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:56:59,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:56:59,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:56:59,685 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-02-04 02:56:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:56:59,852 INFO L93 Difference]: Finished difference Result 556 states and 830 transitions. [2018-02-04 02:56:59,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:56:59,853 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 577 [2018-02-04 02:56:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:56:59,855 INFO L225 Difference]: With dead ends: 556 [2018-02-04 02:56:59,855 INFO L226 Difference]: Without dead ends: 556 [2018-02-04 02:56:59,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:56:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-02-04 02:56:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 274. [2018-02-04 02:56:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 02:56:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-02-04 02:56:59,862 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 577 [2018-02-04 02:56:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:56:59,862 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-02-04 02:56:59,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:56:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-02-04 02:56:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2018-02-04 02:56:59,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:56:59,865 INFO L351 BasicCegarLoop]: trace histogram [80, 66, 66, 66, 66, 66, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:56:59,865 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:56:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1619073677, now seen corresponding path program 35 times [2018-02-04 02:56:59,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:56:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:56:59,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 15838 backedges. 1772 proven. 1095 refuted. 0 times theorem prover too weak. 12971 trivial. 0 not checked. [2018-02-04 02:57:00,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:00,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:57:00,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 229 proven. 114 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-04 02:57:00,244 INFO L182 omatonBuilderFactory]: Interpolants [19238#true, 19239#false, 19240#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 19241#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 19242#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 19243#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 19244#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 19245#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 19246#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 19247#(<= |foo_#in~size| 6), 19248#(<= main_~i~1 6), 19249#(<= main_~i~1 7), 19250#(<= main_~i~1 8), 19251#(<= main_~i~1 9), 19252#(<= main_~i~1 10)] [2018-02-04 02:57:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15838 backedges. 1772 proven. 1095 refuted. 0 times theorem prover too weak. 12971 trivial. 0 not checked. [2018-02-04 02:57:00,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:57:00,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:57:00,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:57:00,245 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-02-04 02:57:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:00,408 INFO L93 Difference]: Finished difference Result 529 states and 784 transitions. [2018-02-04 02:57:00,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:57:00,409 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 583 [2018-02-04 02:57:00,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:00,412 INFO L225 Difference]: With dead ends: 529 [2018-02-04 02:57:00,412 INFO L226 Difference]: Without dead ends: 529 [2018-02-04 02:57:00,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:57:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-04 02:57:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 274. [2018-02-04 02:57:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 02:57:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-02-04 02:57:00,421 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 583 [2018-02-04 02:57:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:00,422 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-02-04 02:57:00,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:57:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-02-04 02:57:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-02-04 02:57:00,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:00,426 INFO L351 BasicCegarLoop]: trace histogram [81, 67, 67, 67, 67, 67, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:00,426 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1912773317, now seen corresponding path program 36 times [2018-02-04 02:57:00,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:00,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16262 backedges. 2287 proven. 940 refuted. 0 times theorem prover too weak. 13035 trivial. 0 not checked. [2018-02-04 02:57:00,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:00,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:57:00,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 273 proven. 88 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-04 02:57:00,853 INFO L182 omatonBuilderFactory]: Interpolants [20070#true, 20071#false, 20072#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 20073#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 20074#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 20075#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 20076#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 20077#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 20078#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 20079#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 20080#(<= |foo_#in~size| 7), 20081#(<= main_~i~1 7), 20082#(<= main_~i~1 8), 20083#(<= main_~i~1 9), 20084#(<= main_~i~1 10)] [2018-02-04 02:57:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16262 backedges. 2287 proven. 940 refuted. 0 times theorem prover too weak. 13035 trivial. 0 not checked. [2018-02-04 02:57:00,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:57:00,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:57:00,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:57:00,854 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-02-04 02:57:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:01,076 INFO L93 Difference]: Finished difference Result 490 states and 716 transitions. [2018-02-04 02:57:01,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:57:01,076 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 589 [2018-02-04 02:57:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:01,078 INFO L225 Difference]: With dead ends: 490 [2018-02-04 02:57:01,078 INFO L226 Difference]: Without dead ends: 490 [2018-02-04 02:57:01,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:57:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-02-04 02:57:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 274. [2018-02-04 02:57:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 02:57:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-02-04 02:57:01,084 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 589 [2018-02-04 02:57:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:01,084 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-02-04 02:57:01,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:57:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-02-04 02:57:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-02-04 02:57:01,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:01,087 INFO L351 BasicCegarLoop]: trace histogram [82, 68, 68, 68, 68, 68, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:01,087 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1734796867, now seen corresponding path program 37 times [2018-02-04 02:57:01,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:01,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16692 backedges. 2928 proven. 659 refuted. 0 times theorem prover too weak. 13105 trivial. 0 not checked. [2018-02-04 02:57:01,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:01,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:57:01,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 323 proven. 50 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-04 02:57:01,618 INFO L182 omatonBuilderFactory]: Interpolants [20865#true, 20866#false, 20867#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 20868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 20869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 20870#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 20871#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 20872#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 20873#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 20874#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 20875#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 20876#(<= |foo_#in~size| 8), 20877#(<= main_~i~1 8), 20878#(<= main_~i~1 9), 20879#(<= main_~i~1 10)] [2018-02-04 02:57:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 16692 backedges. 2928 proven. 659 refuted. 0 times theorem prover too weak. 13105 trivial. 0 not checked. [2018-02-04 02:57:01,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:57:01,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:57:01,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:57:01,620 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-02-04 02:57:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:01,831 INFO L93 Difference]: Finished difference Result 443 states and 630 transitions. [2018-02-04 02:57:01,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:57:01,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 595 [2018-02-04 02:57:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:01,833 INFO L225 Difference]: With dead ends: 443 [2018-02-04 02:57:01,833 INFO L226 Difference]: Without dead ends: 443 [2018-02-04 02:57:01,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:57:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-04 02:57:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 274. [2018-02-04 02:57:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 02:57:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-02-04 02:57:01,838 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 595 [2018-02-04 02:57:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:01,838 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-02-04 02:57:01,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:57:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-02-04 02:57:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2018-02-04 02:57:01,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:01,841 INFO L351 BasicCegarLoop]: trace histogram [83, 69, 69, 69, 69, 69, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:01,841 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:01,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1057187979, now seen corresponding path program 38 times [2018-02-04 02:57:01,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:01,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 17128 backedges. 3713 proven. 234 refuted. 0 times theorem prover too weak. 13181 trivial. 0 not checked. [2018-02-04 02:57:02,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:02,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:57:02,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-04 02:57:02,277 INFO L182 omatonBuilderFactory]: Interpolants [21615#true, 21616#false, 21617#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 21618#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 21619#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 21620#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 21621#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 21622#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 21623#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 21624#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 21625#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 21626#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 21627#(<= |foo_#in~size| 9), 21628#(<= main_~i~1 9), 21629#(<= main_~i~1 10)] [2018-02-04 02:57:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 17128 backedges. 3713 proven. 234 refuted. 0 times theorem prover too weak. 13181 trivial. 0 not checked. [2018-02-04 02:57:02,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:57:02,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:57:02,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:57:02,278 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-02-04 02:57:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:02,558 INFO L93 Difference]: Finished difference Result 389 states and 549 transitions. [2018-02-04 02:57:02,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:57:02,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 601 [2018-02-04 02:57:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:02,560 INFO L225 Difference]: With dead ends: 389 [2018-02-04 02:57:02,560 INFO L226 Difference]: Without dead ends: 389 [2018-02-04 02:57:02,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:57:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-04 02:57:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 283. [2018-02-04 02:57:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 02:57:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 376 transitions. [2018-02-04 02:57:02,566 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 376 transitions. Word has length 601 [2018-02-04 02:57:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:02,567 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 376 transitions. [2018-02-04 02:57:02,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:57:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 376 transitions. [2018-02-04 02:57:02,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-02-04 02:57:02,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:02,571 INFO L351 BasicCegarLoop]: trace histogram [84, 70, 70, 70, 70, 70, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:02,571 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash 141646867, now seen corresponding path program 39 times [2018-02-04 02:57:02,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:02,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:57:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 17570 backedges. 990 proven. 1775 refuted. 0 times theorem prover too weak. 14805 trivial. 0 not checked. [2018-02-04 02:57:03,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:03,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:57:03,060 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 95 proven. 230 refuted. 0 times theorem prover too weak. 1619 trivial. 0 not checked. [2018-02-04 02:57:03,061 INFO L182 omatonBuilderFactory]: Interpolants [22336#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 22337#(<= |foo_#in~size| 5), 22322#true, 22323#false, 22324#(<= 0 main_~i~1), 22325#(<= 1 main_~i~1), 22326#(<= 2 main_~i~1), 22327#(<= 3 main_~i~1), 22328#(<= 4 main_~i~1), 22329#(<= 5 main_~i~1), 22330#(<= 6 main_~i~1), 22331#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 22332#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 22333#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 22334#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 22335#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4))] [2018-02-04 02:57:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17570 backedges. 990 proven. 1775 refuted. 0 times theorem prover too weak. 14805 trivial. 0 not checked. [2018-02-04 02:57:03,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:57:03,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:57:03,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:57:03,062 INFO L87 Difference]: Start difference. First operand 283 states and 376 transitions. Second operand 16 states. [2018-02-04 02:57:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:03,264 INFO L93 Difference]: Finished difference Result 313 states and 392 transitions. [2018-02-04 02:57:03,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:57:03,265 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 607 [2018-02-04 02:57:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:03,266 INFO L225 Difference]: With dead ends: 313 [2018-02-04 02:57:03,266 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 02:57:03,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:57:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 02:57:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2018-02-04 02:57:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 02:57:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 368 transitions. [2018-02-04 02:57:03,269 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 368 transitions. Word has length 607 [2018-02-04 02:57:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:03,270 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 368 transitions. [2018-02-04 02:57:03,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:57:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 368 transitions. [2018-02-04 02:57:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-02-04 02:57:03,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:03,272 INFO L351 BasicCegarLoop]: trace histogram [87, 73, 73, 73, 73, 73, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:03,272 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1552314325, now seen corresponding path program 40 times [2018-02-04 02:57:03,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:03,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18932 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 18358 trivial. 0 not checked. [2018-02-04 02:57:03,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:03,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:57:03,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2018-02-04 02:57:03,705 INFO L182 omatonBuilderFactory]: Interpolants [22946#true, 22947#false, 22948#(= main_~i~1 0), 22949#(<= main_~i~1 1), 22950#(<= main_~i~1 2), 22951#(<= main_~i~1 3), 22952#(<= main_~i~1 4), 22953#(<= main_~i~1 5), 22954#(<= main_~i~1 6), 22955#(<= main_~i~1 7), 22956#(<= main_~i~1 8), 22957#(<= main_~i~1 9), 22958#(<= main_~i~1 10), 22959#(<= main_~i~1 11), 22960#(<= main_~i~1 12), 22961#(<= main_~i~1 13), 22962#(<= main_~i~1 14)] [2018-02-04 02:57:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18932 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 18358 trivial. 0 not checked. [2018-02-04 02:57:03,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:57:03,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:57:03,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:57:03,707 INFO L87 Difference]: Start difference. First operand 283 states and 368 transitions. Second operand 17 states. [2018-02-04 02:57:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:03,823 INFO L93 Difference]: Finished difference Result 464 states and 606 transitions. [2018-02-04 02:57:03,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:57:03,823 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 625 [2018-02-04 02:57:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:03,825 INFO L225 Difference]: With dead ends: 464 [2018-02-04 02:57:03,825 INFO L226 Difference]: Without dead ends: 464 [2018-02-04 02:57:03,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:57:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-04 02:57:03,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 294. [2018-02-04 02:57:03,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-04 02:57:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-02-04 02:57:03,829 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 625 [2018-02-04 02:57:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:03,829 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-02-04 02:57:03,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:57:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-02-04 02:57:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2018-02-04 02:57:03,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:03,832 INFO L351 BasicCegarLoop]: trace histogram [94, 79, 79, 79, 79, 79, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:03,832 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash -971505124, now seen corresponding path program 41 times [2018-02-04 02:57:03,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:03,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 22146 backedges. 1950 proven. 1514 refuted. 0 times theorem prover too weak. 18682 trivial. 0 not checked. [2018-02-04 02:57:04,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:04,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:57:04,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2472 backedges. 256 proven. 152 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-02-04 02:57:04,330 INFO L182 omatonBuilderFactory]: Interpolants [23721#true, 23722#false, 23723#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 23724#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 23725#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 23726#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 23727#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 23728#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 23729#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 23730#(<= |foo_#in~size| 6), 23731#(<= main_~i~1 6), 23732#(<= main_~i~1 7), 23733#(<= main_~i~1 8), 23734#(<= main_~i~1 9), 23735#(<= main_~i~1 10), 23736#(<= main_~i~1 11)] [2018-02-04 02:57:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 22146 backedges. 1950 proven. 1514 refuted. 0 times theorem prover too weak. 18682 trivial. 0 not checked. [2018-02-04 02:57:04,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:57:04,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:57:04,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:57:04,331 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-02-04 02:57:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:04,501 INFO L93 Difference]: Finished difference Result 608 states and 923 transitions. [2018-02-04 02:57:04,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:57:04,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 673 [2018-02-04 02:57:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:04,505 INFO L225 Difference]: With dead ends: 608 [2018-02-04 02:57:04,505 INFO L226 Difference]: Without dead ends: 608 [2018-02-04 02:57:04,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:57:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-02-04 02:57:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 294. [2018-02-04 02:57:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-04 02:57:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-02-04 02:57:04,512 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 673 [2018-02-04 02:57:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:04,512 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-02-04 02:57:04,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:57:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-02-04 02:57:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-02-04 02:57:04,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:04,515 INFO L351 BasicCegarLoop]: trace histogram [95, 80, 80, 80, 80, 80, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:04,515 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:04,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2105112604, now seen corresponding path program 42 times [2018-02-04 02:57:04,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:04,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:57:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 2489 proven. 1415 refuted. 0 times theorem prover too weak. 18746 trivial. 0 not checked. [2018-02-04 02:57:05,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:05,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:57:05,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2487 backedges. 291 proven. 132 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-02-04 02:57:05,025 INFO L182 omatonBuilderFactory]: Interpolants [24653#true, 24654#false, 24655#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 24656#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 24657#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 24658#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 24659#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 24660#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 24661#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 24662#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 24663#(<= |foo_#in~size| 7), 24664#(<= main_~i~1 7), 24665#(<= main_~i~1 8), 24666#(<= main_~i~1 9), 24667#(<= main_~i~1 10), 24668#(<= main_~i~1 11)] [2018-02-04 02:57:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 2489 proven. 1415 refuted. 0 times theorem prover too weak. 18746 trivial. 0 not checked. [2018-02-04 02:57:05,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:57:05,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:57:05,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:57:05,026 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-02-04 02:57:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:05,217 INFO L93 Difference]: Finished difference Result 575 states and 866 transitions. [2018-02-04 02:57:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:57:05,217 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 679 [2018-02-04 02:57:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:05,220 INFO L225 Difference]: With dead ends: 575 [2018-02-04 02:57:05,220 INFO L226 Difference]: Without dead ends: 575 [2018-02-04 02:57:05,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:57:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-04 02:57:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 294. [2018-02-04 02:57:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-04 02:57:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-02-04 02:57:05,227 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 679 [2018-02-04 02:57:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:05,227 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-02-04 02:57:05,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:57:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-02-04 02:57:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2018-02-04 02:57:05,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:05,230 INFO L351 BasicCegarLoop]: trace histogram [96, 81, 81, 81, 81, 81, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:05,230 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:05,231 INFO L82 PathProgramCache]: Analyzing trace with hash -887206164, now seen corresponding path program 43 times [2018-02-04 02:57:05,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:05,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 23160 backedges. 3154 proven. 1190 refuted. 0 times theorem prover too weak. 18816 trivial. 0 not checked. [2018-02-04 02:57:05,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:05,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:57:05,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 341 proven. 100 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-02-04 02:57:05,754 INFO L182 omatonBuilderFactory]: Interpolants [25568#(<= main_~i~1 10), 25569#(<= main_~i~1 11), 25554#true, 25555#false, 25556#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 25557#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 25558#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 25559#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 25560#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 25561#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 25562#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 25563#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 25564#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 25565#(<= |foo_#in~size| 8), 25566#(<= main_~i~1 8), 25567#(<= main_~i~1 9)] [2018-02-04 02:57:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 23160 backedges. 3154 proven. 1190 refuted. 0 times theorem prover too weak. 18816 trivial. 0 not checked. [2018-02-04 02:57:05,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:57:05,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:57:05,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:57:05,755 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-02-04 02:57:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:05,943 INFO L93 Difference]: Finished difference Result 530 states and 787 transitions. [2018-02-04 02:57:05,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:57:05,943 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 685 [2018-02-04 02:57:05,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:05,946 INFO L225 Difference]: With dead ends: 530 [2018-02-04 02:57:05,946 INFO L226 Difference]: Without dead ends: 530 [2018-02-04 02:57:05,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:57:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-02-04 02:57:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 294. [2018-02-04 02:57:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-04 02:57:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-02-04 02:57:05,952 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 685 [2018-02-04 02:57:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:05,952 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-02-04 02:57:05,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:57:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-02-04 02:57:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2018-02-04 02:57:05,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:05,955 INFO L351 BasicCegarLoop]: trace histogram [97, 82, 82, 82, 82, 82, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:05,955 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:05,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1895344332, now seen corresponding path program 44 times [2018-02-04 02:57:05,956 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:05,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 23676 backedges. 3963 proven. 821 refuted. 0 times theorem prover too weak. 18892 trivial. 0 not checked. [2018-02-04 02:57:06,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:06,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:57:06,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2517 backedges. 397 proven. 56 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-02-04 02:57:06,511 INFO L182 omatonBuilderFactory]: Interpolants [26412#true, 26413#false, 26414#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 26415#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 26416#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 26417#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 26418#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 26419#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 26420#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 26421#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 26422#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 26423#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 26424#(<= |foo_#in~size| 9), 26425#(<= main_~i~1 9), 26426#(<= main_~i~1 10), 26427#(<= main_~i~1 11)] [2018-02-04 02:57:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 23676 backedges. 3963 proven. 821 refuted. 0 times theorem prover too weak. 18892 trivial. 0 not checked. [2018-02-04 02:57:06,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:57:06,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:57:06,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:57:06,512 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-02-04 02:57:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:06,703 INFO L93 Difference]: Finished difference Result 477 states and 689 transitions. [2018-02-04 02:57:06,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:57:06,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 691 [2018-02-04 02:57:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:06,706 INFO L225 Difference]: With dead ends: 477 [2018-02-04 02:57:06,706 INFO L226 Difference]: Without dead ends: 477 [2018-02-04 02:57:06,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:57:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-02-04 02:57:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 294. [2018-02-04 02:57:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-04 02:57:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-02-04 02:57:06,713 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 691 [2018-02-04 02:57:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:06,713 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-02-04 02:57:06,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:57:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-02-04 02:57:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2018-02-04 02:57:06,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:06,717 INFO L351 BasicCegarLoop]: trace histogram [98, 83, 83, 83, 83, 83, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:06,717 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:06,717 INFO L82 PathProgramCache]: Analyzing trace with hash 80744636, now seen corresponding path program 45 times [2018-02-04 02:57:06,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:06,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 24198 backedges. 4934 proven. 290 refuted. 0 times theorem prover too weak. 18974 trivial. 0 not checked. [2018-02-04 02:57:07,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:07,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:57:07,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2523 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-02-04 02:57:07,343 INFO L182 omatonBuilderFactory]: Interpolants [27232#(<= |foo_#in~size| 10), 27233#(<= main_~i~1 10), 27234#(<= main_~i~1 11), 27219#true, 27220#false, 27221#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 27222#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 27223#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 27224#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 27225#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 27226#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 27227#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 27228#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 27229#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 27230#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 27231#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10))] [2018-02-04 02:57:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 24198 backedges. 4934 proven. 290 refuted. 0 times theorem prover too weak. 18974 trivial. 0 not checked. [2018-02-04 02:57:07,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:57:07,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:57:07,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:57:07,344 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-02-04 02:57:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:07,534 INFO L93 Difference]: Finished difference Result 417 states and 597 transitions. [2018-02-04 02:57:07,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 02:57:07,534 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 697 [2018-02-04 02:57:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:07,535 INFO L225 Difference]: With dead ends: 417 [2018-02-04 02:57:07,535 INFO L226 Difference]: Without dead ends: 417 [2018-02-04 02:57:07,536 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:57:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-02-04 02:57:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 303. [2018-02-04 02:57:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 02:57:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 407 transitions. [2018-02-04 02:57:07,540 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 407 transitions. Word has length 697 [2018-02-04 02:57:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:07,540 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 407 transitions. [2018-02-04 02:57:07,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:57:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 407 transitions. [2018-02-04 02:57:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2018-02-04 02:57:07,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:07,543 INFO L351 BasicCegarLoop]: trace histogram [99, 84, 84, 84, 84, 84, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:07,543 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2083609476, now seen corresponding path program 46 times [2018-02-04 02:57:07,544 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:07,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 24726 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 24066 trivial. 0 not checked. [2018-02-04 02:57:08,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:08,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:57:08,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-04 02:57:08,100 INFO L182 omatonBuilderFactory]: Interpolants [27977#true, 27978#false, 27979#(= main_~i~1 0), 27980#(<= main_~i~1 1), 27981#(<= main_~i~1 2), 27982#(<= main_~i~1 3), 27983#(<= main_~i~1 4), 27984#(<= main_~i~1 5), 27985#(<= main_~i~1 6), 27986#(<= main_~i~1 7), 27987#(<= main_~i~1 8), 27988#(<= main_~i~1 9), 27989#(<= main_~i~1 10), 27990#(<= main_~i~1 11), 27991#(<= main_~i~1 12), 27992#(<= main_~i~1 13), 27993#(<= main_~i~1 14), 27994#(<= main_~i~1 15)] [2018-02-04 02:57:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 24726 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 24066 trivial. 0 not checked. [2018-02-04 02:57:08,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:57:08,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:57:08,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:57:08,101 INFO L87 Difference]: Start difference. First operand 303 states and 407 transitions. Second operand 18 states. [2018-02-04 02:57:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:08,321 INFO L93 Difference]: Finished difference Result 527 states and 737 transitions. [2018-02-04 02:57:08,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:57:08,321 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 703 [2018-02-04 02:57:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:08,324 INFO L225 Difference]: With dead ends: 527 [2018-02-04 02:57:08,324 INFO L226 Difference]: Without dead ends: 527 [2018-02-04 02:57:08,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:57:08,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-02-04 02:57:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 314. [2018-02-04 02:57:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-04 02:57:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 425 transitions. [2018-02-04 02:57:08,332 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 425 transitions. Word has length 703 [2018-02-04 02:57:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:08,332 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 425 transitions. [2018-02-04 02:57:08,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:57:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 425 transitions. [2018-02-04 02:57:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2018-02-04 02:57:08,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:08,338 INFO L351 BasicCegarLoop]: trace histogram [106, 90, 90, 90, 90, 90, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:08,338 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:08,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1951724619, now seen corresponding path program 47 times [2018-02-04 02:57:08,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:08,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 28382 backedges. 1469 proven. 2632 refuted. 0 times theorem prover too weak. 24281 trivial. 0 not checked. [2018-02-04 02:57:09,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:09,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:57:09,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 133 proven. 313 refuted. 0 times theorem prover too weak. 2533 trivial. 0 not checked. [2018-02-04 02:57:09,077 INFO L182 omatonBuilderFactory]: Interpolants [28836#true, 28837#false, 28838#(<= 0 main_~i~1), 28839#(<= 1 main_~i~1), 28840#(<= 2 main_~i~1), 28841#(<= 3 main_~i~1), 28842#(<= 4 main_~i~1), 28843#(<= 5 main_~i~1), 28844#(<= 6 main_~i~1), 28845#(<= 7 main_~i~1), 28846#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 28847#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 28848#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 28849#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 28850#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 28851#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 28852#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 28853#(<= |foo_#in~size| 6)] [2018-02-04 02:57:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28382 backedges. 1469 proven. 2632 refuted. 0 times theorem prover too weak. 24281 trivial. 0 not checked. [2018-02-04 02:57:09,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:57:09,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:57:09,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:57:09,078 INFO L87 Difference]: Start difference. First operand 314 states and 425 transitions. Second operand 18 states. [2018-02-04 02:57:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:09,392 INFO L93 Difference]: Finished difference Result 349 states and 444 transitions. [2018-02-04 02:57:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:57:09,392 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 751 [2018-02-04 02:57:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:09,393 INFO L225 Difference]: With dead ends: 349 [2018-02-04 02:57:09,393 INFO L226 Difference]: Without dead ends: 349 [2018-02-04 02:57:09,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:57:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-04 02:57:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 314. [2018-02-04 02:57:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-04 02:57:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 416 transitions. [2018-02-04 02:57:09,397 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 416 transitions. Word has length 751 [2018-02-04 02:57:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:09,398 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 416 transitions. [2018-02-04 02:57:09,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:57:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 416 transitions. [2018-02-04 02:57:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2018-02-04 02:57:09,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:09,404 INFO L351 BasicCegarLoop]: trace histogram [110, 94, 94, 94, 94, 94, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:09,404 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:09,404 INFO L82 PathProgramCache]: Analyzing trace with hash -234595499, now seen corresponding path program 48 times [2018-02-04 02:57:09,405 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:09,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 30706 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 29954 trivial. 0 not checked. [2018-02-04 02:57:10,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:10,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:57:10,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-02-04 02:57:10,203 INFO L182 omatonBuilderFactory]: Interpolants [29536#(<= main_~i~1 3), 29537#(<= main_~i~1 4), 29538#(<= main_~i~1 5), 29539#(<= main_~i~1 6), 29540#(<= main_~i~1 7), 29541#(<= main_~i~1 8), 29542#(<= main_~i~1 9), 29543#(<= main_~i~1 10), 29544#(<= main_~i~1 11), 29545#(<= main_~i~1 12), 29546#(<= main_~i~1 13), 29547#(<= main_~i~1 14), 29548#(<= main_~i~1 15), 29549#(<= main_~i~1 16), 29531#true, 29532#false, 29533#(= main_~i~1 0), 29534#(<= main_~i~1 1), 29535#(<= main_~i~1 2)] [2018-02-04 02:57:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 30706 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 29954 trivial. 0 not checked. [2018-02-04 02:57:10,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:57:10,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:57:10,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:57:10,204 INFO L87 Difference]: Start difference. First operand 314 states and 416 transitions. Second operand 19 states. [2018-02-04 02:57:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:10,335 INFO L93 Difference]: Finished difference Result 505 states and 662 transitions. [2018-02-04 02:57:10,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:57:10,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 775 [2018-02-04 02:57:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:10,338 INFO L225 Difference]: With dead ends: 505 [2018-02-04 02:57:10,338 INFO L226 Difference]: Without dead ends: 505 [2018-02-04 02:57:10,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:57:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-04 02:57:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 325. [2018-02-04 02:57:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-04 02:57:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 433 transitions. [2018-02-04 02:57:10,344 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 433 transitions. Word has length 775 [2018-02-04 02:57:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:10,345 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 433 transitions. [2018-02-04 02:57:10,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:57:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 433 transitions. [2018-02-04 02:57:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2018-02-04 02:57:10,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:10,352 INFO L351 BasicCegarLoop]: trace histogram [118, 101, 101, 101, 101, 101, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:10,352 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1205015410, now seen corresponding path program 49 times [2018-02-04 02:57:10,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:10,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 35400 backedges. 6618 proven. 352 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-02-04 02:57:11,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:11,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:57:11,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2018-02-04 02:57:11,175 INFO L182 omatonBuilderFactory]: Interpolants [30380#true, 30381#false, 30382#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 30383#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 30384#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 30385#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 30386#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 30387#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 30388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 30389#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 30390#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 30391#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 30392#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 30393#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 30394#(<= |foo_#in~size| 11), 30395#(<= main_~i~1 11), 30396#(<= main_~i~1 12)] [2018-02-04 02:57:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 35400 backedges. 6618 proven. 352 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-02-04 02:57:11,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:57:11,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:57:11,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:57:11,176 INFO L87 Difference]: Start difference. First operand 325 states and 433 transitions. Second operand 17 states. [2018-02-04 02:57:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:11,377 INFO L93 Difference]: Finished difference Result 464 states and 679 transitions. [2018-02-04 02:57:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 02:57:11,377 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 829 [2018-02-04 02:57:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:11,379 INFO L225 Difference]: With dead ends: 464 [2018-02-04 02:57:11,379 INFO L226 Difference]: Without dead ends: 464 [2018-02-04 02:57:11,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:57:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-04 02:57:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 331. [2018-02-04 02:57:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-04 02:57:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 440 transitions. [2018-02-04 02:57:11,383 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 440 transitions. Word has length 829 [2018-02-04 02:57:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:11,383 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 440 transitions. [2018-02-04 02:57:11,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:57:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 440 transitions. [2018-02-04 02:57:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2018-02-04 02:57:11,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:11,387 INFO L351 BasicCegarLoop]: trace histogram [119, 102, 102, 102, 102, 102, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:11,387 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1810198058, now seen corresponding path program 50 times [2018-02-04 02:57:11,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:11,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 36040 backedges. 7190 proven. 420 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-02-04 02:57:12,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:12,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:57:12,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2018-02-04 02:57:12,197 INFO L182 omatonBuilderFactory]: Interpolants [31232#(<= main_~i~1 12), 31233#(<= main_~i~1 13), 31216#true, 31217#false, 31218#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 31219#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 31220#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 31221#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 31222#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 31223#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 31224#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 31225#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 31226#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 31227#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 31228#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 31229#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 31230#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 31231#(<= |foo_#in~size| 12)] [2018-02-04 02:57:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 36040 backedges. 7190 proven. 420 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-02-04 02:57:12,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:57:12,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:57:12,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:57:12,198 INFO L87 Difference]: Start difference. First operand 331 states and 440 transitions. Second operand 18 states. [2018-02-04 02:57:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:12,466 INFO L93 Difference]: Finished difference Result 473 states and 717 transitions. [2018-02-04 02:57:12,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:57:12,466 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 835 [2018-02-04 02:57:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:12,469 INFO L225 Difference]: With dead ends: 473 [2018-02-04 02:57:12,469 INFO L226 Difference]: Without dead ends: 473 [2018-02-04 02:57:12,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:57:12,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-04 02:57:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 337. [2018-02-04 02:57:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-02-04 02:57:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 447 transitions. [2018-02-04 02:57:12,474 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 447 transitions. Word has length 835 [2018-02-04 02:57:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:12,475 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 447 transitions. [2018-02-04 02:57:12,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:57:12,475 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 447 transitions. [2018-02-04 02:57:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2018-02-04 02:57:12,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:12,479 INFO L351 BasicCegarLoop]: trace histogram [120, 103, 103, 103, 103, 103, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:12,479 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1329144094, now seen corresponding path program 51 times [2018-02-04 02:57:12,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:12,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 36686 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 35836 trivial. 0 not checked. [2018-02-04 02:57:13,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:13,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:57:13,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3690 trivial. 0 not checked. [2018-02-04 02:57:13,322 INFO L182 omatonBuilderFactory]: Interpolants [32070#true, 32071#false, 32072#(= main_~i~1 0), 32073#(<= main_~i~1 1), 32074#(<= main_~i~1 2), 32075#(<= main_~i~1 3), 32076#(<= main_~i~1 4), 32077#(<= main_~i~1 5), 32078#(<= main_~i~1 6), 32079#(<= main_~i~1 7), 32080#(<= main_~i~1 8), 32081#(<= main_~i~1 9), 32082#(<= main_~i~1 10), 32083#(<= main_~i~1 11), 32084#(<= main_~i~1 12), 32085#(<= main_~i~1 13), 32086#(<= main_~i~1 14), 32087#(<= main_~i~1 15), 32088#(<= main_~i~1 16), 32089#(<= main_~i~1 17)] [2018-02-04 02:57:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 36686 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 35836 trivial. 0 not checked. [2018-02-04 02:57:13,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:57:13,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:57:13,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:57:13,324 INFO L87 Difference]: Start difference. First operand 337 states and 447 transitions. Second operand 20 states. [2018-02-04 02:57:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:13,510 INFO L93 Difference]: Finished difference Result 533 states and 697 transitions. [2018-02-04 02:57:13,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:57:13,510 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 841 [2018-02-04 02:57:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:13,512 INFO L225 Difference]: With dead ends: 533 [2018-02-04 02:57:13,512 INFO L226 Difference]: Without dead ends: 533 [2018-02-04 02:57:13,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:57:13,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-04 02:57:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 348. [2018-02-04 02:57:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-04 02:57:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2018-02-04 02:57:13,517 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 841 [2018-02-04 02:57:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:13,518 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2018-02-04 02:57:13,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:57:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2018-02-04 02:57:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2018-02-04 02:57:13,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:13,522 INFO L351 BasicCegarLoop]: trace histogram [128, 110, 110, 110, 110, 110, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:13,523 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:13,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1888354327, now seen corresponding path program 52 times [2018-02-04 02:57:13,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:13,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 41802 backedges. 5960 proven. 1125 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-04 02:57:14,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:14,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:57:14,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 544 proven. 62 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-04 02:57:14,360 INFO L182 omatonBuilderFactory]: Interpolants [32971#true, 32972#false, 32973#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 32974#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 32975#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 32976#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 32977#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 32978#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 32979#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 32980#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 32981#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 32982#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 32983#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 32984#(<= |foo_#in~size| 10), 32985#(<= main_~i~1 10), 32986#(<= main_~i~1 11), 32987#(<= main_~i~1 12)] [2018-02-04 02:57:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 41802 backedges. 5960 proven. 1125 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-04 02:57:14,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:57:14,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:57:14,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:57:14,362 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand 17 states. [2018-02-04 02:57:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:14,632 INFO L93 Difference]: Finished difference Result 572 states and 890 transitions. [2018-02-04 02:57:14,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:57:14,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 895 [2018-02-04 02:57:14,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:14,635 INFO L225 Difference]: With dead ends: 572 [2018-02-04 02:57:14,635 INFO L226 Difference]: Without dead ends: 572 [2018-02-04 02:57:14,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=513, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:57:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-02-04 02:57:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 348. [2018-02-04 02:57:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-04 02:57:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2018-02-04 02:57:14,643 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 895 [2018-02-04 02:57:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:14,644 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2018-02-04 02:57:14,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:57:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2018-02-04 02:57:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 902 [2018-02-04 02:57:14,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:14,652 INFO L351 BasicCegarLoop]: trace histogram [129, 111, 111, 111, 111, 111, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:14,652 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:14,652 INFO L82 PathProgramCache]: Analyzing trace with hash 904827743, now seen corresponding path program 53 times [2018-02-04 02:57:14,653 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:14,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 42498 backedges. 6514 proven. 1267 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-04 02:57:15,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:15,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:57:15,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4299 backedges. 544 proven. 68 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-04 02:57:15,564 INFO L182 omatonBuilderFactory]: Interpolants [33930#true, 33931#false, 33932#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 33933#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 33934#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 33935#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 33936#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 33937#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 33938#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 33939#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 33940#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 33941#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 33942#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 33943#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 33944#(<= |foo_#in~size| 11), 33945#(<= main_~i~1 11), 33946#(<= main_~i~1 12), 33947#(<= main_~i~1 13)] [2018-02-04 02:57:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 42498 backedges. 6514 proven. 1267 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-04 02:57:15,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:57:15,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:57:15,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:57:15,566 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand 18 states. [2018-02-04 02:57:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:15,848 INFO L93 Difference]: Finished difference Result 575 states and 937 transitions. [2018-02-04 02:57:15,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 02:57:15,849 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 901 [2018-02-04 02:57:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:15,853 INFO L225 Difference]: With dead ends: 575 [2018-02-04 02:57:15,853 INFO L226 Difference]: Without dead ends: 575 [2018-02-04 02:57:15,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=282, Invalid=588, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:57:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-04 02:57:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 348. [2018-02-04 02:57:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-04 02:57:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2018-02-04 02:57:15,863 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 901 [2018-02-04 02:57:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:15,863 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2018-02-04 02:57:15,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:57:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2018-02-04 02:57:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2018-02-04 02:57:15,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:15,869 INFO L351 BasicCegarLoop]: trace histogram [130, 112, 112, 112, 112, 112, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:15,869 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2011852633, now seen corresponding path program 54 times [2018-02-04 02:57:15,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:15,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 43200 backedges. 7068 proven. 1415 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-04 02:57:16,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:16,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:57:16,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4305 backedges. 544 proven. 74 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-04 02:57:16,813 INFO L182 omatonBuilderFactory]: Interpolants [34912#(<= main_~i~1 13), 34913#(<= main_~i~1 14), 34895#true, 34896#false, 34897#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 34898#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 34899#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 34900#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 34901#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 34902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 34903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 34904#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 34905#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 34906#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 34907#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 34908#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 34909#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 34910#(<= |foo_#in~size| 12), 34911#(<= main_~i~1 12)] [2018-02-04 02:57:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 43200 backedges. 7068 proven. 1415 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-04 02:57:16,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:57:16,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:57:16,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:57:16,814 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand 19 states. [2018-02-04 02:57:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:17,042 INFO L93 Difference]: Finished difference Result 579 states and 941 transitions. [2018-02-04 02:57:17,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:57:17,042 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 907 [2018-02-04 02:57:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:17,044 INFO L225 Difference]: With dead ends: 579 [2018-02-04 02:57:17,045 INFO L226 Difference]: Without dead ends: 579 [2018-02-04 02:57:17,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=324, Invalid=668, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:57:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-02-04 02:57:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 345. [2018-02-04 02:57:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-04 02:57:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 446 transitions. [2018-02-04 02:57:17,051 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 446 transitions. Word has length 907 [2018-02-04 02:57:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:17,051 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 446 transitions. [2018-02-04 02:57:17,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:57:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 446 transitions. [2018-02-04 02:57:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2018-02-04 02:57:17,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:17,056 INFO L351 BasicCegarLoop]: trace histogram [131, 113, 113, 113, 113, 113, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:17,056 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:17,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1895073809, now seen corresponding path program 55 times [2018-02-04 02:57:17,056 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:17,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 43908 backedges. 8597 proven. 494 refuted. 0 times theorem prover too weak. 34817 trivial. 0 not checked. [2018-02-04 02:57:17,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:17,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:57:17,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4314 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-04 02:57:17,976 INFO L182 omatonBuilderFactory]: Interpolants [35872#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 35873#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 35874#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 35875#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 35876#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 35877#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 35878#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 35879#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 35880#(<= |foo_#in~size| 13), 35881#(<= main_~i~1 13), 35882#(<= main_~i~1 14), 35864#true, 35865#false, 35866#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 35867#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 35868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 35869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 35870#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 35871#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-04 02:57:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 43908 backedges. 8597 proven. 494 refuted. 0 times theorem prover too weak. 34817 trivial. 0 not checked. [2018-02-04 02:57:17,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:57:17,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:57:17,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:57:17,977 INFO L87 Difference]: Start difference. First operand 345 states and 446 transitions. Second operand 19 states. [2018-02-04 02:57:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:18,186 INFO L93 Difference]: Finished difference Result 501 states and 791 transitions. [2018-02-04 02:57:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 02:57:18,186 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 913 [2018-02-04 02:57:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:18,189 INFO L225 Difference]: With dead ends: 501 [2018-02-04 02:57:18,189 INFO L226 Difference]: Without dead ends: 501 [2018-02-04 02:57:18,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:57:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-02-04 02:57:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 354. [2018-02-04 02:57:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 02:57:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2018-02-04 02:57:18,194 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 913 [2018-02-04 02:57:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:18,194 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2018-02-04 02:57:18,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:57:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2018-02-04 02:57:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2018-02-04 02:57:18,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:18,199 INFO L351 BasicCegarLoop]: trace histogram [132, 114, 114, 114, 114, 114, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:18,199 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1507938423, now seen corresponding path program 56 times [2018-02-04 02:57:18,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:18,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:57:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 44622 backedges. 2086 proven. 3787 refuted. 0 times theorem prover too weak. 38749 trivial. 0 not checked. [2018-02-04 02:57:19,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:19,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:57:19,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4311 backedges. 177 proven. 411 refuted. 0 times theorem prover too weak. 3723 trivial. 0 not checked. [2018-02-04 02:57:19,187 INFO L182 omatonBuilderFactory]: Interpolants [36768#(<= 0 main_~i~1), 36769#(<= 1 main_~i~1), 36770#(<= 2 main_~i~1), 36771#(<= 3 main_~i~1), 36772#(<= 4 main_~i~1), 36773#(<= 5 main_~i~1), 36774#(<= 6 main_~i~1), 36775#(<= 7 main_~i~1), 36776#(<= 8 main_~i~1), 36777#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 36778#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 36779#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 36780#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 36781#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 36782#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 36783#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 36784#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 36785#(<= |foo_#in~size| 7), 36766#true, 36767#false] [2018-02-04 02:57:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 44622 backedges. 2086 proven. 3787 refuted. 0 times theorem prover too weak. 38749 trivial. 0 not checked. [2018-02-04 02:57:19,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:57:19,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:57:19,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:57:19,188 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand 20 states. [2018-02-04 02:57:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:19,549 INFO L93 Difference]: Finished difference Result 394 states and 493 transitions. [2018-02-04 02:57:19,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 02:57:19,550 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 919 [2018-02-04 02:57:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:19,551 INFO L225 Difference]: With dead ends: 394 [2018-02-04 02:57:19,551 INFO L226 Difference]: Without dead ends: 394 [2018-02-04 02:57:19,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:57:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-02-04 02:57:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 354. [2018-02-04 02:57:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 02:57:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 461 transitions. [2018-02-04 02:57:19,556 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 461 transitions. Word has length 919 [2018-02-04 02:57:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:19,556 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 461 transitions. [2018-02-04 02:57:19,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:57:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 461 transitions. [2018-02-04 02:57:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2018-02-04 02:57:19,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:19,561 INFO L351 BasicCegarLoop]: trace histogram [138, 120, 120, 120, 120, 120, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:19,561 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:19,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1331307801, now seen corresponding path program 57 times [2018-02-04 02:57:19,562 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:19,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 49032 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 48078 trivial. 0 not checked. [2018-02-04 02:57:20,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:20,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:57:20,578 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4545 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4545 trivial. 0 not checked. [2018-02-04 02:57:20,578 INFO L182 omatonBuilderFactory]: Interpolants [37568#(<= main_~i~1 16), 37569#(<= main_~i~1 17), 37570#(<= main_~i~1 18), 37550#true, 37551#false, 37552#(= main_~i~1 0), 37553#(<= main_~i~1 1), 37554#(<= main_~i~1 2), 37555#(<= main_~i~1 3), 37556#(<= main_~i~1 4), 37557#(<= main_~i~1 5), 37558#(<= main_~i~1 6), 37559#(<= main_~i~1 7), 37560#(<= main_~i~1 8), 37561#(<= main_~i~1 9), 37562#(<= main_~i~1 10), 37563#(<= main_~i~1 11), 37564#(<= main_~i~1 12), 37565#(<= main_~i~1 13), 37566#(<= main_~i~1 14), 37567#(<= main_~i~1 15)] [2018-02-04 02:57:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 49032 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 48078 trivial. 0 not checked. [2018-02-04 02:57:20,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:57:20,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:57:20,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:57:20,579 INFO L87 Difference]: Start difference. First operand 354 states and 461 transitions. Second operand 21 states. [2018-02-04 02:57:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:20,734 INFO L93 Difference]: Finished difference Result 523 states and 649 transitions. [2018-02-04 02:57:20,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:57:20,734 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 955 [2018-02-04 02:57:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:20,736 INFO L225 Difference]: With dead ends: 523 [2018-02-04 02:57:20,736 INFO L226 Difference]: Without dead ends: 523 [2018-02-04 02:57:20,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:57:20,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-02-04 02:57:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 365. [2018-02-04 02:57:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-04 02:57:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-02-04 02:57:20,740 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 955 [2018-02-04 02:57:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:20,740 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-02-04 02:57:20,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:57:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-02-04 02:57:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2018-02-04 02:57:20,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:20,746 INFO L351 BasicCegarLoop]: trace histogram [147, 128, 128, 128, 128, 128, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:20,746 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1086056216, now seen corresponding path program 58 times [2018-02-04 02:57:20,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:20,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 55722 backedges. 5786 proven. 1806 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-04 02:57:21,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:21,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:57:21,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 574 proven. 112 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-04 02:57:21,774 INFO L182 omatonBuilderFactory]: Interpolants [38464#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 38465#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 38466#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 38467#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 38468#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 38469#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 38470#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 38471#(<= |foo_#in~size| 9), 38472#(<= main_~i~1 9), 38473#(<= main_~i~1 10), 38474#(<= main_~i~1 11), 38475#(<= main_~i~1 12), 38459#true, 38460#false, 38461#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 38462#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 38463#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 02:57:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 55722 backedges. 5786 proven. 1806 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-04 02:57:21,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:57:21,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:57:21,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:57:21,776 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 17 states. [2018-02-04 02:57:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:21,967 INFO L93 Difference]: Finished difference Result 684 states and 1059 transitions. [2018-02-04 02:57:21,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 02:57:21,967 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1015 [2018-02-04 02:57:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:21,971 INFO L225 Difference]: With dead ends: 684 [2018-02-04 02:57:21,971 INFO L226 Difference]: Without dead ends: 684 [2018-02-04 02:57:21,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:57:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-02-04 02:57:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 365. [2018-02-04 02:57:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-04 02:57:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-02-04 02:57:21,978 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 1015 [2018-02-04 02:57:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:21,979 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-02-04 02:57:21,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:57:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-02-04 02:57:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1022 [2018-02-04 02:57:21,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:21,984 INFO L351 BasicCegarLoop]: trace histogram [148, 129, 129, 129, 129, 129, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:21,984 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash -616958928, now seen corresponding path program 59 times [2018-02-04 02:57:21,985 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:22,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 56528 backedges. 6370 proven. 2028 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-04 02:57:23,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:23,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:57:23,066 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 574 proven. 124 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-04 02:57:23,066 INFO L182 omatonBuilderFactory]: Interpolants [39552#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 39553#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 39554#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 39555#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 39556#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 39557#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 39558#(<= |foo_#in~size| 10), 39559#(<= main_~i~1 10), 39560#(<= main_~i~1 11), 39561#(<= main_~i~1 12), 39562#(<= main_~i~1 13), 39545#true, 39546#false, 39547#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 39548#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 39549#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 39550#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 39551#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4))] [2018-02-04 02:57:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 56528 backedges. 6370 proven. 2028 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-04 02:57:23,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:57:23,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:57:23,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:57:23,068 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 18 states. [2018-02-04 02:57:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:23,263 INFO L93 Difference]: Finished difference Result 687 states and 1122 transitions. [2018-02-04 02:57:23,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 02:57:23,263 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1021 [2018-02-04 02:57:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:23,267 INFO L225 Difference]: With dead ends: 687 [2018-02-04 02:57:23,267 INFO L226 Difference]: Without dead ends: 687 [2018-02-04 02:57:23,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:57:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-02-04 02:57:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 365. [2018-02-04 02:57:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-04 02:57:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-02-04 02:57:23,276 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 1021 [2018-02-04 02:57:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:23,276 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-02-04 02:57:23,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:57:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-02-04 02:57:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2018-02-04 02:57:23,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:23,281 INFO L351 BasicCegarLoop]: trace histogram [149, 130, 130, 130, 130, 130, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:23,282 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:23,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1088436600, now seen corresponding path program 60 times [2018-02-04 02:57:23,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:23,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 57340 backedges. 6954 proven. 2256 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-04 02:57:24,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:24,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:57:24,423 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5280 backedges. 574 proven. 136 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-04 02:57:24,424 INFO L182 omatonBuilderFactory]: Interpolants [40640#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 40641#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 40642#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 40643#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 40644#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 40645#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 40646#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 40647#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 40648#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 40649#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 40650#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 40651#(<= |foo_#in~size| 11), 40652#(<= main_~i~1 11), 40653#(<= main_~i~1 12), 40654#(<= main_~i~1 13), 40655#(<= main_~i~1 14), 40637#true, 40638#false, 40639#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-04 02:57:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 57340 backedges. 6954 proven. 2256 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-04 02:57:24,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:57:24,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:57:24,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:57:24,425 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 19 states. [2018-02-04 02:57:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:24,648 INFO L93 Difference]: Finished difference Result 690 states and 1185 transitions. [2018-02-04 02:57:24,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:57:24,649 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1027 [2018-02-04 02:57:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:24,652 INFO L225 Difference]: With dead ends: 690 [2018-02-04 02:57:24,652 INFO L226 Difference]: Without dead ends: 690 [2018-02-04 02:57:24,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=287, Invalid=643, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:57:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-02-04 02:57:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 365. [2018-02-04 02:57:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-04 02:57:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-02-04 02:57:24,660 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 1027 [2018-02-04 02:57:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:24,660 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-02-04 02:57:24,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:57:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-02-04 02:57:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2018-02-04 02:57:24,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:24,665 INFO L351 BasicCegarLoop]: trace histogram [150, 131, 131, 131, 131, 131, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:24,665 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:24,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1086286016, now seen corresponding path program 61 times [2018-02-04 02:57:24,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:24,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 58158 backedges. 7538 proven. 2490 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-04 02:57:25,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:25,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:57:25,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5292 backedges. 574 proven. 148 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-04 02:57:25,832 INFO L182 omatonBuilderFactory]: Interpolants [41735#true, 41736#false, 41737#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 41738#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 41739#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 41740#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 41741#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 41742#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 41743#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 41744#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 41745#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 41746#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 41747#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 41748#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 41749#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 41750#(<= |foo_#in~size| 12), 41751#(<= main_~i~1 12), 41752#(<= main_~i~1 13), 41753#(<= main_~i~1 14), 41754#(<= main_~i~1 15)] [2018-02-04 02:57:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 58158 backedges. 7538 proven. 2490 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-04 02:57:25,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:57:25,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:57:25,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:57:25,834 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 20 states. [2018-02-04 02:57:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:26,095 INFO L93 Difference]: Finished difference Result 690 states and 1185 transitions. [2018-02-04 02:57:26,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 02:57:26,096 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1033 [2018-02-04 02:57:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:26,100 INFO L225 Difference]: With dead ends: 690 [2018-02-04 02:57:26,100 INFO L226 Difference]: Without dead ends: 690 [2018-02-04 02:57:26,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=329, Invalid=727, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:57:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-02-04 02:57:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 362. [2018-02-04 02:57:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-04 02:57:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 458 transitions. [2018-02-04 02:57:26,109 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 458 transitions. Word has length 1033 [2018-02-04 02:57:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:26,110 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 458 transitions. [2018-02-04 02:57:26,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:57:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 458 transitions. [2018-02-04 02:57:26,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2018-02-04 02:57:26,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:26,115 INFO L351 BasicCegarLoop]: trace histogram [151, 132, 132, 132, 132, 132, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:26,115 INFO L371 AbstractCegarLoop]: === Iteration 73 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:26,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1023409656, now seen corresponding path program 62 times [2018-02-04 02:57:26,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:26,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 58982 backedges. 9103 proven. 1649 refuted. 0 times theorem prover too weak. 48230 trivial. 0 not checked. [2018-02-04 02:57:27,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:27,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:57:27,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5307 backedges. 657 proven. 80 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-04 02:57:27,319 INFO L182 omatonBuilderFactory]: Interpolants [42848#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 42849#(<= |foo_#in~size| 13), 42850#(<= main_~i~1 13), 42851#(<= main_~i~1 14), 42852#(<= main_~i~1 15), 42833#true, 42834#false, 42835#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 42836#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 42837#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 42838#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 42839#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 42840#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 42841#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 42842#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 42843#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 42844#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 42845#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 42846#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 42847#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12))] [2018-02-04 02:57:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 58982 backedges. 9103 proven. 1649 refuted. 0 times theorem prover too weak. 48230 trivial. 0 not checked. [2018-02-04 02:57:27,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:57:27,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:57:27,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:57:27,321 INFO L87 Difference]: Start difference. First operand 362 states and 458 transitions. Second operand 20 states. [2018-02-04 02:57:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:27,541 INFO L93 Difference]: Finished difference Result 613 states and 1012 transitions. [2018-02-04 02:57:27,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:57:27,542 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1039 [2018-02-04 02:57:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:27,546 INFO L225 Difference]: With dead ends: 613 [2018-02-04 02:57:27,546 INFO L226 Difference]: Without dead ends: 613 [2018-02-04 02:57:27,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:57:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-02-04 02:57:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 362. [2018-02-04 02:57:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-04 02:57:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 458 transitions. [2018-02-04 02:57:27,555 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 458 transitions. Word has length 1039 [2018-02-04 02:57:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:27,556 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 458 transitions. [2018-02-04 02:57:27,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:57:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 458 transitions. [2018-02-04 02:57:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1046 [2018-02-04 02:57:27,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:27,561 INFO L351 BasicCegarLoop]: trace histogram [152, 133, 133, 133, 133, 133, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:27,561 INFO L371 AbstractCegarLoop]: === Iteration 74 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1458828144, now seen corresponding path program 63 times [2018-02-04 02:57:27,561 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:27,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 59812 backedges. 10902 proven. 574 refuted. 0 times theorem prover too weak. 48336 trivial. 0 not checked. [2018-02-04 02:57:28,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:28,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:57:28,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 743 proven. 0 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-04 02:57:28,768 INFO L182 omatonBuilderFactory]: Interpolants [43872#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 43873#(<= |foo_#in~size| 14), 43874#(<= main_~i~1 14), 43875#(<= main_~i~1 15), 43856#true, 43857#false, 43858#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 43859#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 43860#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 43861#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 43862#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 43863#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 43864#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 43865#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 43866#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 43867#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 43868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 43869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 43870#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 43871#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13))] [2018-02-04 02:57:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 59812 backedges. 10902 proven. 574 refuted. 0 times theorem prover too weak. 48336 trivial. 0 not checked. [2018-02-04 02:57:28,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:57:28,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:57:28,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:57:28,770 INFO L87 Difference]: Start difference. First operand 362 states and 458 transitions. Second operand 20 states. [2018-02-04 02:57:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:28,975 INFO L93 Difference]: Finished difference Result 529 states and 847 transitions. [2018-02-04 02:57:28,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:57:28,975 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1045 [2018-02-04 02:57:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:28,978 INFO L225 Difference]: With dead ends: 529 [2018-02-04 02:57:28,978 INFO L226 Difference]: Without dead ends: 529 [2018-02-04 02:57:28,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:57:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-04 02:57:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 371. [2018-02-04 02:57:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-02-04 02:57:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 484 transitions. [2018-02-04 02:57:28,985 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 484 transitions. Word has length 1045 [2018-02-04 02:57:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:28,985 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 484 transitions. [2018-02-04 02:57:28,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:57:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 484 transitions. [2018-02-04 02:57:28,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1052 [2018-02-04 02:57:28,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:28,991 INFO L351 BasicCegarLoop]: trace histogram [153, 134, 134, 134, 134, 134, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:28,991 INFO L371 AbstractCegarLoop]: === Iteration 75 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1391339608, now seen corresponding path program 64 times [2018-02-04 02:57:28,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:29,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 60648 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 59584 trivial. 0 not checked. [2018-02-04 02:57:30,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:30,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:57:30,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-02-04 02:57:30,237 INFO L182 omatonBuilderFactory]: Interpolants [44806#true, 44807#false, 44808#(= main_~i~1 0), 44809#(<= main_~i~1 1), 44810#(<= main_~i~1 2), 44811#(<= main_~i~1 3), 44812#(<= main_~i~1 4), 44813#(<= main_~i~1 5), 44814#(<= main_~i~1 6), 44815#(<= main_~i~1 7), 44816#(<= main_~i~1 8), 44817#(<= main_~i~1 9), 44818#(<= main_~i~1 10), 44819#(<= main_~i~1 11), 44820#(<= main_~i~1 12), 44821#(<= main_~i~1 13), 44822#(<= main_~i~1 14), 44823#(<= main_~i~1 15), 44824#(<= main_~i~1 16), 44825#(<= main_~i~1 17), 44826#(<= main_~i~1 18), 44827#(<= main_~i~1 19)] [2018-02-04 02:57:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 60648 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 59584 trivial. 0 not checked. [2018-02-04 02:57:30,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:57:30,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:57:30,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:57:30,239 INFO L87 Difference]: Start difference. First operand 371 states and 484 transitions. Second operand 22 states. [2018-02-04 02:57:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:30,432 INFO L93 Difference]: Finished difference Result 545 states and 676 transitions. [2018-02-04 02:57:30,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:57:30,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1051 [2018-02-04 02:57:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:30,434 INFO L225 Difference]: With dead ends: 545 [2018-02-04 02:57:30,435 INFO L226 Difference]: Without dead ends: 545 [2018-02-04 02:57:30,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:57:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-02-04 02:57:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 382. [2018-02-04 02:57:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 02:57:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2018-02-04 02:57:30,440 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 1051 [2018-02-04 02:57:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:30,441 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2018-02-04 02:57:30,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:57:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2018-02-04 02:57:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2018-02-04 02:57:30,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:30,447 INFO L351 BasicCegarLoop]: trace histogram [162, 142, 142, 142, 142, 142, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:30,447 INFO L371 AbstractCegarLoop]: === Iteration 76 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:30,447 INFO L82 PathProgramCache]: Analyzing trace with hash 131832409, now seen corresponding path program 65 times [2018-02-04 02:57:30,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:30,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 68066 backedges. 5302 proven. 2377 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-04 02:57:31,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:31,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:57:31,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 598 proven. 150 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-04 02:57:31,662 INFO L182 omatonBuilderFactory]: Interpolants [45760#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 45761#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 45762#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 45763#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 45764#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 45765#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 45766#(<= |foo_#in~size| 8), 45767#(<= main_~i~1 8), 45768#(<= main_~i~1 9), 45769#(<= main_~i~1 10), 45770#(<= main_~i~1 11), 45771#(<= main_~i~1 12), 45755#true, 45756#false, 45757#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 45758#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 45759#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 02:57:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 68066 backedges. 5302 proven. 2377 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-04 02:57:31,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:57:31,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:57:31,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:57:31,664 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand 17 states. [2018-02-04 02:57:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:31,852 INFO L93 Difference]: Finished difference Result 796 states and 1255 transitions. [2018-02-04 02:57:31,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:57:31,852 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1111 [2018-02-04 02:57:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:31,858 INFO L225 Difference]: With dead ends: 796 [2018-02-04 02:57:31,858 INFO L226 Difference]: Without dead ends: 796 [2018-02-04 02:57:31,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:57:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-02-04 02:57:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 385. [2018-02-04 02:57:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-04 02:57:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-02-04 02:57:31,874 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1111 [2018-02-04 02:57:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:31,875 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-02-04 02:57:31,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:57:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-02-04 02:57:31,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2018-02-04 02:57:31,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:31,884 INFO L351 BasicCegarLoop]: trace histogram [163, 143, 143, 143, 143, 143, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:31,885 INFO L371 AbstractCegarLoop]: === Iteration 77 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:31,885 INFO L82 PathProgramCache]: Analyzing trace with hash 215225761, now seen corresponding path program 66 times [2018-02-04 02:57:31,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:31,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 68958 backedges. 5886 proven. 2685 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-04 02:57:33,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:33,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:57:33,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 574 proven. 168 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-04 02:57:33,156 INFO L182 omatonBuilderFactory]: Interpolants [46976#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 46977#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 46978#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 46979#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 46980#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 46981#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 46982#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 46983#(<= |foo_#in~size| 9), 46984#(<= main_~i~1 9), 46985#(<= main_~i~1 10), 46986#(<= main_~i~1 11), 46987#(<= main_~i~1 12), 46988#(<= main_~i~1 13), 46971#true, 46972#false, 46973#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 46974#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 46975#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 02:57:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 68958 backedges. 5886 proven. 2685 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-04 02:57:33,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:57:33,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:57:33,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:57:33,158 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand 18 states. [2018-02-04 02:57:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:33,368 INFO L93 Difference]: Finished difference Result 799 states and 1334 transitions. [2018-02-04 02:57:33,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:57:33,369 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1117 [2018-02-04 02:57:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:33,372 INFO L225 Difference]: With dead ends: 799 [2018-02-04 02:57:33,372 INFO L226 Difference]: Without dead ends: 799 [2018-02-04 02:57:33,372 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:57:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-02-04 02:57:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 385. [2018-02-04 02:57:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-04 02:57:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-02-04 02:57:33,381 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1117 [2018-02-04 02:57:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:33,381 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-02-04 02:57:33,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:57:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-02-04 02:57:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1124 [2018-02-04 02:57:33,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:33,387 INFO L351 BasicCegarLoop]: trace histogram [164, 144, 144, 144, 144, 144, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:33,387 INFO L371 AbstractCegarLoop]: === Iteration 78 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash -150668567, now seen corresponding path program 67 times [2018-02-04 02:57:33,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:33,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 69856 backedges. 6470 proven. 2999 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-04 02:57:34,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:34,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:57:34,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6087 backedges. 574 proven. 186 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-04 02:57:34,671 INFO L182 omatonBuilderFactory]: Interpolants [48193#true, 48194#false, 48195#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 48196#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 48197#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 48198#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 48199#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 48200#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 48201#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 48202#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 48203#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 48204#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 48205#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 48206#(<= |foo_#in~size| 10), 48207#(<= main_~i~1 10), 48208#(<= main_~i~1 11), 48209#(<= main_~i~1 12), 48210#(<= main_~i~1 13), 48211#(<= main_~i~1 14)] [2018-02-04 02:57:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 69856 backedges. 6470 proven. 2999 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-04 02:57:34,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:57:34,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:57:34,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:57:34,673 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand 19 states. [2018-02-04 02:57:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:34,951 INFO L93 Difference]: Finished difference Result 802 states and 1413 transitions. [2018-02-04 02:57:34,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 02:57:34,951 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1123 [2018-02-04 02:57:34,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:34,955 INFO L225 Difference]: With dead ends: 802 [2018-02-04 02:57:34,955 INFO L226 Difference]: Without dead ends: 802 [2018-02-04 02:57:34,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:57:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-02-04 02:57:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 385. [2018-02-04 02:57:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-04 02:57:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-02-04 02:57:34,966 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1123 [2018-02-04 02:57:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:34,966 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-02-04 02:57:34,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:57:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-02-04 02:57:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1130 [2018-02-04 02:57:34,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:34,972 INFO L351 BasicCegarLoop]: trace histogram [165, 145, 145, 145, 145, 145, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:34,972 INFO L371 AbstractCegarLoop]: === Iteration 79 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:34,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1358350897, now seen corresponding path program 68 times [2018-02-04 02:57:34,973 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:35,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 70760 backedges. 7054 proven. 3319 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-04 02:57:36,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:36,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:57:36,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 574 proven. 204 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-04 02:57:36,388 INFO L182 omatonBuilderFactory]: Interpolants [49440#(<= main_~i~1 15), 49421#true, 49422#false, 49423#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 49424#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 49425#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 49426#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 49427#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 49428#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 49429#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 49430#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 49431#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 49432#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 49433#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 49434#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 49435#(<= |foo_#in~size| 11), 49436#(<= main_~i~1 11), 49437#(<= main_~i~1 12), 49438#(<= main_~i~1 13), 49439#(<= main_~i~1 14)] [2018-02-04 02:57:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 70760 backedges. 7054 proven. 3319 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-04 02:57:36,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:57:36,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:57:36,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:57:36,390 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand 20 states. [2018-02-04 02:57:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:36,670 INFO L93 Difference]: Finished difference Result 805 states and 1492 transitions. [2018-02-04 02:57:36,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:57:36,670 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1129 [2018-02-04 02:57:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:36,675 INFO L225 Difference]: With dead ends: 805 [2018-02-04 02:57:36,675 INFO L226 Difference]: Without dead ends: 805 [2018-02-04 02:57:36,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:57:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-02-04 02:57:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 385. [2018-02-04 02:57:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-04 02:57:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-02-04 02:57:36,685 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1129 [2018-02-04 02:57:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:36,685 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-02-04 02:57:36,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:57:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-02-04 02:57:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1136 [2018-02-04 02:57:36,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:36,691 INFO L351 BasicCegarLoop]: trace histogram [166, 146, 146, 146, 146, 146, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:36,691 INFO L371 AbstractCegarLoop]: === Iteration 80 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:36,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1127087239, now seen corresponding path program 69 times [2018-02-04 02:57:36,692 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:36,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 71670 backedges. 7638 proven. 3645 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-04 02:57:38,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:38,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:57:38,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 574 proven. 222 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-04 02:57:38,127 INFO L182 omatonBuilderFactory]: Interpolants [50656#false, 50657#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 50658#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 50659#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 50660#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 50661#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 50662#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 50663#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 50664#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 50665#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 50666#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 50667#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 50668#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 50669#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 50670#(<= |foo_#in~size| 12), 50671#(<= main_~i~1 12), 50672#(<= main_~i~1 13), 50673#(<= main_~i~1 14), 50674#(<= main_~i~1 15), 50675#(<= main_~i~1 16), 50655#true] [2018-02-04 02:57:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 71670 backedges. 7638 proven. 3645 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-04 02:57:38,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:57:38,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:57:38,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:57:38,128 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand 21 states. [2018-02-04 02:57:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:38,403 INFO L93 Difference]: Finished difference Result 805 states and 1492 transitions. [2018-02-04 02:57:38,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:57:38,403 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1135 [2018-02-04 02:57:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:38,407 INFO L225 Difference]: With dead ends: 805 [2018-02-04 02:57:38,407 INFO L226 Difference]: Without dead ends: 805 [2018-02-04 02:57:38,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=787, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:57:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-02-04 02:57:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 382. [2018-02-04 02:57:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 02:57:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2018-02-04 02:57:38,422 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 1135 [2018-02-04 02:57:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:38,423 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2018-02-04 02:57:38,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:57:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2018-02-04 02:57:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2018-02-04 02:57:38,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:38,432 INFO L351 BasicCegarLoop]: trace histogram [167, 147, 147, 147, 147, 147, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:38,432 INFO L371 AbstractCegarLoop]: === Iteration 81 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:38,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1134614847, now seen corresponding path program 70 times [2018-02-04 02:57:38,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:38,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 72586 backedges. 9209 proven. 2890 refuted. 0 times theorem prover too weak. 60487 trivial. 0 not checked. [2018-02-04 02:57:39,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:39,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:57:39,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6144 backedges. 657 proven. 160 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-04 02:57:39,887 INFO L182 omatonBuilderFactory]: Interpolants [51904#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 51905#(<= |foo_#in~size| 13), 51906#(<= main_~i~1 13), 51907#(<= main_~i~1 14), 51908#(<= main_~i~1 15), 51909#(<= main_~i~1 16), 51889#true, 51890#false, 51891#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 51892#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 51893#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 51894#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 51895#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 51896#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 51897#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 51898#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 51899#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 51900#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 51901#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 51902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 51903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12))] [2018-02-04 02:57:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 72586 backedges. 9209 proven. 2890 refuted. 0 times theorem prover too weak. 60487 trivial. 0 not checked. [2018-02-04 02:57:39,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:57:39,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:57:39,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:57:39,889 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand 21 states. [2018-02-04 02:57:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:40,114 INFO L93 Difference]: Finished difference Result 730 states and 1319 transitions. [2018-02-04 02:57:40,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:57:40,115 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1141 [2018-02-04 02:57:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:40,118 INFO L225 Difference]: With dead ends: 730 [2018-02-04 02:57:40,118 INFO L226 Difference]: Without dead ends: 730 [2018-02-04 02:57:40,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=374, Invalid=816, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:57:40,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-02-04 02:57:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 382. [2018-02-04 02:57:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 02:57:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2018-02-04 02:57:40,129 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 1141 [2018-02-04 02:57:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:40,129 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2018-02-04 02:57:40,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:57:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2018-02-04 02:57:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2018-02-04 02:57:40,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:40,135 INFO L351 BasicCegarLoop]: trace histogram [168, 148, 148, 148, 148, 148, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:40,136 INFO L371 AbstractCegarLoop]: === Iteration 82 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:40,136 INFO L82 PathProgramCache]: Analyzing trace with hash 674155337, now seen corresponding path program 71 times [2018-02-04 02:57:40,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:40,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 73508 backedges. 11014 proven. 1901 refuted. 0 times theorem prover too weak. 60593 trivial. 0 not checked. [2018-02-04 02:57:41,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:41,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:57:41,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6156 backedges. 743 proven. 86 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-04 02:57:41,646 INFO L182 omatonBuilderFactory]: Interpolants [53056#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 53057#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 53058#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 53059#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 53060#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 53061#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 53062#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 53063#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 53064#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 53065#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 53066#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 53067#(<= |foo_#in~size| 14), 53068#(<= main_~i~1 14), 53069#(<= main_~i~1 15), 53070#(<= main_~i~1 16), 53050#true, 53051#false, 53052#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 53053#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 53054#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 53055#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3))] [2018-02-04 02:57:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 73508 backedges. 11014 proven. 1901 refuted. 0 times theorem prover too weak. 60593 trivial. 0 not checked. [2018-02-04 02:57:41,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:57:41,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:57:41,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:57:41,648 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand 21 states. [2018-02-04 02:57:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:41,922 INFO L93 Difference]: Finished difference Result 647 states and 1119 transitions. [2018-02-04 02:57:41,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 02:57:41,922 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1147 [2018-02-04 02:57:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:41,924 INFO L225 Difference]: With dead ends: 647 [2018-02-04 02:57:41,925 INFO L226 Difference]: Without dead ends: 647 [2018-02-04 02:57:41,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=417, Invalid=843, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:57:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-02-04 02:57:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 382. [2018-02-04 02:57:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 02:57:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2018-02-04 02:57:41,936 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 1147 [2018-02-04 02:57:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:41,937 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2018-02-04 02:57:41,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:57:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2018-02-04 02:57:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1154 [2018-02-04 02:57:41,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:41,945 INFO L351 BasicCegarLoop]: trace histogram [169, 149, 149, 149, 149, 149, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:41,945 INFO L371 AbstractCegarLoop]: === Iteration 83 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:41,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1101819631, now seen corresponding path program 72 times [2018-02-04 02:57:41,945 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:41,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 74436 backedges. 13071 proven. 660 refuted. 0 times theorem prover too weak. 60705 trivial. 0 not checked. [2018-02-04 02:57:43,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:43,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:57:43,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 835 proven. 0 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-04 02:57:43,415 INFO L182 omatonBuilderFactory]: Interpolants [54144#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 54145#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 54146#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 54147#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 54148#(<= |foo_#in~size| 15), 54149#(<= main_~i~1 15), 54150#(<= main_~i~1 16), 54130#true, 54131#false, 54132#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 54133#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 54134#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 54135#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 54136#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 54137#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 54138#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 54139#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 54140#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 54141#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 54142#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 54143#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11))] [2018-02-04 02:57:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 74436 backedges. 13071 proven. 660 refuted. 0 times theorem prover too weak. 60705 trivial. 0 not checked. [2018-02-04 02:57:43,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:57:43,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:57:43,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:57:43,417 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand 21 states. [2018-02-04 02:57:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:43,637 INFO L93 Difference]: Finished difference Result 557 states and 927 transitions. [2018-02-04 02:57:43,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 02:57:43,637 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1153 [2018-02-04 02:57:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:43,640 INFO L225 Difference]: With dead ends: 557 [2018-02-04 02:57:43,640 INFO L226 Difference]: Without dead ends: 557 [2018-02-04 02:57:43,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:57:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-04 02:57:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 391. [2018-02-04 02:57:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-04 02:57:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 527 transitions. [2018-02-04 02:57:43,647 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 527 transitions. Word has length 1153 [2018-02-04 02:57:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:43,648 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 527 transitions. [2018-02-04 02:57:43,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:57:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 527 transitions. [2018-02-04 02:57:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1160 [2018-02-04 02:57:43,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:43,654 INFO L351 BasicCegarLoop]: trace histogram [170, 150, 150, 150, 150, 150, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:43,655 INFO L371 AbstractCegarLoop]: === Iteration 84 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:43,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1971750937, now seen corresponding path program 73 times [2018-02-04 02:57:43,655 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:43,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 75370 backedges. 2859 proven. 5694 refuted. 0 times theorem prover too weak. 66817 trivial. 0 not checked. [2018-02-04 02:57:45,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:45,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:57:45,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6159 backedges. 227 proven. 518 refuted. 0 times theorem prover too weak. 5414 trivial. 0 not checked. [2018-02-04 02:57:45,250 INFO L182 omatonBuilderFactory]: Interpolants [55136#(<= 3 main_~i~1), 55137#(<= 4 main_~i~1), 55138#(<= 5 main_~i~1), 55139#(<= 6 main_~i~1), 55140#(<= 7 main_~i~1), 55141#(<= 8 main_~i~1), 55142#(<= 9 main_~i~1), 55143#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 55144#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 55145#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 55146#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 55147#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 55148#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 55149#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 55150#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 55151#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 55152#(<= |foo_#in~size| 8), 55131#true, 55132#false, 55133#(<= 0 main_~i~1), 55134#(<= 1 main_~i~1), 55135#(<= 2 main_~i~1)] [2018-02-04 02:57:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 75370 backedges. 2859 proven. 5694 refuted. 0 times theorem prover too weak. 66817 trivial. 0 not checked. [2018-02-04 02:57:45,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:57:45,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:57:45,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:57:45,251 INFO L87 Difference]: Start difference. First operand 391 states and 527 transitions. Second operand 22 states. [2018-02-04 02:57:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:45,683 INFO L93 Difference]: Finished difference Result 439 states and 572 transitions. [2018-02-04 02:57:45,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 02:57:45,684 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1159 [2018-02-04 02:57:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:45,685 INFO L225 Difference]: With dead ends: 439 [2018-02-04 02:57:45,685 INFO L226 Difference]: Without dead ends: 439 [2018-02-04 02:57:45,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:57:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-04 02:57:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 394. [2018-02-04 02:57:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-02-04 02:57:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 536 transitions. [2018-02-04 02:57:45,689 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 536 transitions. Word has length 1159 [2018-02-04 02:57:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:45,689 INFO L432 AbstractCegarLoop]: Abstraction has 394 states and 536 transitions. [2018-02-04 02:57:45,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:57:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 536 transitions. [2018-02-04 02:57:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1202 [2018-02-04 02:57:45,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:45,696 INFO L351 BasicCegarLoop]: trace histogram [177, 157, 157, 157, 157, 157, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:45,696 INFO L371 AbstractCegarLoop]: === Iteration 85 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1076968977, now seen corresponding path program 74 times [2018-02-04 02:57:45,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:45,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:57:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 82076 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 80896 trivial. 0 not checked. [2018-02-04 02:57:47,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:47,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:57:47,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6432 trivial. 0 not checked. [2018-02-04 02:57:47,346 INFO L182 omatonBuilderFactory]: Interpolants [56004#true, 56005#false, 56006#(= main_~i~1 0), 56007#(<= main_~i~1 1), 56008#(<= main_~i~1 2), 56009#(<= main_~i~1 3), 56010#(<= main_~i~1 4), 56011#(<= main_~i~1 5), 56012#(<= main_~i~1 6), 56013#(<= main_~i~1 7), 56014#(<= main_~i~1 8), 56015#(<= main_~i~1 9), 56016#(<= main_~i~1 10), 56017#(<= main_~i~1 11), 56018#(<= main_~i~1 12), 56019#(<= main_~i~1 13), 56020#(<= main_~i~1 14), 56021#(<= main_~i~1 15), 56022#(<= main_~i~1 16), 56023#(<= main_~i~1 17), 56024#(<= main_~i~1 18), 56025#(<= main_~i~1 19), 56026#(<= main_~i~1 20)] [2018-02-04 02:57:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 82076 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 80896 trivial. 0 not checked. [2018-02-04 02:57:47,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:57:47,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:57:47,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:57:47,348 INFO L87 Difference]: Start difference. First operand 394 states and 536 transitions. Second operand 23 states. [2018-02-04 02:57:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:47,524 INFO L93 Difference]: Finished difference Result 605 states and 798 transitions. [2018-02-04 02:57:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:57:47,524 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1201 [2018-02-04 02:57:47,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:47,526 INFO L225 Difference]: With dead ends: 605 [2018-02-04 02:57:47,526 INFO L226 Difference]: Without dead ends: 605 [2018-02-04 02:57:47,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:57:47,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-04 02:57:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 405. [2018-02-04 02:57:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-04 02:57:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2018-02-04 02:57:47,531 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 1201 [2018-02-04 02:57:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:47,531 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2018-02-04 02:57:47,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:57:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2018-02-04 02:57:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1268 [2018-02-04 02:57:47,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:47,539 INFO L351 BasicCegarLoop]: trace histogram [187, 166, 166, 166, 166, 166, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:47,539 INFO L371 AbstractCegarLoop]: === Iteration 86 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1431634982, now seen corresponding path program 75 times [2018-02-04 02:57:47,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:47,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 91704 backedges. 6378 proven. 3626 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-02-04 02:57:49,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:49,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:57:49,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7311 backedges. 637 proven. 224 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-02-04 02:57:49,171 INFO L182 omatonBuilderFactory]: Interpolants [57037#true, 57038#false, 57039#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 57040#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 57041#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 57042#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 57043#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 57044#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 57045#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 57046#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 57047#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 57048#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 57049#(<= |foo_#in~size| 9), 57050#(<= main_~i~1 9), 57051#(<= main_~i~1 10), 57052#(<= main_~i~1 11), 57053#(<= main_~i~1 12), 57054#(<= main_~i~1 13), 57055#(<= main_~i~1 14)] [2018-02-04 02:57:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 91704 backedges. 6378 proven. 3626 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-02-04 02:57:49,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:57:49,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:57:49,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:57:49,174 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand 19 states. [2018-02-04 02:57:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:49,410 INFO L93 Difference]: Finished difference Result 914 states and 1573 transitions. [2018-02-04 02:57:49,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 02:57:49,410 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1267 [2018-02-04 02:57:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:49,414 INFO L225 Difference]: With dead ends: 914 [2018-02-04 02:57:49,414 INFO L226 Difference]: Without dead ends: 914 [2018-02-04 02:57:49,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:57:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-02-04 02:57:49,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 408. [2018-02-04 02:57:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 02:57:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 574 transitions. [2018-02-04 02:57:49,425 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 574 transitions. Word has length 1267 [2018-02-04 02:57:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:49,425 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 574 transitions. [2018-02-04 02:57:49,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:57:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 574 transitions. [2018-02-04 02:57:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1274 [2018-02-04 02:57:49,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:49,433 INFO L351 BasicCegarLoop]: trace histogram [188, 167, 167, 167, 167, 167, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:49,433 INFO L371 AbstractCegarLoop]: === Iteration 87 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash 252508962, now seen corresponding path program 76 times [2018-02-04 02:57:49,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:49,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 92742 backedges. 7004 proven. 4038 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-02-04 02:57:51,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:51,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:57:51,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7314 backedges. 616 proven. 248 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-02-04 02:57:51,098 INFO L182 omatonBuilderFactory]: Interpolants [58400#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 58401#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 58402#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 58403#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 58404#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 58405#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 58406#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 58407#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 58408#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 58409#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 58410#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 58411#(<= |foo_#in~size| 10), 58412#(<= main_~i~1 10), 58413#(<= main_~i~1 11), 58414#(<= main_~i~1 12), 58415#(<= main_~i~1 13), 58416#(<= main_~i~1 14), 58417#(<= main_~i~1 15), 58398#true, 58399#false] [2018-02-04 02:57:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 92742 backedges. 7004 proven. 4038 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-02-04 02:57:51,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:57:51,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:57:51,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:57:51,101 INFO L87 Difference]: Start difference. First operand 408 states and 574 transitions. Second operand 20 states. [2018-02-04 02:57:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:51,354 INFO L93 Difference]: Finished difference Result 917 states and 1668 transitions. [2018-02-04 02:57:51,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:57:51,354 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1273 [2018-02-04 02:57:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:51,359 INFO L225 Difference]: With dead ends: 917 [2018-02-04 02:57:51,359 INFO L226 Difference]: Without dead ends: 917 [2018-02-04 02:57:51,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:57:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-02-04 02:57:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 408. [2018-02-04 02:57:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 02:57:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 574 transitions. [2018-02-04 02:57:51,372 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 574 transitions. Word has length 1273 [2018-02-04 02:57:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:51,373 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 574 transitions. [2018-02-04 02:57:51,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:57:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 574 transitions. [2018-02-04 02:57:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1280 [2018-02-04 02:57:51,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:51,380 INFO L351 BasicCegarLoop]: trace histogram [189, 168, 168, 168, 168, 168, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:51,380 INFO L371 AbstractCegarLoop]: === Iteration 88 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:51,380 INFO L82 PathProgramCache]: Analyzing trace with hash 477389930, now seen corresponding path program 77 times [2018-02-04 02:57:51,381 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:51,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:53,210 INFO L134 CoverageAnalysis]: Checked inductivity of 93786 backedges. 7630 proven. 4456 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-02-04 02:57:53,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:53,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:57:53,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 616 proven. 272 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-02-04 02:57:53,211 INFO L182 omatonBuilderFactory]: Interpolants [59776#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 59777#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 59778#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 59779#(<= |foo_#in~size| 11), 59780#(<= main_~i~1 11), 59781#(<= main_~i~1 12), 59782#(<= main_~i~1 13), 59783#(<= main_~i~1 14), 59784#(<= main_~i~1 15), 59785#(<= main_~i~1 16), 59765#true, 59766#false, 59767#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 59768#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 59769#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 59770#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 59771#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 59772#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 59773#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 59774#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 59775#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8))] [2018-02-04 02:57:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 93786 backedges. 7630 proven. 4456 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-02-04 02:57:53,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:57:53,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:57:53,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:57:53,214 INFO L87 Difference]: Start difference. First operand 408 states and 574 transitions. Second operand 21 states. [2018-02-04 02:57:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:53,463 INFO L93 Difference]: Finished difference Result 920 states and 1763 transitions. [2018-02-04 02:57:53,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 02:57:53,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1279 [2018-02-04 02:57:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:53,468 INFO L225 Difference]: With dead ends: 920 [2018-02-04 02:57:53,468 INFO L226 Difference]: Without dead ends: 920 [2018-02-04 02:57:53,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:57:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-02-04 02:57:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 408. [2018-02-04 02:57:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 02:57:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 574 transitions. [2018-02-04 02:57:53,482 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 574 transitions. Word has length 1279 [2018-02-04 02:57:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:53,483 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 574 transitions. [2018-02-04 02:57:53,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:57:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 574 transitions. [2018-02-04 02:57:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1286 [2018-02-04 02:57:53,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:53,494 INFO L351 BasicCegarLoop]: trace histogram [190, 169, 169, 169, 169, 169, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:53,495 INFO L371 AbstractCegarLoop]: === Iteration 89 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1884702798, now seen corresponding path program 78 times [2018-02-04 02:57:53,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:53,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 94836 backedges. 8256 proven. 4880 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-02-04 02:57:55,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:55,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:57:55,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7362 backedges. 616 proven. 296 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-02-04 02:57:55,361 INFO L182 omatonBuilderFactory]: Interpolants [61152#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 61153#(<= |foo_#in~size| 12), 61154#(<= main_~i~1 12), 61155#(<= main_~i~1 13), 61156#(<= main_~i~1 14), 61157#(<= main_~i~1 15), 61158#(<= main_~i~1 16), 61159#(<= main_~i~1 17), 61138#true, 61139#false, 61140#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 61141#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 61142#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 61143#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 61144#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 61145#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 61146#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 61147#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 61148#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 61149#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 61150#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 61151#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11))] [2018-02-04 02:57:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 94836 backedges. 8256 proven. 4880 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-02-04 02:57:55,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:57:55,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:57:55,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:57:55,363 INFO L87 Difference]: Start difference. First operand 408 states and 574 transitions. Second operand 22 states. [2018-02-04 02:57:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:55,612 INFO L93 Difference]: Finished difference Result 920 states and 1763 transitions. [2018-02-04 02:57:55,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:57:55,612 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1285 [2018-02-04 02:57:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:55,617 INFO L225 Difference]: With dead ends: 920 [2018-02-04 02:57:55,617 INFO L226 Difference]: Without dead ends: 920 [2018-02-04 02:57:55,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=342, Invalid=848, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:57:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-02-04 02:57:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 405. [2018-02-04 02:57:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-04 02:57:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2018-02-04 02:57:55,631 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 1285 [2018-02-04 02:57:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:55,631 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2018-02-04 02:57:55,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:57:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2018-02-04 02:57:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1292 [2018-02-04 02:57:55,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:55,639 INFO L351 BasicCegarLoop]: trace histogram [191, 170, 170, 170, 170, 170, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:55,639 INFO L371 AbstractCegarLoop]: === Iteration 90 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1927973638, now seen corresponding path program 79 times [2018-02-04 02:57:55,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:55,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 95892 backedges. 9875 proven. 4217 refuted. 0 times theorem prover too weak. 81800 trivial. 0 not checked. [2018-02-04 02:57:57,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:57,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:57:57,554 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7389 backedges. 699 proven. 240 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-02-04 02:57:57,555 INFO L182 omatonBuilderFactory]: Interpolants [62528#(<= main_~i~1 13), 62529#(<= main_~i~1 14), 62530#(<= main_~i~1 15), 62531#(<= main_~i~1 16), 62532#(<= main_~i~1 17), 62511#true, 62512#false, 62513#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 62514#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 62515#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 62516#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 62517#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 62518#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 62519#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 62520#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 62521#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 62522#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 62523#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 62524#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 62525#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 62526#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 62527#(<= |foo_#in~size| 13)] [2018-02-04 02:57:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 95892 backedges. 9875 proven. 4217 refuted. 0 times theorem prover too weak. 81800 trivial. 0 not checked. [2018-02-04 02:57:57,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:57:57,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:57:57,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:57:57,557 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand 22 states. [2018-02-04 02:57:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:57:57,863 INFO L93 Difference]: Finished difference Result 851 states and 1604 transitions. [2018-02-04 02:57:57,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 02:57:57,863 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1291 [2018-02-04 02:57:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:57:57,867 INFO L225 Difference]: With dead ends: 851 [2018-02-04 02:57:57,867 INFO L226 Difference]: Without dead ends: 851 [2018-02-04 02:57:57,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=380, Invalid=880, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:57:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-02-04 02:57:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 405. [2018-02-04 02:57:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-04 02:57:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2018-02-04 02:57:57,877 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 1291 [2018-02-04 02:57:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:57:57,878 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2018-02-04 02:57:57,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:57:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2018-02-04 02:57:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2018-02-04 02:57:57,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:57:57,885 INFO L351 BasicCegarLoop]: trace histogram [192, 171, 171, 171, 171, 171, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:57:57,885 INFO L371 AbstractCegarLoop]: === Iteration 91 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:57:57,885 INFO L82 PathProgramCache]: Analyzing trace with hash 406344578, now seen corresponding path program 80 times [2018-02-04 02:57:57,886 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:57:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:57:57,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:57:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 96954 backedges. 11728 proven. 3320 refuted. 0 times theorem prover too weak. 81906 trivial. 0 not checked. [2018-02-04 02:57:59,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:57:59,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:57:59,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:57:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7407 backedges. 785 proven. 172 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-02-04 02:57:59,810 INFO L182 omatonBuilderFactory]: Interpolants [63817#true, 63818#false, 63819#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 63820#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 63821#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 63822#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 63823#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 63824#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 63825#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 63826#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 63827#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 63828#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 63829#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 63830#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 63831#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 63832#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 63833#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 63834#(<= |foo_#in~size| 14), 63835#(<= main_~i~1 14), 63836#(<= main_~i~1 15), 63837#(<= main_~i~1 16), 63838#(<= main_~i~1 17)] [2018-02-04 02:57:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 96954 backedges. 11728 proven. 3320 refuted. 0 times theorem prover too weak. 81906 trivial. 0 not checked. [2018-02-04 02:57:59,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:57:59,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:57:59,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:57:59,812 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand 22 states. [2018-02-04 02:58:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:00,112 INFO L93 Difference]: Finished difference Result 770 states and 1414 transitions. [2018-02-04 02:58:00,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 02:58:00,112 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1297 [2018-02-04 02:58:00,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:00,115 INFO L225 Difference]: With dead ends: 770 [2018-02-04 02:58:00,115 INFO L226 Difference]: Without dead ends: 770 [2018-02-04 02:58:00,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=422, Invalid=910, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:58:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-02-04 02:58:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 405. [2018-02-04 02:58:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-04 02:58:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2018-02-04 02:58:00,124 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 1297 [2018-02-04 02:58:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:00,125 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2018-02-04 02:58:00,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:58:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2018-02-04 02:58:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1304 [2018-02-04 02:58:00,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:00,137 INFO L351 BasicCegarLoop]: trace histogram [193, 172, 172, 172, 172, 172, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:00,137 INFO L371 AbstractCegarLoop]: === Iteration 92 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:00,137 INFO L82 PathProgramCache]: Analyzing trace with hash -233508022, now seen corresponding path program 81 times [2018-02-04 02:58:00,138 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:00,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 98022 backedges. 13833 proven. 2171 refuted. 0 times theorem prover too weak. 82018 trivial. 0 not checked. [2018-02-04 02:58:02,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:02,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:58:02,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7419 backedges. 877 proven. 92 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-02-04 02:58:02,183 INFO L182 omatonBuilderFactory]: Interpolants [65056#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 65057#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 65058#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 65059#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 65060#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 65061#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 65062#(<= |foo_#in~size| 15), 65063#(<= main_~i~1 15), 65064#(<= main_~i~1 16), 65065#(<= main_~i~1 17), 65044#true, 65045#false, 65046#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 65047#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 65048#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 65049#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 65050#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 65051#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 65052#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 65053#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 65054#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 65055#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9))] [2018-02-04 02:58:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 98022 backedges. 13833 proven. 2171 refuted. 0 times theorem prover too weak. 82018 trivial. 0 not checked. [2018-02-04 02:58:02,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:58:02,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:58:02,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:58:02,186 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand 22 states. [2018-02-04 02:58:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:02,539 INFO L93 Difference]: Finished difference Result 681 states and 1196 transitions. [2018-02-04 02:58:02,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:58:02,540 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1303 [2018-02-04 02:58:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:02,543 INFO L225 Difference]: With dead ends: 681 [2018-02-04 02:58:02,543 INFO L226 Difference]: Without dead ends: 681 [2018-02-04 02:58:02,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=468, Invalid=938, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:58:02,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-02-04 02:58:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 405. [2018-02-04 02:58:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-04 02:58:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2018-02-04 02:58:02,555 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 1303 [2018-02-04 02:58:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:02,555 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2018-02-04 02:58:02,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:58:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2018-02-04 02:58:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1310 [2018-02-04 02:58:02,563 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:02,564 INFO L351 BasicCegarLoop]: trace histogram [194, 173, 173, 173, 173, 173, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:02,564 INFO L371 AbstractCegarLoop]: === Iteration 93 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash -722705326, now seen corresponding path program 82 times [2018-02-04 02:58:02,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:02,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 99096 backedges. 16208 proven. 752 refuted. 0 times theorem prover too weak. 82136 trivial. 0 not checked. [2018-02-04 02:58:04,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:04,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:58:04,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7425 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-02-04 02:58:04,554 INFO L182 omatonBuilderFactory]: Interpolants [66185#false, 66184#true, 66187#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 66186#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 66189#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 66188#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 66191#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 66190#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 66193#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 66192#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 66195#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 66194#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 66197#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 66196#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 66199#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 66198#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 66201#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 66200#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 66203#(<= |foo_#in~size| 16), 66202#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 66205#(<= main_~i~1 17), 66204#(<= main_~i~1 16)] [2018-02-04 02:58:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 99096 backedges. 16208 proven. 752 refuted. 0 times theorem prover too weak. 82136 trivial. 0 not checked. [2018-02-04 02:58:04,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:58:04,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:58:04,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:58:04,556 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand 22 states. [2018-02-04 02:58:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:04,815 INFO L93 Difference]: Finished difference Result 585 states and 987 transitions. [2018-02-04 02:58:04,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 02:58:04,815 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1309 [2018-02-04 02:58:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:04,817 INFO L225 Difference]: With dead ends: 585 [2018-02-04 02:58:04,818 INFO L226 Difference]: Without dead ends: 585 [2018-02-04 02:58:04,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:58:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-02-04 02:58:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 414. [2018-02-04 02:58:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-04 02:58:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 581 transitions. [2018-02-04 02:58:04,825 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 581 transitions. Word has length 1309 [2018-02-04 02:58:04,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:04,825 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 581 transitions. [2018-02-04 02:58:04,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:58:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 581 transitions. [2018-02-04 02:58:04,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1316 [2018-02-04 02:58:04,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:04,833 INFO L351 BasicCegarLoop]: trace histogram [195, 174, 174, 174, 174, 174, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:04,834 INFO L371 AbstractCegarLoop]: === Iteration 94 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:04,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1802118810, now seen corresponding path program 83 times [2018-02-04 02:58:04,834 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:04,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 100176 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 98874 trivial. 0 not checked. [2018-02-04 02:58:06,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:06,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:58:06,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7422 trivial. 0 not checked. [2018-02-04 02:58:06,826 INFO L182 omatonBuilderFactory]: Interpolants [67239#true, 67241#(= main_~i~1 0), 67240#false, 67243#(<= main_~i~1 2), 67242#(<= main_~i~1 1), 67245#(<= main_~i~1 4), 67244#(<= main_~i~1 3), 67247#(<= main_~i~1 6), 67246#(<= main_~i~1 5), 67249#(<= main_~i~1 8), 67248#(<= main_~i~1 7), 67251#(<= main_~i~1 10), 67250#(<= main_~i~1 9), 67253#(<= main_~i~1 12), 67252#(<= main_~i~1 11), 67255#(<= main_~i~1 14), 67254#(<= main_~i~1 13), 67257#(<= main_~i~1 16), 67256#(<= main_~i~1 15), 67259#(<= main_~i~1 18), 67258#(<= main_~i~1 17), 67261#(<= main_~i~1 20), 67260#(<= main_~i~1 19), 67262#(<= main_~i~1 21)] [2018-02-04 02:58:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 100176 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 98874 trivial. 0 not checked. [2018-02-04 02:58:06,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:58:06,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:58:06,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:58:06,828 INFO L87 Difference]: Start difference. First operand 414 states and 581 transitions. Second operand 24 states. [2018-02-04 02:58:06,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:06,998 INFO L93 Difference]: Finished difference Result 668 states and 935 transitions. [2018-02-04 02:58:06,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:58:06,998 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1315 [2018-02-04 02:58:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:07,000 INFO L225 Difference]: With dead ends: 668 [2018-02-04 02:58:07,000 INFO L226 Difference]: Without dead ends: 668 [2018-02-04 02:58:07,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:58:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-02-04 02:58:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 425. [2018-02-04 02:58:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 02:58:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-02-04 02:58:07,006 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1315 [2018-02-04 02:58:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:07,006 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-02-04 02:58:07,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:58:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-02-04 02:58:07,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1382 [2018-02-04 02:58:07,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:07,014 INFO L351 BasicCegarLoop]: trace histogram [205, 183, 183, 183, 183, 183, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:07,014 INFO L371 AbstractCegarLoop]: === Iteration 95 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1157351389, now seen corresponding path program 84 times [2018-02-04 02:58:07,015 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:07,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 110786 backedges. 6478 proven. 4629 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-02-04 02:58:09,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:09,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:58:09,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8358 backedges. 637 proven. 280 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-02-04 02:58:09,089 INFO L182 omatonBuilderFactory]: Interpolants [68357#false, 68356#true, 68359#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 68358#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 68361#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 68360#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 68363#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 68362#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 68365#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 68364#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 68367#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 68366#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 68369#(<= main_~i~1 9), 68368#(<= |foo_#in~size| 9), 68371#(<= main_~i~1 11), 68370#(<= main_~i~1 10), 68373#(<= main_~i~1 13), 68372#(<= main_~i~1 12), 68375#(<= main_~i~1 15), 68374#(<= main_~i~1 14)] [2018-02-04 02:58:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 110786 backedges. 6478 proven. 4629 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-02-04 02:58:09,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:58:09,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:58:09,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:58:09,091 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 20 states. [2018-02-04 02:58:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:09,316 INFO L93 Difference]: Finished difference Result 1029 states and 1894 transitions. [2018-02-04 02:58:09,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 02:58:09,317 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1381 [2018-02-04 02:58:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:09,322 INFO L225 Difference]: With dead ends: 1029 [2018-02-04 02:58:09,322 INFO L226 Difference]: Without dead ends: 1029 [2018-02-04 02:58:09,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:58:09,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-02-04 02:58:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 428. [2018-02-04 02:58:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-02-04 02:58:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 621 transitions. [2018-02-04 02:58:09,335 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 621 transitions. Word has length 1381 [2018-02-04 02:58:09,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:09,335 INFO L432 AbstractCegarLoop]: Abstraction has 428 states and 621 transitions. [2018-02-04 02:58:09,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:58:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 621 transitions. [2018-02-04 02:58:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1388 [2018-02-04 02:58:09,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:09,344 INFO L351 BasicCegarLoop]: trace histogram [206, 184, 184, 184, 184, 184, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:09,344 INFO L371 AbstractCegarLoop]: === Iteration 96 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash 559584619, now seen corresponding path program 85 times [2018-02-04 02:58:09,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:09,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 111928 backedges. 7104 proven. 5145 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-02-04 02:58:11,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:11,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:58:11,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8367 backedges. 616 proven. 310 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-02-04 02:58:11,452 INFO L182 omatonBuilderFactory]: Interpolants [69857#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 69856#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 69859#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 69858#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 69861#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 69860#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 69863#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 69862#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 69865#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 69864#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 69867#(<= main_~i~1 10), 69866#(<= |foo_#in~size| 10), 69869#(<= main_~i~1 12), 69868#(<= main_~i~1 11), 69871#(<= main_~i~1 14), 69870#(<= main_~i~1 13), 69873#(<= main_~i~1 16), 69872#(<= main_~i~1 15), 69853#true, 69855#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 69854#false] [2018-02-04 02:58:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 111928 backedges. 7104 proven. 5145 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-02-04 02:58:11,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:58:11,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:58:11,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:58:11,454 INFO L87 Difference]: Start difference. First operand 428 states and 621 transitions. Second operand 21 states. [2018-02-04 02:58:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:11,703 INFO L93 Difference]: Finished difference Result 1032 states and 2005 transitions. [2018-02-04 02:58:11,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:58:11,703 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1387 [2018-02-04 02:58:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:11,709 INFO L225 Difference]: With dead ends: 1032 [2018-02-04 02:58:11,709 INFO L226 Difference]: Without dead ends: 1032 [2018-02-04 02:58:11,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=269, Invalid=723, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:58:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-02-04 02:58:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 428. [2018-02-04 02:58:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-02-04 02:58:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 621 transitions. [2018-02-04 02:58:11,724 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 621 transitions. Word has length 1387 [2018-02-04 02:58:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:11,725 INFO L432 AbstractCegarLoop]: Abstraction has 428 states and 621 transitions. [2018-02-04 02:58:11,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:58:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 621 transitions. [2018-02-04 02:58:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1394 [2018-02-04 02:58:11,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:11,733 INFO L351 BasicCegarLoop]: trace histogram [207, 185, 185, 185, 185, 185, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:11,733 INFO L371 AbstractCegarLoop]: === Iteration 97 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:11,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1937235123, now seen corresponding path program 86 times [2018-02-04 02:58:11,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:11,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 113076 backedges. 7730 proven. 5667 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-02-04 02:58:13,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:13,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:58:13,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8397 backedges. 616 proven. 340 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-02-04 02:58:13,947 INFO L182 omatonBuilderFactory]: Interpolants [71361#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 71360#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 71363#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 71362#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 71365#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 71364#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 71367#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 71366#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 71369#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 71368#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 71371#(<= main_~i~1 11), 71370#(<= |foo_#in~size| 11), 71373#(<= main_~i~1 13), 71372#(<= main_~i~1 12), 71375#(<= main_~i~1 15), 71374#(<= main_~i~1 14), 71377#(<= main_~i~1 17), 71376#(<= main_~i~1 16), 71357#false, 71356#true, 71359#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 71358#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-04 02:58:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 113076 backedges. 7730 proven. 5667 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-02-04 02:58:13,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:58:13,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:58:13,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:58:13,950 INFO L87 Difference]: Start difference. First operand 428 states and 621 transitions. Second operand 22 states. [2018-02-04 02:58:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:14,216 INFO L93 Difference]: Finished difference Result 1035 states and 2116 transitions. [2018-02-04 02:58:14,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:58:14,216 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1393 [2018-02-04 02:58:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:14,221 INFO L225 Difference]: With dead ends: 1035 [2018-02-04 02:58:14,221 INFO L226 Difference]: Without dead ends: 1035 [2018-02-04 02:58:14,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=308, Invalid=814, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:58:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-02-04 02:58:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 428. [2018-02-04 02:58:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-02-04 02:58:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 621 transitions. [2018-02-04 02:58:14,236 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 621 transitions. Word has length 1393 [2018-02-04 02:58:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:14,236 INFO L432 AbstractCegarLoop]: Abstraction has 428 states and 621 transitions. [2018-02-04 02:58:14,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:58:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 621 transitions. [2018-02-04 02:58:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1400 [2018-02-04 02:58:14,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:14,244 INFO L351 BasicCegarLoop]: trace histogram [208, 186, 186, 186, 186, 186, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:14,244 INFO L371 AbstractCegarLoop]: === Iteration 98 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:14,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1224438277, now seen corresponding path program 87 times [2018-02-04 02:58:14,245 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:14,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 114230 backedges. 8356 proven. 6195 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-02-04 02:58:16,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:16,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:58:16,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8427 backedges. 616 proven. 370 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-02-04 02:58:16,507 INFO L182 omatonBuilderFactory]: Interpolants [72865#true, 72867#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 72866#false, 72869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 72868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 72871#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 72870#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 72873#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 72872#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 72875#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 72874#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 72877#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 72876#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 72879#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 72878#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 72881#(<= main_~i~1 12), 72880#(<= |foo_#in~size| 12), 72883#(<= main_~i~1 14), 72882#(<= main_~i~1 13), 72885#(<= main_~i~1 16), 72884#(<= main_~i~1 15), 72887#(<= main_~i~1 18), 72886#(<= main_~i~1 17)] [2018-02-04 02:58:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 114230 backedges. 8356 proven. 6195 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-02-04 02:58:16,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:58:16,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:58:16,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:58:16,510 INFO L87 Difference]: Start difference. First operand 428 states and 621 transitions. Second operand 23 states. [2018-02-04 02:58:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:16,809 INFO L93 Difference]: Finished difference Result 1035 states and 2116 transitions. [2018-02-04 02:58:16,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 02:58:16,809 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1399 [2018-02-04 02:58:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:16,814 INFO L225 Difference]: With dead ends: 1035 [2018-02-04 02:58:16,814 INFO L226 Difference]: Without dead ends: 1035 [2018-02-04 02:58:16,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=350, Invalid=910, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:58:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-02-04 02:58:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 425. [2018-02-04 02:58:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 02:58:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-02-04 02:58:16,829 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1399 [2018-02-04 02:58:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:16,829 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-02-04 02:58:16,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:58:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-02-04 02:58:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1406 [2018-02-04 02:58:16,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:16,838 INFO L351 BasicCegarLoop]: trace histogram [209, 187, 187, 187, 187, 187, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:16,838 INFO L371 AbstractCegarLoop]: === Iteration 99 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:16,838 INFO L82 PathProgramCache]: Analyzing trace with hash 826878275, now seen corresponding path program 88 times [2018-02-04 02:58:16,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:16,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 115390 backedges. 9981 proven. 5630 refuted. 0 times theorem prover too weak. 99779 trivial. 0 not checked. [2018-02-04 02:58:19,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:19,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:58:19,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8460 backedges. 699 proven. 320 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-02-04 02:58:19,161 INFO L182 omatonBuilderFactory]: Interpolants [74375#false, 74374#true, 74377#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 74376#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 74379#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 74378#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 74381#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 74380#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 74383#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 74382#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 74385#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 74384#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 74387#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 74386#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 74389#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 74388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 74391#(<= main_~i~1 13), 74390#(<= |foo_#in~size| 13), 74393#(<= main_~i~1 15), 74392#(<= main_~i~1 14), 74395#(<= main_~i~1 17), 74394#(<= main_~i~1 16), 74396#(<= main_~i~1 18)] [2018-02-04 02:58:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 115390 backedges. 9981 proven. 5630 refuted. 0 times theorem prover too weak. 99779 trivial. 0 not checked. [2018-02-04 02:58:19,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:58:19,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:58:19,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:58:19,164 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 23 states. [2018-02-04 02:58:19,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:19,449 INFO L93 Difference]: Finished difference Result 972 states and 1963 transitions. [2018-02-04 02:58:19,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 02:58:19,449 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1405 [2018-02-04 02:58:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:19,453 INFO L225 Difference]: With dead ends: 972 [2018-02-04 02:58:19,453 INFO L226 Difference]: Without dead ends: 972 [2018-02-04 02:58:19,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=387, Invalid=945, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:58:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2018-02-04 02:58:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 425. [2018-02-04 02:58:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 02:58:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-02-04 02:58:19,467 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1405 [2018-02-04 02:58:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:19,467 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-02-04 02:58:19,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:58:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-02-04 02:58:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1412 [2018-02-04 02:58:19,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:19,476 INFO L351 BasicCegarLoop]: trace histogram [210, 188, 188, 188, 188, 188, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:19,476 INFO L371 AbstractCegarLoop]: === Iteration 100 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1945638347, now seen corresponding path program 89 times [2018-02-04 02:58:19,476 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:19,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 116556 backedges. 11840 proven. 4831 refuted. 0 times theorem prover too weak. 99885 trivial. 0 not checked. [2018-02-04 02:58:21,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:21,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:58:21,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8484 backedges. 785 proven. 258 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-02-04 02:58:21,784 INFO L182 omatonBuilderFactory]: Interpolants [75841#(<= main_~i~1 15), 75840#(<= main_~i~1 14), 75843#(<= main_~i~1 17), 75842#(<= main_~i~1 16), 75844#(<= main_~i~1 18), 75823#false, 75822#true, 75825#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 75824#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 75827#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 75826#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 75829#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 75828#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 75831#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 75830#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 75833#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 75832#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 75835#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 75834#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 75837#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 75836#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 75839#(<= |foo_#in~size| 14), 75838#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14))] [2018-02-04 02:58:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 116556 backedges. 11840 proven. 4831 refuted. 0 times theorem prover too weak. 99885 trivial. 0 not checked. [2018-02-04 02:58:21,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:58:21,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:58:21,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:58:21,786 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 23 states. [2018-02-04 02:58:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:22,092 INFO L93 Difference]: Finished difference Result 897 states and 1778 transitions. [2018-02-04 02:58:22,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:58:22,092 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1411 [2018-02-04 02:58:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:22,096 INFO L225 Difference]: With dead ends: 897 [2018-02-04 02:58:22,096 INFO L226 Difference]: Without dead ends: 897 [2018-02-04 02:58:22,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=428, Invalid=978, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:58:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-02-04 02:58:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 425. [2018-02-04 02:58:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 02:58:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-02-04 02:58:22,109 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1411 [2018-02-04 02:58:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:22,109 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-02-04 02:58:22,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:58:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-02-04 02:58:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1418 [2018-02-04 02:58:22,117 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:22,118 INFO L351 BasicCegarLoop]: trace histogram [211, 189, 189, 189, 189, 189, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:22,118 INFO L371 AbstractCegarLoop]: === Iteration 101 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:22,118 INFO L82 PathProgramCache]: Analyzing trace with hash 153875347, now seen corresponding path program 90 times [2018-02-04 02:58:22,118 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:22,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 117728 backedges. 13951 proven. 3780 refuted. 0 times theorem prover too weak. 99997 trivial. 0 not checked. [2018-02-04 02:58:24,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:24,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:58:24,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8502 backedges. 877 proven. 184 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-02-04 02:58:24,480 INFO L182 omatonBuilderFactory]: Interpolants [77217#(<= main_~i~1 16), 77216#(<= main_~i~1 15), 77219#(<= main_~i~1 18), 77218#(<= main_~i~1 17), 77197#true, 77199#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 77198#false, 77201#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 77200#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 77203#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 77202#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 77205#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 77204#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 77207#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 77206#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 77209#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 77208#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 77211#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 77210#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 77213#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 77212#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 77215#(<= |foo_#in~size| 15), 77214#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15))] [2018-02-04 02:58:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 117728 backedges. 13951 proven. 3780 refuted. 0 times theorem prover too weak. 99997 trivial. 0 not checked. [2018-02-04 02:58:24,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:58:24,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:58:24,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:58:24,482 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 23 states. [2018-02-04 02:58:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:24,753 INFO L93 Difference]: Finished difference Result 810 states and 1560 transitions. [2018-02-04 02:58:24,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 02:58:24,753 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1417 [2018-02-04 02:58:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:24,756 INFO L225 Difference]: With dead ends: 810 [2018-02-04 02:58:24,756 INFO L226 Difference]: Without dead ends: 810 [2018-02-04 02:58:24,757 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=473, Invalid=1009, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:58:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-02-04 02:58:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 425. [2018-02-04 02:58:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 02:58:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-02-04 02:58:24,767 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1417 [2018-02-04 02:58:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:24,768 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-02-04 02:58:24,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:58:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-02-04 02:58:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1424 [2018-02-04 02:58:24,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:24,776 INFO L351 BasicCegarLoop]: trace histogram [212, 190, 190, 190, 190, 190, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:24,776 INFO L371 AbstractCegarLoop]: === Iteration 102 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash -96349541, now seen corresponding path program 91 times [2018-02-04 02:58:24,777 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:24,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 118906 backedges. 16332 proven. 2459 refuted. 0 times theorem prover too weak. 100115 trivial. 0 not checked. [2018-02-04 02:58:27,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:27,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:58:27,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8514 backedges. 975 proven. 98 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-02-04 02:58:27,097 INFO L182 omatonBuilderFactory]: Interpolants [78497#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 78496#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 78499#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 78498#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 78501#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 78500#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 78503#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 78502#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 78505#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 78504#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 78507#(<= main_~i~1 16), 78506#(<= |foo_#in~size| 16), 78509#(<= main_~i~1 18), 78508#(<= main_~i~1 17), 78487#true, 78489#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 78488#false, 78491#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 78490#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 78493#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 78492#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 78495#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 78494#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-04 02:58:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 118906 backedges. 16332 proven. 2459 refuted. 0 times theorem prover too weak. 100115 trivial. 0 not checked. [2018-02-04 02:58:27,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:58:27,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:58:27,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:58:27,100 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 23 states. [2018-02-04 02:58:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:27,383 INFO L93 Difference]: Finished difference Result 715 states and 1312 transitions. [2018-02-04 02:58:27,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:58:27,383 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1423 [2018-02-04 02:58:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:27,387 INFO L225 Difference]: With dead ends: 715 [2018-02-04 02:58:27,387 INFO L226 Difference]: Without dead ends: 715 [2018-02-04 02:58:27,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=522, Invalid=1038, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:58:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-02-04 02:58:27,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 425. [2018-02-04 02:58:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 02:58:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-02-04 02:58:27,397 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1423 [2018-02-04 02:58:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:27,398 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-02-04 02:58:27,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:58:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-02-04 02:58:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1430 [2018-02-04 02:58:27,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:27,407 INFO L351 BasicCegarLoop]: trace histogram [213, 191, 191, 191, 191, 191, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:27,407 INFO L371 AbstractCegarLoop]: === Iteration 103 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:27,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1006292253, now seen corresponding path program 92 times [2018-02-04 02:58:27,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:27,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 120090 backedges. 19001 proven. 850 refuted. 0 times theorem prover too weak. 100239 trivial. 0 not checked. [2018-02-04 02:58:29,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:29,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:58:29,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8520 backedges. 1079 proven. 0 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-02-04 02:58:29,841 INFO L182 omatonBuilderFactory]: Interpolants [79685#false, 79684#true, 79687#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 79686#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 79689#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 79688#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 79691#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 79690#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 79693#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 79692#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 79695#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 79694#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 79697#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 79696#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 79699#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 79698#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 79701#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 79700#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 79703#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 79702#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 79705#(<= main_~i~1 17), 79704#(<= |foo_#in~size| 17), 79706#(<= main_~i~1 18)] [2018-02-04 02:58:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 120090 backedges. 19001 proven. 850 refuted. 0 times theorem prover too weak. 100239 trivial. 0 not checked. [2018-02-04 02:58:29,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:58:29,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:58:29,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:58:29,844 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 23 states. [2018-02-04 02:58:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:30,183 INFO L93 Difference]: Finished difference Result 613 states and 1073 transitions. [2018-02-04 02:58:30,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:58:30,183 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1429 [2018-02-04 02:58:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:30,186 INFO L225 Difference]: With dead ends: 613 [2018-02-04 02:58:30,186 INFO L226 Difference]: Without dead ends: 613 [2018-02-04 02:58:30,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:58:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-02-04 02:58:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 434. [2018-02-04 02:58:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-04 02:58:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 628 transitions. [2018-02-04 02:58:30,195 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 628 transitions. Word has length 1429 [2018-02-04 02:58:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:30,195 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 628 transitions. [2018-02-04 02:58:30,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:58:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 628 transitions. [2018-02-04 02:58:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1436 [2018-02-04 02:58:30,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:30,205 INFO L351 BasicCegarLoop]: trace histogram [214, 192, 192, 192, 192, 192, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:30,205 INFO L371 AbstractCegarLoop]: === Iteration 104 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash -493353877, now seen corresponding path program 93 times [2018-02-04 02:58:30,206 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:30,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 121280 backedges. 3806 proven. 8215 refuted. 0 times theorem prover too weak. 109259 trivial. 0 not checked. [2018-02-04 02:58:32,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:32,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:58:32,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8517 backedges. 283 proven. 631 refuted. 0 times theorem prover too weak. 7603 trivial. 0 not checked. [2018-02-04 02:58:32,599 INFO L182 omatonBuilderFactory]: Interpolants [80801#(<= 9 main_~i~1), 80800#(<= 8 main_~i~1), 80803#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 80802#(<= 10 main_~i~1), 80805#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 80804#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 80807#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 80806#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 80809#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 80808#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 80811#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 80810#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 80813#(<= |foo_#in~size| 9), 80812#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 80791#false, 80790#true, 80793#(<= 1 main_~i~1), 80792#(<= 0 main_~i~1), 80795#(<= 3 main_~i~1), 80794#(<= 2 main_~i~1), 80797#(<= 5 main_~i~1), 80796#(<= 4 main_~i~1), 80799#(<= 7 main_~i~1), 80798#(<= 6 main_~i~1)] [2018-02-04 02:58:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 121280 backedges. 3806 proven. 8215 refuted. 0 times theorem prover too weak. 109259 trivial. 0 not checked. [2018-02-04 02:58:32,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:58:32,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:58:32,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:58:32,602 INFO L87 Difference]: Start difference. First operand 434 states and 628 transitions. Second operand 24 states. [2018-02-04 02:58:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:33,056 INFO L93 Difference]: Finished difference Result 487 states and 678 transitions. [2018-02-04 02:58:33,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 02:58:33,056 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1435 [2018-02-04 02:58:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:33,057 INFO L225 Difference]: With dead ends: 487 [2018-02-04 02:58:33,057 INFO L226 Difference]: Without dead ends: 487 [2018-02-04 02:58:33,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:58:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-02-04 02:58:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 437. [2018-02-04 02:58:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-02-04 02:58:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 638 transitions. [2018-02-04 02:58:33,063 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 638 transitions. Word has length 1435 [2018-02-04 02:58:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:33,063 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 638 transitions. [2018-02-04 02:58:33,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:58:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 638 transitions. [2018-02-04 02:58:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1472 [2018-02-04 02:58:33,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:33,072 INFO L351 BasicCegarLoop]: trace histogram [220, 198, 198, 198, 198, 198, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:33,072 INFO L371 AbstractCegarLoop]: === Iteration 105 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:33,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2020762149, now seen corresponding path program 94 times [2018-02-04 02:58:33,073 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:33,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 128546 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 127116 trivial. 0 not checked. [2018-02-04 02:58:35,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:35,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:58:35,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8805 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8805 trivial. 0 not checked. [2018-02-04 02:58:35,527 INFO L182 omatonBuilderFactory]: Interpolants [81759#false, 81758#true, 81761#(<= main_~i~1 1), 81760#(= main_~i~1 0), 81763#(<= main_~i~1 3), 81762#(<= main_~i~1 2), 81765#(<= main_~i~1 5), 81764#(<= main_~i~1 4), 81767#(<= main_~i~1 7), 81766#(<= main_~i~1 6), 81769#(<= main_~i~1 9), 81768#(<= main_~i~1 8), 81771#(<= main_~i~1 11), 81770#(<= main_~i~1 10), 81773#(<= main_~i~1 13), 81772#(<= main_~i~1 12), 81775#(<= main_~i~1 15), 81774#(<= main_~i~1 14), 81777#(<= main_~i~1 17), 81776#(<= main_~i~1 16), 81779#(<= main_~i~1 19), 81778#(<= main_~i~1 18), 81781#(<= main_~i~1 21), 81780#(<= main_~i~1 20), 81782#(<= main_~i~1 22)] [2018-02-04 02:58:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 128546 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 127116 trivial. 0 not checked. [2018-02-04 02:58:35,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:58:35,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:58:35,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:58:35,529 INFO L87 Difference]: Start difference. First operand 437 states and 638 transitions. Second operand 25 states. [2018-02-04 02:58:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:35,727 INFO L93 Difference]: Finished difference Result 740 states and 1109 transitions. [2018-02-04 02:58:35,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:58:35,727 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1471 [2018-02-04 02:58:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:35,729 INFO L225 Difference]: With dead ends: 740 [2018-02-04 02:58:35,730 INFO L226 Difference]: Without dead ends: 740 [2018-02-04 02:58:35,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:58:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-02-04 02:58:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 448. [2018-02-04 02:58:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 02:58:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-02-04 02:58:35,737 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1471 [2018-02-04 02:58:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:35,737 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-02-04 02:58:35,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:58:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-02-04 02:58:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1544 [2018-02-04 02:58:35,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:35,746 INFO L351 BasicCegarLoop]: trace histogram [231, 208, 208, 208, 208, 208, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:35,746 INFO L371 AbstractCegarLoop]: === Iteration 106 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:35,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1005294164, now seen corresponding path program 95 times [2018-02-04 02:58:35,747 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:35,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 141818 backedges. 7576 proven. 6320 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-02-04 02:58:38,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:38,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:58:38,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9867 backedges. 670 proven. 372 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-02-04 02:58:38,342 INFO L182 omatonBuilderFactory]: Interpolants [82977#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 82976#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 82979#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 82978#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 82981#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 82980#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 82983#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 82982#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 82985#(<= main_~i~1 10), 82984#(<= |foo_#in~size| 10), 82987#(<= main_~i~1 12), 82986#(<= main_~i~1 11), 82989#(<= main_~i~1 14), 82988#(<= main_~i~1 13), 82991#(<= main_~i~1 16), 82990#(<= main_~i~1 15), 82992#(<= main_~i~1 17), 82971#true, 82973#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 82972#false, 82975#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 82974#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-04 02:58:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 141818 backedges. 7576 proven. 6320 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-02-04 02:58:38,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:58:38,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:58:38,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:58:38,344 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 22 states. [2018-02-04 02:58:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:38,640 INFO L93 Difference]: Finished difference Result 1147 states and 2284 transitions. [2018-02-04 02:58:38,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 02:58:38,640 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1543 [2018-02-04 02:58:38,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:38,647 INFO L225 Difference]: With dead ends: 1147 [2018-02-04 02:58:38,647 INFO L226 Difference]: Without dead ends: 1147 [2018-02-04 02:58:38,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=278, Invalid=778, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:58:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2018-02-04 02:58:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 451. [2018-02-04 02:58:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-02-04 02:58:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 680 transitions. [2018-02-04 02:58:38,677 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 680 transitions. Word has length 1543 [2018-02-04 02:58:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:38,678 INFO L432 AbstractCegarLoop]: Abstraction has 451 states and 680 transitions. [2018-02-04 02:58:38,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:58:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 680 transitions. [2018-02-04 02:58:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1550 [2018-02-04 02:58:38,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:38,693 INFO L351 BasicCegarLoop]: trace histogram [232, 209, 209, 209, 209, 209, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:38,693 INFO L371 AbstractCegarLoop]: === Iteration 107 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1313614068, now seen corresponding path program 96 times [2018-02-04 02:58:38,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:38,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 143112 backedges. 8238 proven. 6952 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-02-04 02:58:41,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:41,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:58:41,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9885 backedges. 652 proven. 408 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-02-04 02:58:41,407 INFO L182 omatonBuilderFactory]: Interpolants [84613#true, 84615#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 84614#false, 84617#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 84616#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 84619#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 84618#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 84621#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 84620#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 84623#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 84622#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 84625#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 84624#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 84627#(<= |foo_#in~size| 11), 84626#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 84629#(<= main_~i~1 12), 84628#(<= main_~i~1 11), 84631#(<= main_~i~1 14), 84630#(<= main_~i~1 13), 84633#(<= main_~i~1 16), 84632#(<= main_~i~1 15), 84635#(<= main_~i~1 18), 84634#(<= main_~i~1 17)] [2018-02-04 02:58:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 143112 backedges. 8238 proven. 6952 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-02-04 02:58:41,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:58:41,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:58:41,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:58:41,410 INFO L87 Difference]: Start difference. First operand 451 states and 680 transitions. Second operand 23 states. [2018-02-04 02:58:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:41,704 INFO L93 Difference]: Finished difference Result 1150 states and 2411 transitions. [2018-02-04 02:58:41,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:58:41,704 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1549 [2018-02-04 02:58:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:41,711 INFO L225 Difference]: With dead ends: 1150 [2018-02-04 02:58:41,711 INFO L226 Difference]: Without dead ends: 1150 [2018-02-04 02:58:41,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=317, Invalid=873, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:58:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-02-04 02:58:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 451. [2018-02-04 02:58:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-02-04 02:58:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 680 transitions. [2018-02-04 02:58:41,729 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 680 transitions. Word has length 1549 [2018-02-04 02:58:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:41,729 INFO L432 AbstractCegarLoop]: Abstraction has 451 states and 680 transitions. [2018-02-04 02:58:41,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:58:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 680 transitions. [2018-02-04 02:58:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1556 [2018-02-04 02:58:41,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:41,739 INFO L351 BasicCegarLoop]: trace histogram [233, 210, 210, 210, 210, 210, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:41,739 INFO L371 AbstractCegarLoop]: === Iteration 108 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash 558648892, now seen corresponding path program 97 times [2018-02-04 02:58:41,740 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:41,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 144412 backedges. 8900 proven. 7590 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-02-04 02:58:44,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:44,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:58:44,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9921 backedges. 652 proven. 444 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-02-04 02:58:44,663 INFO L182 omatonBuilderFactory]: Interpolants [86273#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 86272#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 86275#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 86274#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 86277#(<= main_~i~1 12), 86276#(<= |foo_#in~size| 12), 86279#(<= main_~i~1 14), 86278#(<= main_~i~1 13), 86281#(<= main_~i~1 16), 86280#(<= main_~i~1 15), 86283#(<= main_~i~1 18), 86282#(<= main_~i~1 17), 86284#(<= main_~i~1 19), 86261#true, 86263#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 86262#false, 86265#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 86264#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 86267#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 86266#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 86269#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 86268#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 86271#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 86270#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7))] [2018-02-04 02:58:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 144412 backedges. 8900 proven. 7590 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-02-04 02:58:44,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:58:44,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:58:44,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:58:44,666 INFO L87 Difference]: Start difference. First operand 451 states and 680 transitions. Second operand 24 states. [2018-02-04 02:58:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:44,996 INFO L93 Difference]: Finished difference Result 1150 states and 2411 transitions. [2018-02-04 02:58:44,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 02:58:44,996 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1555 [2018-02-04 02:58:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:45,003 INFO L225 Difference]: With dead ends: 1150 [2018-02-04 02:58:45,003 INFO L226 Difference]: Without dead ends: 1150 [2018-02-04 02:58:45,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:58:45,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-02-04 02:58:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 448. [2018-02-04 02:58:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 02:58:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-02-04 02:58:45,023 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1555 [2018-02-04 02:58:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:45,023 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-02-04 02:58:45,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:58:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-02-04 02:58:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1562 [2018-02-04 02:58:45,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:45,033 INFO L351 BasicCegarLoop]: trace histogram [234, 211, 211, 211, 211, 211, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:45,033 INFO L371 AbstractCegarLoop]: === Iteration 109 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash -610443900, now seen corresponding path program 98 times [2018-02-04 02:58:45,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:45,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:58:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 145718 backedges. 10567 proven. 7129 refuted. 0 times theorem prover too weak. 128022 trivial. 0 not checked. [2018-02-04 02:58:47,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:47,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:58:47,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9960 backedges. 735 proven. 400 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-02-04 02:58:47,901 INFO L182 omatonBuilderFactory]: Interpolants [87909#true, 87911#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 87910#false, 87913#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 87912#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 87915#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 87914#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 87917#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 87916#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 87919#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 87918#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 87921#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 87920#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 87923#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 87922#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 87925#(<= |foo_#in~size| 13), 87924#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 87927#(<= main_~i~1 14), 87926#(<= main_~i~1 13), 87929#(<= main_~i~1 16), 87928#(<= main_~i~1 15), 87931#(<= main_~i~1 18), 87930#(<= main_~i~1 17), 87932#(<= main_~i~1 19)] [2018-02-04 02:58:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 145718 backedges. 10567 proven. 7129 refuted. 0 times theorem prover too weak. 128022 trivial. 0 not checked. [2018-02-04 02:58:47,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:58:47,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:58:47,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:58:47,904 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-02-04 02:58:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:48,233 INFO L93 Difference]: Finished difference Result 1093 states and 2273 transitions. [2018-02-04 02:58:48,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:58:48,233 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1561 [2018-02-04 02:58:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:48,239 INFO L225 Difference]: With dead ends: 1093 [2018-02-04 02:58:48,239 INFO L226 Difference]: Without dead ends: 1093 [2018-02-04 02:58:48,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:58:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-02-04 02:58:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 448. [2018-02-04 02:58:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 02:58:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-02-04 02:58:48,257 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1561 [2018-02-04 02:58:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:48,258 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-02-04 02:58:48,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:58:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-02-04 02:58:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1568 [2018-02-04 02:58:48,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:48,268 INFO L351 BasicCegarLoop]: trace histogram [235, 212, 212, 212, 212, 212, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:48,268 INFO L371 AbstractCegarLoop]: === Iteration 110 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:48,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1165557260, now seen corresponding path program 99 times [2018-02-04 02:58:48,269 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:48,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 147030 backedges. 12468 proven. 6434 refuted. 0 times theorem prover too weak. 128128 trivial. 0 not checked. [2018-02-04 02:58:51,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:51,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:58:51,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9990 backedges. 821 proven. 344 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-02-04 02:58:51,134 INFO L182 omatonBuilderFactory]: Interpolants [89505#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 89504#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 89507#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 89506#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 89509#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 89508#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 89511#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 89510#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 89513#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 89512#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 89515#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 89514#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 89517#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 89516#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 89519#(<= |foo_#in~size| 14), 89518#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 89521#(<= main_~i~1 15), 89520#(<= main_~i~1 14), 89523#(<= main_~i~1 17), 89522#(<= main_~i~1 16), 89525#(<= main_~i~1 19), 89524#(<= main_~i~1 18), 89503#false, 89502#true] [2018-02-04 02:58:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 147030 backedges. 12468 proven. 6434 refuted. 0 times theorem prover too weak. 128128 trivial. 0 not checked. [2018-02-04 02:58:51,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:58:51,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:58:51,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:58:51,137 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-02-04 02:58:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:51,451 INFO L93 Difference]: Finished difference Result 1024 states and 2103 transitions. [2018-02-04 02:58:51,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 02:58:51,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1567 [2018-02-04 02:58:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:51,456 INFO L225 Difference]: With dead ends: 1024 [2018-02-04 02:58:51,456 INFO L226 Difference]: Without dead ends: 1024 [2018-02-04 02:58:51,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:58:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2018-02-04 02:58:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 448. [2018-02-04 02:58:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 02:58:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-02-04 02:58:51,469 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1567 [2018-02-04 02:58:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:51,469 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-02-04 02:58:51,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:58:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-02-04 02:58:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1574 [2018-02-04 02:58:51,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:51,479 INFO L351 BasicCegarLoop]: trace histogram [236, 213, 213, 213, 213, 213, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:51,479 INFO L371 AbstractCegarLoop]: === Iteration 111 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1683607508, now seen corresponding path program 100 times [2018-02-04 02:58:51,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:51,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 148348 backedges. 14621 proven. 5487 refuted. 0 times theorem prover too weak. 128240 trivial. 0 not checked. [2018-02-04 02:58:54,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:54,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:58:54,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10014 backedges. 913 proven. 276 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-02-04 02:58:54,404 INFO L182 omatonBuilderFactory]: Interpolants [91041#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 91040#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 91043#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 91042#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 91045#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 91044#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 91047#(<= main_~i~1 15), 91046#(<= |foo_#in~size| 15), 91049#(<= main_~i~1 17), 91048#(<= main_~i~1 16), 91051#(<= main_~i~1 19), 91050#(<= main_~i~1 18), 91029#false, 91028#true, 91031#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 91030#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 91033#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 91032#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 91035#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 91034#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 91037#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 91036#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 91039#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 91038#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8))] [2018-02-04 02:58:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 148348 backedges. 14621 proven. 5487 refuted. 0 times theorem prover too weak. 128240 trivial. 0 not checked. [2018-02-04 02:58:54,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:58:54,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:58:54,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:58:54,407 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-02-04 02:58:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:54,694 INFO L93 Difference]: Finished difference Result 943 states and 1900 transitions. [2018-02-04 02:58:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:58:54,694 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1573 [2018-02-04 02:58:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:54,699 INFO L225 Difference]: With dead ends: 943 [2018-02-04 02:58:54,699 INFO L226 Difference]: Without dead ends: 943 [2018-02-04 02:58:54,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=479, Invalid=1081, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:58:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-02-04 02:58:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 448. [2018-02-04 02:58:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 02:58:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-02-04 02:58:54,711 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1573 [2018-02-04 02:58:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:54,712 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-02-04 02:58:54,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:58:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-02-04 02:58:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1580 [2018-02-04 02:58:54,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:54,722 INFO L351 BasicCegarLoop]: trace histogram [237, 214, 214, 214, 214, 214, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:54,722 INFO L371 AbstractCegarLoop]: === Iteration 112 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:54,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2003624668, now seen corresponding path program 101 times [2018-02-04 02:58:54,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:54,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 149672 backedges. 17044 proven. 4270 refuted. 0 times theorem prover too weak. 128358 trivial. 0 not checked. [2018-02-04 02:58:57,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:57,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:58:57,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10032 backedges. 1011 proven. 196 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-02-04 02:58:57,626 INFO L182 omatonBuilderFactory]: Interpolants [92481#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 92480#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 92483#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 92482#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 92485#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 92484#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 92487#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 92486#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 92489#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 92488#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 92491#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 92490#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 92493#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 92492#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 92495#(<= main_~i~1 16), 92494#(<= |foo_#in~size| 16), 92497#(<= main_~i~1 18), 92496#(<= main_~i~1 17), 92498#(<= main_~i~1 19), 92475#true, 92477#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 92476#false, 92479#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 92478#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-04 02:58:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 149672 backedges. 17044 proven. 4270 refuted. 0 times theorem prover too weak. 128358 trivial. 0 not checked. [2018-02-04 02:58:57,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:58:57,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:58:57,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:58:57,629 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-02-04 02:58:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:57,934 INFO L93 Difference]: Finished difference Result 850 states and 1663 transitions. [2018-02-04 02:58:57,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:58:57,935 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1579 [2018-02-04 02:58:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:57,940 INFO L225 Difference]: With dead ends: 850 [2018-02-04 02:58:57,940 INFO L226 Difference]: Without dead ends: 850 [2018-02-04 02:58:57,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=527, Invalid=1113, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:58:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-02-04 02:58:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 448. [2018-02-04 02:58:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 02:58:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-02-04 02:58:57,953 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1579 [2018-02-04 02:58:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:57,953 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-02-04 02:58:57,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:58:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-02-04 02:58:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1586 [2018-02-04 02:58:57,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:57,963 INFO L351 BasicCegarLoop]: trace histogram [238, 215, 215, 215, 215, 215, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:57,963 INFO L371 AbstractCegarLoop]: === Iteration 113 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash 398309156, now seen corresponding path program 102 times [2018-02-04 02:58:57,964 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:58,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 151002 backedges. 19755 proven. 2765 refuted. 0 times theorem prover too weak. 128482 trivial. 0 not checked. [2018-02-04 02:59:00,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:00,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:59:00,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10044 backedges. 1115 proven. 104 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-02-04 02:59:00,905 INFO L182 omatonBuilderFactory]: Interpolants [93831#true, 93833#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 93832#false, 93835#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 93834#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 93837#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 93836#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 93839#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 93838#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 93841#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 93840#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 93843#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 93842#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 93845#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 93844#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 93847#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 93846#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 93849#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 93848#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 93851#(<= |foo_#in~size| 17), 93850#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 93853#(<= main_~i~1 18), 93852#(<= main_~i~1 17), 93854#(<= main_~i~1 19)] [2018-02-04 02:59:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 151002 backedges. 19755 proven. 2765 refuted. 0 times theorem prover too weak. 128482 trivial. 0 not checked. [2018-02-04 02:59:00,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:59:00,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:59:00,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=351, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:59:00,908 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-02-04 02:59:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:01,211 INFO L93 Difference]: Finished difference Result 749 states and 1395 transitions. [2018-02-04 02:59:01,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 02:59:01,211 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1585 [2018-02-04 02:59:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:01,215 INFO L225 Difference]: With dead ends: 749 [2018-02-04 02:59:01,215 INFO L226 Difference]: Without dead ends: 749 [2018-02-04 02:59:01,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=579, Invalid=1143, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:59:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-02-04 02:59:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 448. [2018-02-04 02:59:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 02:59:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-02-04 02:59:01,226 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1585 [2018-02-04 02:59:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:01,226 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-02-04 02:59:01,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:59:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-02-04 02:59:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1592 [2018-02-04 02:59:01,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:01,236 INFO L351 BasicCegarLoop]: trace histogram [239, 216, 216, 216, 216, 216, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:01,236 INFO L371 AbstractCegarLoop]: === Iteration 114 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:01,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1407304532, now seen corresponding path program 103 times [2018-02-04 02:59:01,237 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:01,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 152338 backedges. 22772 proven. 954 refuted. 0 times theorem prover too weak. 128612 trivial. 0 not checked. [2018-02-04 02:59:04,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:04,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:59:04,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 1225 proven. 0 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-02-04 02:59:04,356 INFO L182 omatonBuilderFactory]: Interpolants [95105#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 95104#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 95107#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 95106#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 95109#(<= |foo_#in~size| 18), 95108#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 95111#(<= main_~i~1 19), 95110#(<= main_~i~1 18), 95089#false, 95088#true, 95091#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 95090#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 95093#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 95092#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 95095#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 95094#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 95097#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 95096#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 95099#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 95098#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 95101#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 95100#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 95103#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 95102#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12))] [2018-02-04 02:59:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 152338 backedges. 22772 proven. 954 refuted. 0 times theorem prover too weak. 128612 trivial. 0 not checked. [2018-02-04 02:59:04,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:59:04,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:59:04,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:59:04,359 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-02-04 02:59:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:04,625 INFO L93 Difference]: Finished difference Result 641 states and 1137 transitions. [2018-02-04 02:59:04,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 02:59:04,625 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1591 [2018-02-04 02:59:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:04,627 INFO L225 Difference]: With dead ends: 641 [2018-02-04 02:59:04,628 INFO L226 Difference]: Without dead ends: 641 [2018-02-04 02:59:04,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 02:59:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-02-04 02:59:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 457. [2018-02-04 02:59:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-02-04 02:59:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 687 transitions. [2018-02-04 02:59:04,634 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 687 transitions. Word has length 1591 [2018-02-04 02:59:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:04,635 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 687 transitions. [2018-02-04 02:59:04,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:59:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 687 transitions. [2018-02-04 02:59:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1598 [2018-02-04 02:59:04,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:04,645 INFO L351 BasicCegarLoop]: trace histogram [240, 217, 217, 217, 217, 217, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:04,645 INFO L371 AbstractCegarLoop]: === Iteration 115 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:04,645 INFO L82 PathProgramCache]: Analyzing trace with hash 885707636, now seen corresponding path program 104 times [2018-02-04 02:59:04,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:04,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 153680 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 152116 trivial. 0 not checked. [2018-02-04 02:59:07,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:07,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:59:07,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10047 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10047 trivial. 0 not checked. [2018-02-04 02:59:07,657 INFO L182 omatonBuilderFactory]: Interpolants [96257#(<= main_~i~1 7), 96256#(<= main_~i~1 6), 96259#(<= main_~i~1 9), 96258#(<= main_~i~1 8), 96261#(<= main_~i~1 11), 96260#(<= main_~i~1 10), 96263#(<= main_~i~1 13), 96262#(<= main_~i~1 12), 96265#(<= main_~i~1 15), 96264#(<= main_~i~1 14), 96267#(<= main_~i~1 17), 96266#(<= main_~i~1 16), 96269#(<= main_~i~1 19), 96268#(<= main_~i~1 18), 96271#(<= main_~i~1 21), 96270#(<= main_~i~1 20), 96273#(<= main_~i~1 23), 96272#(<= main_~i~1 22), 96249#false, 96248#true, 96251#(<= main_~i~1 1), 96250#(= main_~i~1 0), 96253#(<= main_~i~1 3), 96252#(<= main_~i~1 2), 96255#(<= main_~i~1 5), 96254#(<= main_~i~1 4)] [2018-02-04 02:59:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 153680 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 152116 trivial. 0 not checked. [2018-02-04 02:59:07,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:59:07,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:59:07,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:59:07,660 INFO L87 Difference]: Start difference. First operand 457 states and 687 transitions. Second operand 26 states. [2018-02-04 02:59:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:07,840 INFO L93 Difference]: Finished difference Result 815 states and 1303 transitions. [2018-02-04 02:59:07,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:59:07,841 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1597 [2018-02-04 02:59:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:07,845 INFO L225 Difference]: With dead ends: 815 [2018-02-04 02:59:07,845 INFO L226 Difference]: Without dead ends: 815 [2018-02-04 02:59:07,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:59:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-02-04 02:59:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 468. [2018-02-04 02:59:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-02-04 02:59:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-02-04 02:59:07,854 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1597 [2018-02-04 02:59:07,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:07,855 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-02-04 02:59:07,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:59:07,855 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-02-04 02:59:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1670 [2018-02-04 02:59:07,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:07,866 INFO L351 BasicCegarLoop]: trace histogram [251, 227, 227, 227, 227, 227, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:07,866 INFO L371 AbstractCegarLoop]: === Iteration 116 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:07,866 INFO L82 PathProgramCache]: Analyzing trace with hash -396143739, now seen corresponding path program 105 times [2018-02-04 02:59:07,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:07,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 168162 backedges. 7676 proven. 7563 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-02-04 02:59:11,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:11,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:59:11,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11172 backedges. 670 proven. 434 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 02:59:11,033 INFO L182 omatonBuilderFactory]: Interpolants [97569#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 97568#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 97571#(<= main_~i~1 10), 97570#(<= |foo_#in~size| 10), 97573#(<= main_~i~1 12), 97572#(<= main_~i~1 11), 97575#(<= main_~i~1 14), 97574#(<= main_~i~1 13), 97577#(<= main_~i~1 16), 97576#(<= main_~i~1 15), 97579#(<= main_~i~1 18), 97578#(<= main_~i~1 17), 97557#true, 97559#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 97558#false, 97561#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 97560#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 97563#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 97562#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 97565#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 97564#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 97567#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 97566#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7))] [2018-02-04 02:59:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 168162 backedges. 7676 proven. 7563 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-02-04 02:59:11,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:59:11,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:59:11,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:59:11,036 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 23 states. [2018-02-04 02:59:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:11,291 INFO L93 Difference]: Finished difference Result 1262 states and 2668 transitions. [2018-02-04 02:59:11,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:59:11,291 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1669 [2018-02-04 02:59:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:11,298 INFO L225 Difference]: With dead ends: 1262 [2018-02-04 02:59:11,299 INFO L226 Difference]: Without dead ends: 1262 [2018-02-04 02:59:11,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=288, Invalid=834, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:59:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-02-04 02:59:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 471. [2018-02-04 02:59:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-04 02:59:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 731 transitions. [2018-02-04 02:59:11,321 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 731 transitions. Word has length 1669 [2018-02-04 02:59:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:11,321 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 731 transitions. [2018-02-04 02:59:11,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:59:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 731 transitions. [2018-02-04 02:59:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1676 [2018-02-04 02:59:11,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:11,332 INFO L351 BasicCegarLoop]: trace histogram [252, 228, 228, 228, 228, 228, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:11,333 INFO L371 AbstractCegarLoop]: === Iteration 117 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:11,333 INFO L82 PathProgramCache]: Analyzing trace with hash -62603059, now seen corresponding path program 106 times [2018-02-04 02:59:11,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:11,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 169572 backedges. 8338 proven. 8311 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-02-04 02:59:14,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:14,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:59:14,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11196 backedges. 652 proven. 476 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 02:59:14,609 INFO L182 omatonBuilderFactory]: Interpolants [99335#true, 99337#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 99336#false, 99339#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 99338#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 99341#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 99340#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 99343#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 99342#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 99345#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 99344#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 99347#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 99346#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 99349#(<= |foo_#in~size| 11), 99348#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 99351#(<= main_~i~1 12), 99350#(<= main_~i~1 11), 99353#(<= main_~i~1 14), 99352#(<= main_~i~1 13), 99355#(<= main_~i~1 16), 99354#(<= main_~i~1 15), 99357#(<= main_~i~1 18), 99356#(<= main_~i~1 17), 99358#(<= main_~i~1 19)] [2018-02-04 02:59:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 169572 backedges. 8338 proven. 8311 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-02-04 02:59:14,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:59:14,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:59:14,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:59:14,613 INFO L87 Difference]: Start difference. First operand 471 states and 731 transitions. Second operand 24 states. [2018-02-04 02:59:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:14,906 INFO L93 Difference]: Finished difference Result 1265 states and 2811 transitions. [2018-02-04 02:59:14,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 02:59:14,906 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1675 [2018-02-04 02:59:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:14,912 INFO L225 Difference]: With dead ends: 1265 [2018-02-04 02:59:14,913 INFO L226 Difference]: Without dead ends: 1265 [2018-02-04 02:59:14,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:59:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-02-04 02:59:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 471. [2018-02-04 02:59:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-04 02:59:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 731 transitions. [2018-02-04 02:59:14,932 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 731 transitions. Word has length 1675 [2018-02-04 02:59:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:14,932 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 731 transitions. [2018-02-04 02:59:14,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:59:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 731 transitions. [2018-02-04 02:59:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1682 [2018-02-04 02:59:14,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:14,943 INFO L351 BasicCegarLoop]: trace histogram [253, 229, 229, 229, 229, 229, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:14,943 INFO L371 AbstractCegarLoop]: === Iteration 118 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:14,943 INFO L82 PathProgramCache]: Analyzing trace with hash -882829291, now seen corresponding path program 107 times [2018-02-04 02:59:14,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:15,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 170988 backedges. 9000 proven. 9065 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-02-04 02:59:18,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:18,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:59:18,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 11238 backedges. 652 proven. 518 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 02:59:18,323 INFO L182 omatonBuilderFactory]: Interpolants [101121#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 101120#false, 101123#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 101122#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 101125#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 101124#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 101127#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 101126#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 101129#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 101128#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 101131#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 101130#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 101133#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 101132#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 101135#(<= main_~i~1 12), 101134#(<= |foo_#in~size| 12), 101137#(<= main_~i~1 14), 101136#(<= main_~i~1 13), 101139#(<= main_~i~1 16), 101138#(<= main_~i~1 15), 101141#(<= main_~i~1 18), 101140#(<= main_~i~1 17), 101143#(<= main_~i~1 20), 101142#(<= main_~i~1 19), 101119#true] [2018-02-04 02:59:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 170988 backedges. 9000 proven. 9065 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-02-04 02:59:18,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:59:18,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:59:18,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:59:18,326 INFO L87 Difference]: Start difference. First operand 471 states and 731 transitions. Second operand 25 states. [2018-02-04 02:59:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:18,648 INFO L93 Difference]: Finished difference Result 1265 states and 2811 transitions. [2018-02-04 02:59:18,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:59:18,648 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1681 [2018-02-04 02:59:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:18,656 INFO L225 Difference]: With dead ends: 1265 [2018-02-04 02:59:18,656 INFO L226 Difference]: Without dead ends: 1265 [2018-02-04 02:59:18,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=369, Invalid=1037, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:59:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-02-04 02:59:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 468. [2018-02-04 02:59:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-02-04 02:59:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-02-04 02:59:18,679 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1681 [2018-02-04 02:59:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:18,679 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-02-04 02:59:18,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:59:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-02-04 02:59:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1688 [2018-02-04 02:59:18,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:18,690 INFO L351 BasicCegarLoop]: trace histogram [254, 230, 230, 230, 230, 230, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:18,690 INFO L371 AbstractCegarLoop]: === Iteration 119 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:18,691 INFO L82 PathProgramCache]: Analyzing trace with hash -194979491, now seen corresponding path program 108 times [2018-02-04 02:59:18,691 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:18,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 172410 backedges. 10673 proven. 8714 refuted. 0 times theorem prover too weak. 153023 trivial. 0 not checked. [2018-02-04 02:59:22,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:22,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:59:22,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 11283 backedges. 735 proven. 480 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 02:59:22,079 INFO L182 omatonBuilderFactory]: Interpolants [102913#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 102912#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 102915#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 102914#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 102917#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 102916#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 102919#(<= |foo_#in~size| 13), 102918#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 102921#(<= main_~i~1 14), 102920#(<= main_~i~1 13), 102923#(<= main_~i~1 16), 102922#(<= main_~i~1 15), 102925#(<= main_~i~1 18), 102924#(<= main_~i~1 17), 102927#(<= main_~i~1 20), 102926#(<= main_~i~1 19), 102903#true, 102905#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 102904#false, 102907#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 102906#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 102909#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 102908#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 102911#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 102910#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-04 02:59:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 172410 backedges. 10673 proven. 8714 refuted. 0 times theorem prover too weak. 153023 trivial. 0 not checked. [2018-02-04 02:59:22,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:59:22,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:59:22,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:59:22,083 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 25 states. [2018-02-04 02:59:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:22,374 INFO L93 Difference]: Finished difference Result 1214 states and 2681 transitions. [2018-02-04 02:59:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 02:59:22,374 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1687 [2018-02-04 02:59:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:22,380 INFO L225 Difference]: With dead ends: 1214 [2018-02-04 02:59:22,381 INFO L226 Difference]: Without dead ends: 1214 [2018-02-04 02:59:22,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=404, Invalid=1078, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:59:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-02-04 02:59:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 468. [2018-02-04 02:59:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-02-04 02:59:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-02-04 02:59:22,398 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1687 [2018-02-04 02:59:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:22,398 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-02-04 02:59:22,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:59:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-02-04 02:59:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1694 [2018-02-04 02:59:22,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:22,409 INFO L351 BasicCegarLoop]: trace histogram [255, 231, 231, 231, 231, 231, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:22,409 INFO L371 AbstractCegarLoop]: === Iteration 120 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1517650971, now seen corresponding path program 109 times [2018-02-04 02:59:22,410 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:22,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 173838 backedges. 12580 proven. 8129 refuted. 0 times theorem prover too weak. 153129 trivial. 0 not checked. [2018-02-04 02:59:25,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:25,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:59:25,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 11319 backedges. 821 proven. 430 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 02:59:25,883 INFO L182 omatonBuilderFactory]: Interpolants [104641#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 104640#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 104643#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 104642#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 104645#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 104644#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 104647#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 104646#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 104649#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 104648#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 104651#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 104650#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 104653#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 104652#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 104655#(<= |foo_#in~size| 14), 104654#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 104657#(<= main_~i~1 15), 104656#(<= main_~i~1 14), 104659#(<= main_~i~1 17), 104658#(<= main_~i~1 16), 104661#(<= main_~i~1 19), 104660#(<= main_~i~1 18), 104662#(<= main_~i~1 20), 104639#false, 104638#true] [2018-02-04 02:59:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 173838 backedges. 12580 proven. 8129 refuted. 0 times theorem prover too weak. 153129 trivial. 0 not checked. [2018-02-04 02:59:25,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:59:25,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:59:25,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:59:25,887 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 25 states. [2018-02-04 02:59:26,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:26,214 INFO L93 Difference]: Finished difference Result 1151 states and 2518 transitions. [2018-02-04 02:59:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:59:26,214 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1693 [2018-02-04 02:59:26,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:26,220 INFO L225 Difference]: With dead ends: 1151 [2018-02-04 02:59:26,220 INFO L226 Difference]: Without dead ends: 1151 [2018-02-04 02:59:26,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=1117, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:59:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2018-02-04 02:59:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 468. [2018-02-04 02:59:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-02-04 02:59:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-02-04 02:59:26,237 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1693 [2018-02-04 02:59:26,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:26,238 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-02-04 02:59:26,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:59:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-02-04 02:59:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1700 [2018-02-04 02:59:26,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:26,249 INFO L351 BasicCegarLoop]: trace histogram [256, 232, 232, 232, 232, 232, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:26,249 INFO L371 AbstractCegarLoop]: === Iteration 121 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2021695405, now seen corresponding path program 110 times [2018-02-04 02:59:26,250 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:26,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 175272 backedges. 14739 proven. 7292 refuted. 0 times theorem prover too weak. 153241 trivial. 0 not checked. [2018-02-04 02:59:29,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:29,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:59:29,734 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 11349 backedges. 913 proven. 368 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 02:59:29,735 INFO L182 omatonBuilderFactory]: Interpolants [106313#false, 106312#true, 106315#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 106314#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 106317#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 106316#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 106319#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 106318#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 106321#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 106320#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 106323#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 106322#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 106325#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 106324#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 106327#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 106326#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 106329#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 106328#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 106331#(<= main_~i~1 15), 106330#(<= |foo_#in~size| 15), 106333#(<= main_~i~1 17), 106332#(<= main_~i~1 16), 106335#(<= main_~i~1 19), 106334#(<= main_~i~1 18), 106336#(<= main_~i~1 20)] [2018-02-04 02:59:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 175272 backedges. 14739 proven. 7292 refuted. 0 times theorem prover too weak. 153241 trivial. 0 not checked. [2018-02-04 02:59:29,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:59:29,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:59:29,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:59:29,738 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 25 states. [2018-02-04 02:59:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:30,076 INFO L93 Difference]: Finished difference Result 1076 states and 2321 transitions. [2018-02-04 02:59:30,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:59:30,076 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1699 [2018-02-04 02:59:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:30,081 INFO L225 Difference]: With dead ends: 1076 [2018-02-04 02:59:30,081 INFO L226 Difference]: Without dead ends: 1076 [2018-02-04 02:59:30,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=486, Invalid=1154, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:59:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-02-04 02:59:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 468. [2018-02-04 02:59:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-02-04 02:59:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-02-04 02:59:30,097 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1699 [2018-02-04 02:59:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:30,097 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-02-04 02:59:30,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:59:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-02-04 02:59:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1706 [2018-02-04 02:59:30,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:30,108 INFO L351 BasicCegarLoop]: trace histogram [257, 233, 233, 233, 233, 233, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:30,108 INFO L371 AbstractCegarLoop]: === Iteration 122 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1821092683, now seen corresponding path program 111 times [2018-02-04 02:59:30,109 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:30,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 176712 backedges. 17168 proven. 6185 refuted. 0 times theorem prover too weak. 153359 trivial. 0 not checked. [2018-02-04 02:59:33,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:33,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:59:33,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11373 backedges. 1011 proven. 294 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 02:59:33,590 INFO L182 omatonBuilderFactory]: Interpolants [107913#true, 107915#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 107914#false, 107917#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 107916#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 107919#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 107918#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 107921#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 107920#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 107923#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 107922#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 107925#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 107924#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 107927#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 107926#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 107929#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 107928#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 107931#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 107930#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 107933#(<= main_~i~1 16), 107932#(<= |foo_#in~size| 16), 107935#(<= main_~i~1 18), 107934#(<= main_~i~1 17), 107937#(<= main_~i~1 20), 107936#(<= main_~i~1 19)] [2018-02-04 02:59:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 176712 backedges. 17168 proven. 6185 refuted. 0 times theorem prover too weak. 153359 trivial. 0 not checked. [2018-02-04 02:59:33,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:59:33,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:59:33,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:59:33,593 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 25 states. [2018-02-04 02:59:33,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:33,945 INFO L93 Difference]: Finished difference Result 989 states and 2089 transitions. [2018-02-04 02:59:33,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 02:59:33,945 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1705 [2018-02-04 02:59:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:33,951 INFO L225 Difference]: With dead ends: 989 [2018-02-04 02:59:33,951 INFO L226 Difference]: Without dead ends: 989 [2018-02-04 02:59:33,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=533, Invalid=1189, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:59:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2018-02-04 02:59:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 468. [2018-02-04 02:59:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-02-04 02:59:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-02-04 02:59:33,967 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1705 [2018-02-04 02:59:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:33,968 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-02-04 02:59:33,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:59:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-02-04 02:59:33,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1712 [2018-02-04 02:59:33,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:33,980 INFO L351 BasicCegarLoop]: trace histogram [258, 234, 234, 234, 234, 234, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:33,980 INFO L371 AbstractCegarLoop]: === Iteration 123 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:33,980 INFO L82 PathProgramCache]: Analyzing trace with hash 609295101, now seen corresponding path program 112 times [2018-02-04 02:59:33,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:34,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 178158 backedges. 19885 proven. 4790 refuted. 0 times theorem prover too weak. 153483 trivial. 0 not checked. [2018-02-04 02:59:37,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:37,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:59:37,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11391 backedges. 1115 proven. 208 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 02:59:37,504 INFO L182 omatonBuilderFactory]: Interpolants [109441#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 109440#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 109443#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 109442#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 109445#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 109444#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 109447#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 109446#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 109449#(<= |foo_#in~size| 17), 109448#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 109451#(<= main_~i~1 18), 109450#(<= main_~i~1 17), 109453#(<= main_~i~1 20), 109452#(<= main_~i~1 19), 109429#true, 109431#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 109430#false, 109433#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 109432#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 109435#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 109434#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 109437#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 109436#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 109439#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 109438#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7))] [2018-02-04 02:59:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 178158 backedges. 19885 proven. 4790 refuted. 0 times theorem prover too weak. 153483 trivial. 0 not checked. [2018-02-04 02:59:37,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:59:37,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:59:37,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:59:37,508 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 25 states. [2018-02-04 02:59:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:37,841 INFO L93 Difference]: Finished difference Result 890 states and 1821 transitions. [2018-02-04 02:59:37,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 02:59:37,841 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1711 [2018-02-04 02:59:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:37,845 INFO L225 Difference]: With dead ends: 890 [2018-02-04 02:59:37,845 INFO L226 Difference]: Without dead ends: 890 [2018-02-04 02:59:37,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=584, Invalid=1222, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 02:59:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-02-04 02:59:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 468. [2018-02-04 02:59:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-02-04 02:59:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-02-04 02:59:37,858 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1711 [2018-02-04 02:59:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:37,858 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-02-04 02:59:37,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:59:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-02-04 02:59:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2018-02-04 02:59:37,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:37,870 INFO L351 BasicCegarLoop]: trace histogram [259, 235, 235, 235, 235, 235, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:37,870 INFO L371 AbstractCegarLoop]: === Iteration 124 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash 782557829, now seen corresponding path program 113 times [2018-02-04 02:59:37,870 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:37,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 179610 backedges. 22908 proven. 3089 refuted. 0 times theorem prover too weak. 153613 trivial. 0 not checked. [2018-02-04 02:59:41,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:41,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:59:41,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11403 backedges. 1225 proven. 110 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 02:59:41,402 INFO L182 omatonBuilderFactory]: Interpolants [110849#false, 110848#true, 110851#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 110850#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 110853#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 110852#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 110855#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 110854#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 110857#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 110856#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 110859#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 110858#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 110861#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 110860#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 110863#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 110862#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 110865#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 110864#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 110867#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 110866#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 110869#(<= |foo_#in~size| 18), 110868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 110871#(<= main_~i~1 19), 110870#(<= main_~i~1 18), 110872#(<= main_~i~1 20)] [2018-02-04 02:59:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 179610 backedges. 22908 proven. 3089 refuted. 0 times theorem prover too weak. 153613 trivial. 0 not checked. [2018-02-04 02:59:41,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:59:41,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:59:41,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=379, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:59:41,406 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 25 states. [2018-02-04 02:59:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:41,726 INFO L93 Difference]: Finished difference Result 783 states and 1520 transitions. [2018-02-04 02:59:41,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 02:59:41,727 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1717 [2018-02-04 02:59:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:41,731 INFO L225 Difference]: With dead ends: 783 [2018-02-04 02:59:41,731 INFO L226 Difference]: Without dead ends: 783 [2018-02-04 02:59:41,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=639, Invalid=1253, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 02:59:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-02-04 02:59:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 468. [2018-02-04 02:59:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-02-04 02:59:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-02-04 02:59:41,743 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1717 [2018-02-04 02:59:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:41,743 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-02-04 02:59:41,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:59:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-02-04 02:59:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1724 [2018-02-04 02:59:41,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:41,755 INFO L351 BasicCegarLoop]: trace histogram [260, 236, 236, 236, 236, 236, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:59:41,755 INFO L371 AbstractCegarLoop]: === Iteration 125 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:41,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1337717939, now seen corresponding path program 114 times [2018-02-04 02:59:41,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:41,823 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:59:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 181068 backedges. 26255 proven. 1064 refuted. 0 times theorem prover too weak. 153749 trivial. 0 not checked. [2018-02-04 02:59:45,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:45,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:59:45,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 11409 backedges. 1341 proven. 0 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 02:59:45,317 INFO L182 omatonBuilderFactory]: Interpolants [112163#false, 112162#true, 112165#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 112164#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 112167#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 112166#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 112169#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 112168#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 112171#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 112170#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 112173#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 112172#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 112175#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 112174#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 112177#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 112176#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 112179#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 112178#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 112181#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 112180#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 112183#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 19)), 112182#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 112185#(<= main_~i~1 19), 112184#(<= |foo_#in~size| 19), 112186#(<= main_~i~1 20)] [2018-02-04 02:59:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 181068 backedges. 26255 proven. 1064 refuted. 0 times theorem prover too weak. 153749 trivial. 0 not checked. [2018-02-04 02:59:45,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:59:45,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:59:45,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:59:45,321 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 25 states. [2018-02-04 02:59:45,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 02:59:45,321 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 02:59:45,325 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 02:59:45,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:59:45 BoogieIcfgContainer [2018-02-04 02:59:45,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:59:45,326 INFO L168 Benchmark]: Toolchain (without parser) took 181261.94 ms. Allocated memory was 399.0 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 357.1 MB in the beginning and 650.2 MB in the end (delta: -293.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-02-04 02:59:45,327 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:59:45,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 134.88 ms. Allocated memory is still 399.0 MB. Free memory was 357.1 MB in the beginning and 349.2 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 02:59:45,328 INFO L168 Benchmark]: Boogie Preprocessor took 25.75 ms. Allocated memory is still 399.0 MB. Free memory was 349.2 MB in the beginning and 346.5 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:59:45,328 INFO L168 Benchmark]: RCFGBuilder took 164.15 ms. Allocated memory is still 399.0 MB. Free memory was 346.5 MB in the beginning and 329.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-02-04 02:59:45,328 INFO L168 Benchmark]: TraceAbstraction took 180934.12 ms. Allocated memory was 399.0 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 329.6 MB in the beginning and 650.2 MB in the end (delta: -320.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-02-04 02:59:45,329 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.13 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 134.88 ms. Allocated memory is still 399.0 MB. Free memory was 357.1 MB in the beginning and 349.2 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.75 ms. Allocated memory is still 399.0 MB. Free memory was 349.2 MB in the beginning and 346.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 164.15 ms. Allocated memory is still 399.0 MB. Free memory was 346.5 MB in the beginning and 329.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 180934.12 ms. Allocated memory was 399.0 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 329.6 MB in the beginning and 650.2 MB in the end (delta: -320.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 2 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 2 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 2 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 2 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 2 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 2 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 180.8s OverallTime, 125 OverallIterations, 260 TraceHistogramMax, 26.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3835 SDtfs, 19309 SDslu, 32584 SDs, 0 SdLazy, 38613 SolverSat, 5235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3132 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 2882 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11338 ImplicationChecksByTransitivity, 15.9s Time, 0.2s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 7099811/7365843 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 124 MinimizatonAttempts, 31339 StatesRemovedByMinimization, 123 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 115.0s InterpolantComputationTime, 107196 NumberOfCodeBlocks, 107196 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 107071 ConstructedInterpolants, 0 QuantifiedInterpolants, 176538029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 125 InterpolantComputations, 5 PerfectInterpolantSequences, 7099811/7365843 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/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-59-45-336.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-59-45-336.csv Completed graceful shutdown