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_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:11:15,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:11:15,221 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:11:15,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:11:15,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:11:15,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:11:15,235 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:11:15,237 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:11:15,238 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:11:15,239 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:11:15,240 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:11:15,240 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:11:15,241 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:11:15,242 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:11:15,242 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:11:15,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:11:15,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:11:15,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:11:15,246 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:11:15,247 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:11:15,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:11:15,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:11:15,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:11:15,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:11:15,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:11:15,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:11:15,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:11:15,251 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:11:15,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:11:15,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:11:15,251 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:11:15,251 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_NoArray.epf [2018-02-04 04:11:15,258 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:11:15,258 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:11:15,259 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:11:15,259 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:11:15,259 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:11:15,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:11:15,260 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:11:15,260 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:11:15,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:11:15,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:11:15,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:11:15,260 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:11:15,260 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:11:15,260 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:11:15,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:11:15,260 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:11:15,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:11:15,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:11:15,261 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:11:15,261 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:11:15,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:11:15,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:11:15,261 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:11:15,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:11:15,261 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:11:15,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:11:15,301 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:11:15,304 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:11:15,306 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:11:15,306 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:11:15,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-02-04 04:11:15,418 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:11:15,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:11:15,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:11:15,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:11:15,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:11:15,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fffaf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15, skipping insertion in model container [2018-02-04 04:11:15,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,441 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:11:15,453 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:11:15,539 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:11:15,550 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:11:15,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15 WrapperNode [2018-02-04 04:11:15,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:11:15,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:11:15,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:11:15,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:11:15,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:11:15,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:11:15,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:11:15,584 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:11:15,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (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 04:11:15,621 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:11:15,621 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:11:15,621 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 04:11:15,621 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:11:15,622 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:11:15,622 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:11:15,622 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:11:15,622 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:11:15,622 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:11:15,622 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 04:11:15,622 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:11:15,622 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:11:15,623 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:11:15,755 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:11:15,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:11:15 BoogieIcfgContainer [2018-02-04 04:11:15,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:11:15,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:11:15,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:11:15,758 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:11:15,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:11:15" (1/3) ... [2018-02-04 04:11:15,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60413bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:11:15, skipping insertion in model container [2018-02-04 04:11:15,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (2/3) ... [2018-02-04 04:11:15,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60413bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:11:15, skipping insertion in model container [2018-02-04 04:11:15,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:11:15" (3/3) ... [2018-02-04 04:11:15,761 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-02-04 04:11:15,766 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:11:15,771 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 04:11:15,796 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:11:15,797 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:11:15,797 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:11:15,797 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:11:15,797 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:11:15,797 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:11:15,797 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:11:15,797 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:11:15,798 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:11:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 04:11:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 04:11:15,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:15,817 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:15,817 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 04:11:15,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:15,823 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:15,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:15,852 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:15,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:15,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:11:15,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:15,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:11:15,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:11:15,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:11:15,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:11:15,967 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 04:11:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,015 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 04:11:16,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:11:16,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 04:11:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,022 INFO L225 Difference]: With dead ends: 63 [2018-02-04 04:11:16,022 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 04:11:16,023 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 04:11:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 04:11:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 04:11:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 04:11:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 04:11:16,099 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 04:11:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,099 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 04:11:16,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:11:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 04:11:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:11:16,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,100 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:16,100 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 04:11:16,100 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,100 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,101 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:11:16,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:16,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:11:16,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:11:16,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:11:16,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:11:16,138 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-04 04:11:16,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,168 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 04:11:16,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:11:16,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 04:11:16,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,170 INFO L225 Difference]: With dead ends: 60 [2018-02-04 04:11:16,170 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 04:11:16,170 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 04:11:16,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 04:11:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-04 04:11:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 04:11:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-04 04:11:16,174 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-04 04:11:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,174 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-04 04:11:16,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:11:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-04 04:11:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:11:16,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,175 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:16,175 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,175 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 04:11:16,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,176 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:11:16,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:16,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:11:16,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:11:16,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:11:16,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:11:16,298 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-04 04:11:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,398 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 04:11:16,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:11:16,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 04:11:16,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,400 INFO L225 Difference]: With dead ends: 54 [2018-02-04 04:11:16,400 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 04:11:16,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:11:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 04:11:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 04:11:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 04:11:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-04 04:11:16,405 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-04 04:11:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,405 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-04 04:11:16,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:11:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-04 04:11:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:11:16,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,406 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:16,406 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,406 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 04:11:16,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,407 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,408 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:11:16,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:16,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:11:16,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:11:16,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:11:16,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:11:16,446 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-04 04:11:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,480 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 04:11:16,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:11:16,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:11:16,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,481 INFO L225 Difference]: With dead ends: 50 [2018-02-04 04:11:16,481 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 04:11:16,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:11:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 04:11:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 04:11:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 04:11:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 04:11:16,484 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-04 04:11:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,484 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 04:11:16,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:11:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 04:11:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:11:16,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,485 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:16,485 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 04:11:16,485 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,485 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,486 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:11:16,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:16,531 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:16,532 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:11:16,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:16,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-04 04:11:16,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:11:16,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:11:16,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:11:16,573 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-02-04 04:11:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,600 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-02-04 04:11:16,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:11:16,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 04:11:16,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,602 INFO L225 Difference]: With dead ends: 65 [2018-02-04 04:11:16,602 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 04:11:16,602 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:11:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 04:11:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-02-04 04:11:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 04:11:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-02-04 04:11:16,607 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-02-04 04:11:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,607 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-02-04 04:11:16,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:11:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-02-04 04:11:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:11:16,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,608 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 04:11:16,608 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-04 04:11:16,608 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,608 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,609 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,643 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 04:11:16,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:16,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:11:16,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:11:16,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:11:16,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:11:16,644 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-02-04 04:11:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,682 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-04 04:11:16,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:11:16,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 04:11:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,683 INFO L225 Difference]: With dead ends: 66 [2018-02-04 04:11:16,683 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 04:11:16,684 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 04:11:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 04:11:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-02-04 04:11:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 04:11:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 04:11:16,686 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2018-02-04 04:11:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,686 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 04:11:16,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:11:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 04:11:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 04:11:16,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,687 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:16,687 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,687 INFO L82 PathProgramCache]: Analyzing trace with hash -280350351, now seen corresponding path program 2 times [2018-02-04 04:11:16,687 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,687 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:11:16,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:16,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:16,745 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:16,761 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:11:16,761 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:16,763 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:11:16,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:11:16,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2018-02-04 04:11:16,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:11:16,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:11:16,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:11:16,805 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 12 states. [2018-02-04 04:11:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,920 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-02-04 04:11:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:11:16,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-04 04:11:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,922 INFO L225 Difference]: With dead ends: 88 [2018-02-04 04:11:16,922 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 04:11:16,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:11:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 04:11:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-02-04 04:11:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 04:11:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-04 04:11:16,927 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2018-02-04 04:11:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,928 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-04 04:11:16,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:11:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-04 04:11:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 04:11:16,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,929 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 04:11:16,929 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-04 04:11:16,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,929 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,930 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:16,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,957 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 04:11:16,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:16,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:16,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:16,978 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 04:11:16,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:16,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-04 04:11:16,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:11:16,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:11:16,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:11:16,980 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 5 states. [2018-02-04 04:11:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:17,012 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-02-04 04:11:17,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:11:17,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-04 04:11:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:17,013 INFO L225 Difference]: With dead ends: 98 [2018-02-04 04:11:17,013 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 04:11:17,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 04:11:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 04:11:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-02-04 04:11:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 04:11:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-04 04:11:17,018 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 31 [2018-02-04 04:11:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:17,019 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-04 04:11:17,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:11:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-04 04:11:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 04:11:17,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:17,020 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:17,020 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash -193392944, now seen corresponding path program 1 times [2018-02-04 04:11:17,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:17,020 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:17,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:17,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 04:11:17,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:17,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:11:17,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:11:17,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:11:17,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:11:17,072 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-04 04:11:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:17,144 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-02-04 04:11:17,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:11:17,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-02-04 04:11:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:17,145 INFO L225 Difference]: With dead ends: 87 [2018-02-04 04:11:17,145 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 04:11:17,145 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:11:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 04:11:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 04:11:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 04:11:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 04:11:17,150 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 40 [2018-02-04 04:11:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:17,150 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 04:11:17,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:11:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 04:11:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 04:11:17,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:17,153 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:17,153 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:17,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1033895800, now seen corresponding path program 2 times [2018-02-04 04:11:17,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:17,154 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:17,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:17,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 04:11:17,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:17,203 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:17,204 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:17,214 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:11:17,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:17,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 04:11:17,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:17,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 04:11:17,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:11:17,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:11:17,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:11:17,246 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 8 states. [2018-02-04 04:11:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:17,309 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-04 04:11:17,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:11:17,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 04:11:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:17,310 INFO L225 Difference]: With dead ends: 90 [2018-02-04 04:11:17,310 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 04:11:17,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:11:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 04:11:17,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-02-04 04:11:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 04:11:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-02-04 04:11:17,314 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2018-02-04 04:11:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:17,315 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-02-04 04:11:17,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:11:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-02-04 04:11:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 04:11:17,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:17,316 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:17,316 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:17,316 INFO L82 PathProgramCache]: Analyzing trace with hash -821508032, now seen corresponding path program 3 times [2018-02-04 04:11:17,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:17,317 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:17,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,317 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:17,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:11:17,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:17,366 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:17,367 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:11:17,377 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 04:11:17,378 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:17,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 37 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 04:11:17,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:17,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 11 [2018-02-04 04:11:17,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:11:17,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:11:17,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:11:17,424 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 12 states. [2018-02-04 04:11:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:17,634 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-02-04 04:11:17,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:11:17,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-02-04 04:11:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:17,635 INFO L225 Difference]: With dead ends: 150 [2018-02-04 04:11:17,636 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 04:11:17,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:11:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 04:11:17,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 113. [2018-02-04 04:11:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:11:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-02-04 04:11:17,641 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 52 [2018-02-04 04:11:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:17,642 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-02-04 04:11:17,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:11:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-02-04 04:11:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 04:11:17,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:17,643 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:17,643 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 1 times [2018-02-04 04:11:17,644 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:17,644 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:17,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,644 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:17,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 04:11:17,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:17,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:17,715 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-04 04:11:17,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:17,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-02-04 04:11:17,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:11:17,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:11:17,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:11:17,760 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 11 states. [2018-02-04 04:11:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:17,844 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-04 04:11:17,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:11:17,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-02-04 04:11:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:17,845 INFO L225 Difference]: With dead ends: 133 [2018-02-04 04:11:17,845 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 04:11:17,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:11:17,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 04:11:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 92. [2018-02-04 04:11:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 04:11:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-02-04 04:11:17,851 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 67 [2018-02-04 04:11:17,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:17,851 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-02-04 04:11:17,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:11:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-02-04 04:11:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 04:11:17,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:17,853 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:17,853 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash 737150591, now seen corresponding path program 4 times [2018-02-04 04:11:17,853 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:17,853 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:17,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:17,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 181 proven. 10 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-02-04 04:11:17,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:17,919 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:17,919 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:11:17,930 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:11:17,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:17,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 178 proven. 14 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-04 04:11:18,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:18,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-02-04 04:11:18,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:11:18,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:11:18,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:11:18,045 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 17 states. [2018-02-04 04:11:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:18,360 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-02-04 04:11:18,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:11:18,361 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-02-04 04:11:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:18,361 INFO L225 Difference]: With dead ends: 157 [2018-02-04 04:11:18,361 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 04:11:18,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:11:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 04:11:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2018-02-04 04:11:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 04:11:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-02-04 04:11:18,365 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 88 [2018-02-04 04:11:18,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:18,366 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-02-04 04:11:18,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:11:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-02-04 04:11:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 04:11:18,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:18,367 INFO L351 BasicCegarLoop]: trace histogram [16, 13, 12, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:18,367 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:18,367 INFO L82 PathProgramCache]: Analyzing trace with hash 347418750, now seen corresponding path program 5 times [2018-02-04 04:11:18,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:18,367 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:18,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:18,368 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:18,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:18,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 04:11:18,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:18,503 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:18,504 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:11:18,538 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 04:11:18,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:18,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 04:11:18,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:18,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-02-04 04:11:18,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:11:18,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:11:18,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:11:18,597 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 14 states. [2018-02-04 04:11:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:18,680 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-02-04 04:11:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:11:18,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-02-04 04:11:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:18,681 INFO L225 Difference]: With dead ends: 152 [2018-02-04 04:11:18,688 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 04:11:18,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:11:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 04:11:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-02-04 04:11:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 04:11:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-04 04:11:18,692 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 124 [2018-02-04 04:11:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:18,692 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-04 04:11:18,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:11:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-04 04:11:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-02-04 04:11:18,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:18,694 INFO L351 BasicCegarLoop]: trace histogram [17, 14, 13, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:18,694 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:18,694 INFO L82 PathProgramCache]: Analyzing trace with hash 714000310, now seen corresponding path program 6 times [2018-02-04 04:11:18,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:18,694 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:18,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:18,695 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:18,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:18,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-04 04:11:18,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:18,798 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:18,798 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:11:18,825 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-04 04:11:18,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:18,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-04 04:11:18,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:18,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 04:11:18,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:11:18,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:11:18,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:11:18,851 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 7 states. [2018-02-04 04:11:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:18,909 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2018-02-04 04:11:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:11:18,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-02-04 04:11:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:18,910 INFO L225 Difference]: With dead ends: 155 [2018-02-04 04:11:18,910 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 04:11:18,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:11:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 04:11:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2018-02-04 04:11:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 04:11:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2018-02-04 04:11:18,914 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 130 [2018-02-04 04:11:18,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:18,915 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2018-02-04 04:11:18,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:11:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2018-02-04 04:11:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-04 04:11:18,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:18,917 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 14, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:18,917 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1770915246, now seen corresponding path program 7 times [2018-02-04 04:11:18,917 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:18,917 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:18,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:18,918 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:18,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:18,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 04:11:19,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:19,015 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:19,015 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:19,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 411 proven. 30 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 04:11:19,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:19,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-02-04 04:11:19,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:11:19,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:11:19,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:11:19,122 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 21 states. [2018-02-04 04:11:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:19,313 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2018-02-04 04:11:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:11:19,313 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 136 [2018-02-04 04:11:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:19,314 INFO L225 Difference]: With dead ends: 196 [2018-02-04 04:11:19,314 INFO L226 Difference]: Without dead ends: 196 [2018-02-04 04:11:19,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:11:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-04 04:11:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2018-02-04 04:11:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 04:11:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 192 transitions. [2018-02-04 04:11:19,317 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 192 transitions. Word has length 136 [2018-02-04 04:11:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:19,318 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 192 transitions. [2018-02-04 04:11:19,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:11:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 192 transitions. [2018-02-04 04:11:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 04:11:19,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:19,320 INFO L351 BasicCegarLoop]: trace histogram [23, 19, 18, 18, 18, 18, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:19,320 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1745720749, now seen corresponding path program 8 times [2018-02-04 04:11:19,320 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:19,320 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:19,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:19,321 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:19,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:19,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-04 04:11:19,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:19,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:19,426 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:19,442 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:11:19,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:19,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-04 04:11:19,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:19,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-02-04 04:11:19,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:11:19,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:11:19,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:11:19,506 INFO L87 Difference]: Start difference. First operand 188 states and 192 transitions. Second operand 17 states. [2018-02-04 04:11:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:19,710 INFO L93 Difference]: Finished difference Result 200 states and 202 transitions. [2018-02-04 04:11:19,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:11:19,711 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 172 [2018-02-04 04:11:19,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:19,712 INFO L225 Difference]: With dead ends: 200 [2018-02-04 04:11:19,712 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 04:11:19,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:11:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 04:11:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2018-02-04 04:11:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 04:11:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-02-04 04:11:19,717 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 172 [2018-02-04 04:11:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:19,717 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-02-04 04:11:19,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:11:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-02-04 04:11:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-04 04:11:19,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:19,719 INFO L351 BasicCegarLoop]: trace histogram [24, 20, 19, 19, 19, 19, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:19,719 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash 655613349, now seen corresponding path program 9 times [2018-02-04 04:11:19,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:19,720 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:19,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:19,721 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:19,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:19,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-02-04 04:11:19,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:19,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:19,826 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:11:19,848 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 04:11:19,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:19,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 536 proven. 57 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2018-02-04 04:11:19,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:19,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-02-04 04:11:19,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:11:19,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:11:19,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:11:19,976 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 18 states. [2018-02-04 04:11:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:20,213 INFO L93 Difference]: Finished difference Result 256 states and 261 transitions. [2018-02-04 04:11:20,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:11:20,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 178 [2018-02-04 04:11:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:20,215 INFO L225 Difference]: With dead ends: 256 [2018-02-04 04:11:20,215 INFO L226 Difference]: Without dead ends: 256 [2018-02-04 04:11:20,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:11:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-04 04:11:20,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 236. [2018-02-04 04:11:20,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 04:11:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 240 transitions. [2018-02-04 04:11:20,219 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 240 transitions. Word has length 178 [2018-02-04 04:11:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:20,219 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 240 transitions. [2018-02-04 04:11:20,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:11:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 240 transitions. [2018-02-04 04:11:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-02-04 04:11:20,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:20,221 INFO L351 BasicCegarLoop]: trace histogram [31, 26, 25, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:20,221 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:20,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1371544148, now seen corresponding path program 10 times [2018-02-04 04:11:20,221 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:20,221 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:20,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:20,222 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:20,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:20,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1404 proven. 70 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-02-04 04:11:20,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:20,421 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:20,422 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:11:20,449 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:11:20,449 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:20,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1256 proven. 274 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-02-04 04:11:20,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:20,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 30 [2018-02-04 04:11:20,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 04:11:20,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 04:11:20,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:11:20,689 INFO L87 Difference]: Start difference. First operand 236 states and 240 transitions. Second operand 30 states. [2018-02-04 04:11:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:21,271 INFO L93 Difference]: Finished difference Result 256 states and 258 transitions. [2018-02-04 04:11:21,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 04:11:21,271 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 226 [2018-02-04 04:11:21,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:21,272 INFO L225 Difference]: With dead ends: 256 [2018-02-04 04:11:21,272 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 04:11:21,273 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=412, Invalid=2240, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 04:11:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 04:11:21,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2018-02-04 04:11:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 04:11:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 244 transitions. [2018-02-04 04:11:21,278 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 244 transitions. Word has length 226 [2018-02-04 04:11:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:21,278 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 244 transitions. [2018-02-04 04:11:21,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 04:11:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 244 transitions. [2018-02-04 04:11:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 04:11:21,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:21,280 INFO L351 BasicCegarLoop]: trace histogram [32, 27, 26, 26, 26, 26, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:21,280 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:21,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1000315148, now seen corresponding path program 11 times [2018-02-04 04:11:21,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:21,280 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:21,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:21,281 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:21,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:21,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 04:11:21,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:21,440 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:21,441 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:11:21,532 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-04 04:11:21,532 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:21,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 04:11:21,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:21,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-02-04 04:11:21,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:11:21,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:11:21,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:11:21,634 INFO L87 Difference]: Start difference. First operand 242 states and 244 transitions. Second operand 17 states. [2018-02-04 04:11:21,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:21,722 INFO L93 Difference]: Finished difference Result 257 states and 260 transitions. [2018-02-04 04:11:21,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:11:21,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 232 [2018-02-04 04:11:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:21,723 INFO L225 Difference]: With dead ends: 257 [2018-02-04 04:11:21,723 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 04:11:21,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:11:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 04:11:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 248. [2018-02-04 04:11:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 04:11:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 251 transitions. [2018-02-04 04:11:21,728 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 251 transitions. Word has length 232 [2018-02-04 04:11:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:21,729 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 251 transitions. [2018-02-04 04:11:21,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:11:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 251 transitions. [2018-02-04 04:11:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-04 04:11:21,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:21,730 INFO L351 BasicCegarLoop]: trace histogram [33, 28, 27, 27, 27, 27, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:21,730 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 710278788, now seen corresponding path program 12 times [2018-02-04 04:11:21,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:21,731 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:21,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:21,732 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:21,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:21,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1112 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-02-04 04:11:21,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:21,997 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:21,998 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:11:22,095 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-02-04 04:11:22,096 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:22,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 980 proven. 147 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 04:11:22,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:22,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 27 [2018-02-04 04:11:22,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:11:22,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:11:22,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:11:22,246 INFO L87 Difference]: Start difference. First operand 248 states and 251 transitions. Second operand 27 states. [2018-02-04 04:11:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:22,840 INFO L93 Difference]: Finished difference Result 325 states and 330 transitions. [2018-02-04 04:11:22,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 04:11:22,840 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 238 [2018-02-04 04:11:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:22,841 INFO L225 Difference]: With dead ends: 325 [2018-02-04 04:11:22,841 INFO L226 Difference]: Without dead ends: 325 [2018-02-04 04:11:22,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=487, Invalid=1865, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:11:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-04 04:11:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 308. [2018-02-04 04:11:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 04:11:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 313 transitions. [2018-02-04 04:11:22,845 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 313 transitions. Word has length 238 [2018-02-04 04:11:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:22,845 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 313 transitions. [2018-02-04 04:11:22,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:11:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 313 transitions. [2018-02-04 04:11:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 04:11:22,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:22,846 INFO L351 BasicCegarLoop]: trace histogram [41, 35, 34, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:22,846 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2034889173, now seen corresponding path program 13 times [2018-02-04 04:11:22,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:22,847 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:22,847 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:22,847 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:22,847 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:22,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 2399 proven. 102 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2018-02-04 04:11:23,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:23,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:23,070 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:23,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1632 proven. 114 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-02-04 04:11:23,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:23,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2018-02-04 04:11:23,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 04:11:23,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 04:11:23,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:11:23,414 INFO L87 Difference]: Start difference. First operand 308 states and 313 transitions. Second operand 33 states. [2018-02-04 04:11:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:24,019 INFO L93 Difference]: Finished difference Result 385 states and 389 transitions. [2018-02-04 04:11:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 04:11:24,020 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 292 [2018-02-04 04:11:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:24,021 INFO L225 Difference]: With dead ends: 385 [2018-02-04 04:11:24,021 INFO L226 Difference]: Without dead ends: 376 [2018-02-04 04:11:24,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=431, Invalid=2761, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 04:11:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-02-04 04:11:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2018-02-04 04:11:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 04:11:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 372 transitions. [2018-02-04 04:11:24,025 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 372 transitions. Word has length 292 [2018-02-04 04:11:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:24,026 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 372 transitions. [2018-02-04 04:11:24,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 04:11:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 372 transitions. [2018-02-04 04:11:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-02-04 04:11:24,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:24,027 INFO L351 BasicCegarLoop]: trace histogram [50, 43, 42, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:24,027 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:24,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1060515318, now seen corresponding path program 14 times [2018-02-04 04:11:24,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:24,028 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:24,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:24,028 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:24,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:24,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-02-04 04:11:24,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:24,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:24,380 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:24,426 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:11:24,426 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:24,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-02-04 04:11:24,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:24,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-02-04 04:11:24,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:11:24,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:11:24,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:11:24,644 INFO L87 Difference]: Start difference. First operand 368 states and 372 transitions. Second operand 26 states. [2018-02-04 04:11:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:24,924 INFO L93 Difference]: Finished difference Result 380 states and 382 transitions. [2018-02-04 04:11:24,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:11:24,924 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 352 [2018-02-04 04:11:24,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:24,926 INFO L225 Difference]: With dead ends: 380 [2018-02-04 04:11:24,926 INFO L226 Difference]: Without dead ends: 374 [2018-02-04 04:11:24,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:11:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-02-04 04:11:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2018-02-04 04:11:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 04:11:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 370 transitions. [2018-02-04 04:11:24,932 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 370 transitions. Word has length 352 [2018-02-04 04:11:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:24,933 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 370 transitions. [2018-02-04 04:11:24,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 04:11:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 370 transitions. [2018-02-04 04:11:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-02-04 04:11:24,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:24,935 INFO L351 BasicCegarLoop]: trace histogram [51, 44, 43, 43, 43, 43, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:24,935 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:24,936 INFO L82 PathProgramCache]: Analyzing trace with hash -211464126, now seen corresponding path program 15 times [2018-02-04 04:11:24,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:24,936 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:24,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:24,937 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:24,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:24,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-02-04 04:11:25,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:25,198 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:25,199 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:11:25,263 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-02-04 04:11:25,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:25,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-02-04 04:11:25,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:25,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-02-04 04:11:25,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:11:25,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:11:25,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:11:25,464 INFO L87 Difference]: Start difference. First operand 368 states and 370 transitions. Second operand 21 states. [2018-02-04 04:11:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:25,792 INFO L93 Difference]: Finished difference Result 383 states and 386 transitions. [2018-02-04 04:11:25,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:11:25,792 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 358 [2018-02-04 04:11:25,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:25,794 INFO L225 Difference]: With dead ends: 383 [2018-02-04 04:11:25,794 INFO L226 Difference]: Without dead ends: 383 [2018-02-04 04:11:25,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:11:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-04 04:11:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2018-02-04 04:11:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-04 04:11:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 377 transitions. [2018-02-04 04:11:25,800 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 377 transitions. Word has length 358 [2018-02-04 04:11:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:25,801 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 377 transitions. [2018-02-04 04:11:25,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:11:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 377 transitions. [2018-02-04 04:11:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-02-04 04:11:25,803 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:25,803 INFO L351 BasicCegarLoop]: trace histogram [52, 45, 44, 44, 44, 44, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:25,803 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash -146344646, now seen corresponding path program 16 times [2018-02-04 04:11:25,803 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:25,803 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:25,804 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:25,804 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:25,804 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:25,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 2359 proven. 180 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-02-04 04:11:26,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:26,273 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:26,273 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:11:26,302 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:11:26,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:26,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 3433 proven. 652 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-02-04 04:11:26,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:26,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 42 [2018-02-04 04:11:26,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 04:11:26,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 04:11:26,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1421, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:11:26,763 INFO L87 Difference]: Start difference. First operand 374 states and 377 transitions. Second operand 42 states. [2018-02-04 04:11:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:27,570 INFO L93 Difference]: Finished difference Result 454 states and 458 transitions. [2018-02-04 04:11:27,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 04:11:27,570 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 364 [2018-02-04 04:11:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:27,572 INFO L225 Difference]: With dead ends: 454 [2018-02-04 04:11:27,572 INFO L226 Difference]: Without dead ends: 454 [2018-02-04 04:11:27,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=879, Invalid=3677, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:11:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-02-04 04:11:27,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 446. [2018-02-04 04:11:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-04 04:11:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 450 transitions. [2018-02-04 04:11:27,579 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 450 transitions. Word has length 364 [2018-02-04 04:11:27,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:27,579 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 450 transitions. [2018-02-04 04:11:27,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 04:11:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 450 transitions. [2018-02-04 04:11:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-02-04 04:11:27,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:27,581 INFO L351 BasicCegarLoop]: trace histogram [62, 54, 53, 53, 53, 53, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:27,581 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1459193583, now seen corresponding path program 17 times [2018-02-04 04:11:27,581 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:27,581 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:27,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:27,582 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:27,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:27,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-04 04:11:27,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:27,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:27,848 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:11:28,055 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-02-04 04:11:28,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:28,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-04 04:11:28,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:28,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-04 04:11:28,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:11:28,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:11:28,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:11:28,244 INFO L87 Difference]: Start difference. First operand 446 states and 450 transitions. Second operand 23 states. [2018-02-04 04:11:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:28,509 INFO L93 Difference]: Finished difference Result 461 states and 466 transitions. [2018-02-04 04:11:28,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:11:28,509 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 430 [2018-02-04 04:11:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:28,511 INFO L225 Difference]: With dead ends: 461 [2018-02-04 04:11:28,511 INFO L226 Difference]: Without dead ends: 461 [2018-02-04 04:11:28,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:11:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-04 04:11:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 452. [2018-02-04 04:11:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 04:11:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 457 transitions. [2018-02-04 04:11:28,517 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 457 transitions. Word has length 430 [2018-02-04 04:11:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:28,518 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 457 transitions. [2018-02-04 04:11:28,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:11:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 457 transitions. [2018-02-04 04:11:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-02-04 04:11:28,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:28,520 INFO L351 BasicCegarLoop]: trace histogram [63, 55, 54, 54, 54, 54, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:28,520 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:28,521 INFO L82 PathProgramCache]: Analyzing trace with hash -275511607, now seen corresponding path program 18 times [2018-02-04 04:11:28,521 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:28,521 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:28,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:28,522 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:28,522 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:28,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 3227 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-02-04 04:11:29,116 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:29,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:29,117 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:11:29,201 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-02-04 04:11:29,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:29,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 4033 proven. 1197 refuted. 0 times theorem prover too weak. 4774 trivial. 0 not checked. [2018-02-04 04:11:29,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:29,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 37 [2018-02-04 04:11:29,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:11:29,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:11:29,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:11:29,480 INFO L87 Difference]: Start difference. First operand 452 states and 457 transitions. Second operand 37 states. [2018-02-04 04:11:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:30,236 INFO L93 Difference]: Finished difference Result 535 states and 542 transitions. [2018-02-04 04:11:30,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 04:11:30,239 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 436 [2018-02-04 04:11:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:30,241 INFO L225 Difference]: With dead ends: 535 [2018-02-04 04:11:30,241 INFO L226 Difference]: Without dead ends: 535 [2018-02-04 04:11:30,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=866, Invalid=3294, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:11:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-04 04:11:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 527. [2018-02-04 04:11:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-02-04 04:11:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 534 transitions. [2018-02-04 04:11:30,249 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 534 transitions. Word has length 436 [2018-02-04 04:11:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:30,250 INFO L432 AbstractCegarLoop]: Abstraction has 527 states and 534 transitions. [2018-02-04 04:11:30,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:11:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 534 transitions. [2018-02-04 04:11:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-02-04 04:11:30,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:30,253 INFO L351 BasicCegarLoop]: trace histogram [73, 64, 63, 63, 63, 63, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:30,253 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:30,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1015516064, now seen corresponding path program 19 times [2018-02-04 04:11:30,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:30,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:30,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:30,254 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:30,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:30,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-02-04 04:11:30,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:30,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:30,849 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:30,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-02-04 04:11:31,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:31,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-02-04 04:11:31,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 04:11:31,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 04:11:31,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:11:31,182 INFO L87 Difference]: Start difference. First operand 527 states and 534 transitions. Second operand 32 states. [2018-02-04 04:11:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:31,615 INFO L93 Difference]: Finished difference Result 545 states and 548 transitions. [2018-02-04 04:11:31,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:11:31,616 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 502 [2018-02-04 04:11:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:31,617 INFO L225 Difference]: With dead ends: 545 [2018-02-04 04:11:31,617 INFO L226 Difference]: Without dead ends: 524 [2018-02-04 04:11:31,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=375, Invalid=1185, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 04:11:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-02-04 04:11:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 518. [2018-02-04 04:11:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-02-04 04:11:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 520 transitions. [2018-02-04 04:11:31,625 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 520 transitions. Word has length 502 [2018-02-04 04:11:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:31,625 INFO L432 AbstractCegarLoop]: Abstraction has 518 states and 520 transitions. [2018-02-04 04:11:31,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 04:11:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 520 transitions. [2018-02-04 04:11:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-02-04 04:11:31,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:31,628 INFO L351 BasicCegarLoop]: trace histogram [74, 65, 64, 64, 64, 64, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:31,628 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1558061400, now seen corresponding path program 20 times [2018-02-04 04:11:31,629 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:31,629 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:31,629 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:31,630 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:31,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:31,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-02-04 04:11:32,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:32,052 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:32,052 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:32,096 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:11:32,096 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:32,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-02-04 04:11:32,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:32,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-04 04:11:32,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:11:32,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:11:32,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:11:32,234 INFO L87 Difference]: Start difference. First operand 518 states and 520 transitions. Second operand 15 states. [2018-02-04 04:11:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:32,361 INFO L93 Difference]: Finished difference Result 533 states and 536 transitions. [2018-02-04 04:11:32,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:11:32,362 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 508 [2018-02-04 04:11:32,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:32,363 INFO L225 Difference]: With dead ends: 533 [2018-02-04 04:11:32,363 INFO L226 Difference]: Without dead ends: 533 [2018-02-04 04:11:32,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:11:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-04 04:11:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2018-02-04 04:11:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-02-04 04:11:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 527 transitions. [2018-02-04 04:11:32,370 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 527 transitions. Word has length 508 [2018-02-04 04:11:32,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:32,371 INFO L432 AbstractCegarLoop]: Abstraction has 524 states and 527 transitions. [2018-02-04 04:11:32,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:11:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 527 transitions. [2018-02-04 04:11:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-02-04 04:11:32,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:32,374 INFO L351 BasicCegarLoop]: trace histogram [75, 66, 65, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:32,374 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:32,375 INFO L82 PathProgramCache]: Analyzing trace with hash -387441200, now seen corresponding path program 21 times [2018-02-04 04:11:32,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:32,375 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:32,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:32,375 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:32,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:32,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4282 proven. 284 refuted. 0 times theorem prover too weak. 9774 trivial. 0 not checked. [2018-02-04 04:11:33,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:33,044 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:33,044 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:11:33,108 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-02-04 04:11:33,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:33,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 6590 proven. 994 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-04 04:11:33,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:33,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 50 [2018-02-04 04:11:33,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 04:11:33,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 04:11:33,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=2030, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 04:11:33,665 INFO L87 Difference]: Start difference. First operand 524 states and 527 transitions. Second operand 50 states. [2018-02-04 04:11:34,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:34,484 INFO L93 Difference]: Finished difference Result 616 states and 620 transitions. [2018-02-04 04:11:34,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 04:11:34,485 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 514 [2018-02-04 04:11:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:34,486 INFO L225 Difference]: With dead ends: 616 [2018-02-04 04:11:34,486 INFO L226 Difference]: Without dead ends: 616 [2018-02-04 04:11:34,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1240, Invalid=5402, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 04:11:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-02-04 04:11:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 608. [2018-02-04 04:11:34,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-02-04 04:11:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 612 transitions. [2018-02-04 04:11:34,493 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 612 transitions. Word has length 514 [2018-02-04 04:11:34,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:34,493 INFO L432 AbstractCegarLoop]: Abstraction has 608 states and 612 transitions. [2018-02-04 04:11:34,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 04:11:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 612 transitions. [2018-02-04 04:11:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-02-04 04:11:34,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:34,496 INFO L351 BasicCegarLoop]: trace histogram [87, 77, 76, 76, 76, 76, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:34,496 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:34,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1034822807, now seen corresponding path program 22 times [2018-02-04 04:11:34,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:34,496 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:34,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:34,497 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:34,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:34,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-02-04 04:11:35,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:35,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:35,188 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:11:35,257 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:11:35,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:35,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-02-04 04:11:35,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:35,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-02-04 04:11:35,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:11:35,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:11:35,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:11:35,473 INFO L87 Difference]: Start difference. First operand 608 states and 612 transitions. Second operand 26 states. [2018-02-04 04:11:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:35,906 INFO L93 Difference]: Finished difference Result 623 states and 628 transitions. [2018-02-04 04:11:35,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:11:35,906 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 592 [2018-02-04 04:11:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:35,908 INFO L225 Difference]: With dead ends: 623 [2018-02-04 04:11:35,908 INFO L226 Difference]: Without dead ends: 623 [2018-02-04 04:11:35,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 580 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:11:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-02-04 04:11:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 614. [2018-02-04 04:11:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-02-04 04:11:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 619 transitions. [2018-02-04 04:11:35,915 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 619 transitions. Word has length 592 [2018-02-04 04:11:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:35,916 INFO L432 AbstractCegarLoop]: Abstraction has 614 states and 619 transitions. [2018-02-04 04:11:35,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 04:11:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 619 transitions. [2018-02-04 04:11:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-02-04 04:11:35,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:35,919 INFO L351 BasicCegarLoop]: trace histogram [88, 78, 77, 77, 77, 77, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:35,920 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:35,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1525516849, now seen corresponding path program 23 times [2018-02-04 04:11:35,920 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:35,920 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:35,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:35,921 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:35,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:35,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5542 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-02-04 04:11:36,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:36,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:36,932 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:11:37,344 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-02-04 04:11:37,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:37,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 7843 proven. 1769 refuted. 0 times theorem prover too weak. 10325 trivial. 0 not checked. [2018-02-04 04:11:38,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:38,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 53 [2018-02-04 04:11:38,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:11:38,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:11:38,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=2282, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:11:38,021 INFO L87 Difference]: Start difference. First operand 614 states and 619 transitions. Second operand 53 states. [2018-02-04 04:11:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:39,072 INFO L93 Difference]: Finished difference Result 709 states and 716 transitions. [2018-02-04 04:11:39,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 04:11:39,072 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 598 [2018-02-04 04:11:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:39,074 INFO L225 Difference]: With dead ends: 709 [2018-02-04 04:11:39,074 INFO L226 Difference]: Without dead ends: 709 [2018-02-04 04:11:39,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1376, Invalid=6106, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 04:11:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-02-04 04:11:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 701. [2018-02-04 04:11:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-02-04 04:11:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 708 transitions. [2018-02-04 04:11:39,081 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 708 transitions. Word has length 598 [2018-02-04 04:11:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:39,082 INFO L432 AbstractCegarLoop]: Abstraction has 701 states and 708 transitions. [2018-02-04 04:11:39,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:11:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 708 transitions. [2018-02-04 04:11:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-02-04 04:11:39,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:39,087 INFO L351 BasicCegarLoop]: trace histogram [100, 89, 88, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:39,087 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash 775068438, now seen corresponding path program 24 times [2018-02-04 04:11:39,087 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:39,087 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:39,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:39,088 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:39,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:39,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-02-04 04:11:40,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:40,133 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:40,133 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:11:40,237 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-04 04:11:40,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:40,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 6309 proven. 386 refuted. 0 times theorem prover too weak. 19210 trivial. 0 not checked. [2018-02-04 04:11:40,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:40,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 48 [2018-02-04 04:11:40,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 04:11:40,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 04:11:40,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1947, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 04:11:40,740 INFO L87 Difference]: Start difference. First operand 701 states and 708 transitions. Second operand 48 states. [2018-02-04 04:11:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:41,970 INFO L93 Difference]: Finished difference Result 884 states and 889 transitions. [2018-02-04 04:11:41,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 04:11:41,970 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 676 [2018-02-04 04:11:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:41,972 INFO L225 Difference]: With dead ends: 884 [2018-02-04 04:11:41,972 INFO L226 Difference]: Without dead ends: 788 [2018-02-04 04:11:41,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1323, Invalid=8379, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 04:11:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-02-04 04:11:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 776. [2018-02-04 04:11:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-02-04 04:11:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 779 transitions. [2018-02-04 04:11:41,982 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 779 transitions. Word has length 676 [2018-02-04 04:11:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:41,982 INFO L432 AbstractCegarLoop]: Abstraction has 776 states and 779 transitions. [2018-02-04 04:11:41,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 04:11:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 779 transitions. [2018-02-04 04:11:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2018-02-04 04:11:41,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:41,986 INFO L351 BasicCegarLoop]: trace histogram [114, 102, 101, 101, 101, 101, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:41,986 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1095262899, now seen corresponding path program 25 times [2018-02-04 04:11:41,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:41,987 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:41,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:41,987 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:41,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:42,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 33903 backedges. 13460 proven. 420 refuted. 0 times theorem prover too weak. 20023 trivial. 0 not checked. [2018-02-04 04:11:43,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:43,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:43,286 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:43,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 33903 backedges. 13460 proven. 420 refuted. 0 times theorem prover too weak. 20023 trivial. 0 not checked. [2018-02-04 04:11:43,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:43,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 41 [2018-02-04 04:11:43,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:11:43,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:11:43,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:11:43,748 INFO L87 Difference]: Start difference. First operand 776 states and 779 transitions. Second operand 41 states. [2018-02-04 04:11:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:44,246 INFO L93 Difference]: Finished difference Result 805 states and 808 transitions. [2018-02-04 04:11:44,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:11:44,485 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 766 [2018-02-04 04:11:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:44,488 INFO L225 Difference]: With dead ends: 805 [2018-02-04 04:11:44,488 INFO L226 Difference]: Without dead ends: 799 [2018-02-04 04:11:44,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=624, Invalid=2028, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 04:11:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-02-04 04:11:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 787. [2018-02-04 04:11:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-02-04 04:11:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 790 transitions. [2018-02-04 04:11:44,497 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 790 transitions. Word has length 766 [2018-02-04 04:11:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:44,497 INFO L432 AbstractCegarLoop]: Abstraction has 787 states and 790 transitions. [2018-02-04 04:11:44,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:11:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 790 transitions. [2018-02-04 04:11:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-02-04 04:11:44,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:44,503 INFO L351 BasicCegarLoop]: trace histogram [115, 103, 102, 102, 102, 102, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:44,503 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1755749701, now seen corresponding path program 26 times [2018-02-04 04:11:44,504 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:44,504 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:44,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:44,505 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:44,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:44,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 7062 proven. 432 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-04 04:11:45,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:45,230 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:45,231 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:45,275 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:11:45,275 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:45,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 7062 proven. 432 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-04 04:11:45,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:45,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-02-04 04:11:45,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:11:45,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:11:45,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:11:45,477 INFO L87 Difference]: Start difference. First operand 787 states and 790 transitions. Second operand 22 states. [2018-02-04 04:11:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:45,671 INFO L93 Difference]: Finished difference Result 798 states and 801 transitions. [2018-02-04 04:11:45,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:11:45,671 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 772 [2018-02-04 04:11:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:45,672 INFO L225 Difference]: With dead ends: 798 [2018-02-04 04:11:45,672 INFO L226 Difference]: Without dead ends: 798 [2018-02-04 04:11:45,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=321, Invalid=735, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:11:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2018-02-04 04:11:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 788. [2018-02-04 04:11:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-02-04 04:11:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 791 transitions. [2018-02-04 04:11:45,678 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 791 transitions. Word has length 772 [2018-02-04 04:11:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:45,678 INFO L432 AbstractCegarLoop]: Abstraction has 788 states and 791 transitions. [2018-02-04 04:11:45,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:11:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 791 transitions. [2018-02-04 04:11:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-02-04 04:11:45,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:45,682 INFO L351 BasicCegarLoop]: trace histogram [116, 104, 103, 103, 103, 103, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:45,682 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1773325315, now seen corresponding path program 27 times [2018-02-04 04:11:45,683 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:45,683 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:45,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:45,683 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:45,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:45,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-04 04:11:46,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:46,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:46,269 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:11:46,320 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-02-04 04:11:46,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:46,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-04 04:11:46,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:46,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-04 04:11:46,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:11:46,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:11:46,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:11:46,500 INFO L87 Difference]: Start difference. First operand 788 states and 791 transitions. Second operand 18 states. [2018-02-04 04:11:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:46,672 INFO L93 Difference]: Finished difference Result 816 states and 821 transitions. [2018-02-04 04:11:46,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:11:46,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 778 [2018-02-04 04:11:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:46,673 INFO L225 Difference]: With dead ends: 816 [2018-02-04 04:11:46,673 INFO L226 Difference]: Without dead ends: 816 [2018-02-04 04:11:46,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:11:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2018-02-04 04:11:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 794. [2018-02-04 04:11:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-02-04 04:11:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 798 transitions. [2018-02-04 04:11:46,680 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 798 transitions. Word has length 778 [2018-02-04 04:11:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:46,680 INFO L432 AbstractCegarLoop]: Abstraction has 794 states and 798 transitions. [2018-02-04 04:11:46,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:11:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 798 transitions. [2018-02-04 04:11:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-02-04 04:11:46,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:46,684 INFO L351 BasicCegarLoop]: trace histogram [117, 105, 104, 104, 104, 104, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:46,684 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:46,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1537597621, now seen corresponding path program 28 times [2018-02-04 04:11:46,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:46,684 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:46,684 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:46,684 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:46,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:46,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8749 proven. 485 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-02-04 04:11:47,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:47,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:47,665 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:11:47,698 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:11:47,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:47,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 14213 proven. 1642 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-02-04 04:11:48,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:48,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 62 [2018-02-04 04:11:48,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 04:11:48,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 04:11:48,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=3146, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 04:11:48,457 INFO L87 Difference]: Start difference. First operand 794 states and 798 transitions. Second operand 62 states. [2018-02-04 04:11:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:49,473 INFO L93 Difference]: Finished difference Result 904 states and 908 transitions. [2018-02-04 04:11:49,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 04:11:49,473 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 784 [2018-02-04 04:11:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:49,475 INFO L225 Difference]: With dead ends: 904 [2018-02-04 04:11:49,475 INFO L226 Difference]: Without dead ends: 904 [2018-02-04 04:11:49,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 755 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2353 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1894, Invalid=8612, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 04:11:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-02-04 04:11:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 896. [2018-02-04 04:11:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-02-04 04:11:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 900 transitions. [2018-02-04 04:11:49,480 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 900 transitions. Word has length 784 [2018-02-04 04:11:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:49,480 INFO L432 AbstractCegarLoop]: Abstraction has 896 states and 900 transitions. [2018-02-04 04:11:49,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 04:11:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 900 transitions. [2018-02-04 04:11:49,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-02-04 04:11:49,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:49,487 INFO L351 BasicCegarLoop]: trace histogram [132, 119, 118, 118, 118, 118, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:49,487 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:49,487 INFO L82 PathProgramCache]: Analyzing trace with hash -894009052, now seen corresponding path program 29 times [2018-02-04 04:11:49,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:49,488 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:49,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:49,488 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:49,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:49,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-02-04 04:11:50,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:50,298 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:50,298 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:11:51,388 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-02-04 04:11:51,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:51,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 10746 proven. 5054 refuted. 0 times theorem prover too weak. 30067 trivial. 0 not checked. [2018-02-04 04:11:51,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:51,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-02-04 04:11:51,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 04:11:51,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 04:11:51,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:11:51,766 INFO L87 Difference]: Start difference. First operand 896 states and 900 transitions. Second operand 34 states. [2018-02-04 04:11:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:52,047 INFO L93 Difference]: Finished difference Result 911 states and 916 transitions. [2018-02-04 04:11:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:11:52,070 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 880 [2018-02-04 04:11:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:52,072 INFO L225 Difference]: With dead ends: 911 [2018-02-04 04:11:52,072 INFO L226 Difference]: Without dead ends: 911 [2018-02-04 04:11:52,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 862 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:11:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-02-04 04:11:52,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 902. [2018-02-04 04:11:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-02-04 04:11:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 907 transitions. [2018-02-04 04:11:52,078 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 907 transitions. Word has length 880 [2018-02-04 04:11:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:52,078 INFO L432 AbstractCegarLoop]: Abstraction has 902 states and 907 transitions. [2018-02-04 04:11:52,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 04:11:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 907 transitions. [2018-02-04 04:11:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2018-02-04 04:11:52,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:52,083 INFO L351 BasicCegarLoop]: trace histogram [133, 120, 119, 119, 119, 119, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:52,083 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash 741635228, now seen corresponding path program 30 times [2018-02-04 04:11:52,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:52,084 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:52,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:52,084 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:52,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:52,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10732 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-04 04:11:53,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:53,431 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:53,432 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:11:53,603 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-04 04:11:53,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:53,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10033 proven. 2847 refuted. 0 times theorem prover too weak. 33724 trivial. 0 not checked. [2018-02-04 04:11:53,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:53,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 24] total 42 [2018-02-04 04:11:53,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 04:11:53,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 04:11:53,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:11:53,975 INFO L87 Difference]: Start difference. First operand 902 states and 907 transitions. Second operand 42 states. [2018-02-04 04:11:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:54,710 INFO L93 Difference]: Finished difference Result 1110 states and 1119 transitions. [2018-02-04 04:11:54,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 04:11:54,710 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 886 [2018-02-04 04:11:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:54,713 INFO L225 Difference]: With dead ends: 1110 [2018-02-04 04:11:54,713 INFO L226 Difference]: Without dead ends: 1110 [2018-02-04 04:11:54,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 951 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1156, Invalid=4246, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 04:11:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2018-02-04 04:11:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1106. [2018-02-04 04:11:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-02-04 04:11:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1115 transitions. [2018-02-04 04:11:54,727 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1115 transitions. Word has length 886 [2018-02-04 04:11:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:54,728 INFO L432 AbstractCegarLoop]: Abstraction has 1106 states and 1115 transitions. [2018-02-04 04:11:54,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 04:11:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1115 transitions. [2018-02-04 04:11:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2018-02-04 04:11:54,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:54,738 INFO L351 BasicCegarLoop]: trace histogram [147, 133, 132, 132, 132, 132, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:54,739 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1612034285, now seen corresponding path program 31 times [2018-02-04 04:11:54,739 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:54,739 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:54,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:54,740 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:54,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:54,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 57158 backedges. 19511 proven. 1645 refuted. 0 times theorem prover too weak. 36002 trivial. 0 not checked. [2018-02-04 04:11:56,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:56,239 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:56,239 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:56,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 57158 backedges. 27476 proven. 494 refuted. 0 times theorem prover too weak. 29188 trivial. 0 not checked. [2018-02-04 04:11:56,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:56,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 44 [2018-02-04 04:11:56,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 04:11:56,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 04:11:56,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:11:56,773 INFO L87 Difference]: Start difference. First operand 1106 states and 1115 transitions. Second operand 44 states. [2018-02-04 04:11:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:57,144 INFO L93 Difference]: Finished difference Result 1001 states and 1004 transitions. [2018-02-04 04:11:57,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 04:11:57,144 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 976 [2018-02-04 04:11:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:57,146 INFO L225 Difference]: With dead ends: 1001 [2018-02-04 04:11:57,146 INFO L226 Difference]: Without dead ends: 992 [2018-02-04 04:11:57,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=721, Invalid=2359, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:11:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-02-04 04:11:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-02-04 04:11:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-02-04 04:11:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 995 transitions. [2018-02-04 04:11:57,153 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 995 transitions. Word has length 976 [2018-02-04 04:11:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:57,154 INFO L432 AbstractCegarLoop]: Abstraction has 992 states and 995 transitions. [2018-02-04 04:11:57,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 04:11:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 995 transitions. [2018-02-04 04:11:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-02-04 04:11:57,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:57,160 INFO L351 BasicCegarLoop]: trace histogram [148, 134, 133, 133, 133, 133, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:57,160 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:57,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1908977205, now seen corresponding path program 32 times [2018-02-04 04:11:57,160 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:57,160 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:57,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:57,161 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:57,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:57,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-02-04 04:11:58,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:58,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:58,654 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:58,717 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:11:58,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:58,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-02-04 04:11:59,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:59,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 47 [2018-02-04 04:11:59,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 04:11:59,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 04:11:59,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:11:59,263 INFO L87 Difference]: Start difference. First operand 992 states and 995 transitions. Second operand 47 states. [2018-02-04 04:11:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:59,648 INFO L93 Difference]: Finished difference Result 1001 states and 1002 transitions. [2018-02-04 04:11:59,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 04:11:59,648 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 982 [2018-02-04 04:11:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:59,650 INFO L225 Difference]: With dead ends: 1001 [2018-02-04 04:11:59,650 INFO L226 Difference]: Without dead ends: 995 [2018-02-04 04:11:59,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1026 GetRequests, 968 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=825, Invalid=2715, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:11:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2018-02-04 04:11:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 992. [2018-02-04 04:11:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-02-04 04:11:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 993 transitions. [2018-02-04 04:11:59,657 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 993 transitions. Word has length 982 [2018-02-04 04:11:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:59,658 INFO L432 AbstractCegarLoop]: Abstraction has 992 states and 993 transitions. [2018-02-04 04:11:59,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 04:11:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 993 transitions. [2018-02-04 04:11:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-02-04 04:11:59,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:59,663 INFO L351 BasicCegarLoop]: trace histogram [149, 135, 134, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:59,663 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1435708227, now seen corresponding path program 33 times [2018-02-04 04:11:59,663 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:59,663 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:59,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:59,663 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:59,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:59,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-02-04 04:12:00,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:00,869 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:00,869 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:12:00,919 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 04:12:00,919 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:00,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-02-04 04:12:01,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:01,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-04 04:12:01,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:12:01,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:12:01,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:12:01,166 INFO L87 Difference]: Start difference. First operand 992 states and 993 transitions. Second operand 20 states. [2018-02-04 04:12:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:01,373 INFO L93 Difference]: Finished difference Result 1004 states and 1006 transitions. [2018-02-04 04:12:01,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:12:01,373 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 988 [2018-02-04 04:12:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:01,375 INFO L225 Difference]: With dead ends: 1004 [2018-02-04 04:12:01,375 INFO L226 Difference]: Without dead ends: 1004 [2018-02-04 04:12:01,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 987 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:12:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-02-04 04:12:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 998. [2018-02-04 04:12:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-02-04 04:12:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1000 transitions. [2018-02-04 04:12:01,381 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1000 transitions. Word has length 988 [2018-02-04 04:12:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:01,382 INFO L432 AbstractCegarLoop]: Abstraction has 998 states and 1000 transitions. [2018-02-04 04:12:01,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:12:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1000 transitions. [2018-02-04 04:12:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-02-04 04:12:01,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:01,390 INFO L351 BasicCegarLoop]: trace histogram [150, 136, 135, 135, 135, 135, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:01,390 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:01,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1833618299, now seen corresponding path program 34 times [2018-02-04 04:12:01,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:01,391 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:01,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:01,392 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:01,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:01,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12992 proven. 649 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-02-04 04:12:03,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:03,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:03,149 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:12:03,192 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:12:03,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:03,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 21640 proven. 2164 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-02-04 04:12:04,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:04,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 39] total 70 [2018-02-04 04:12:04,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 04:12:04,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 04:12:04,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=805, Invalid=4025, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 04:12:04,229 INFO L87 Difference]: Start difference. First operand 998 states and 1000 transitions. Second operand 70 states. [2018-02-04 04:12:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:05,619 INFO L93 Difference]: Finished difference Result 1117 states and 1120 transitions. [2018-02-04 04:12:05,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 04:12:05,619 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 994 [2018-02-04 04:12:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:05,621 INFO L225 Difference]: With dead ends: 1117 [2018-02-04 04:12:05,622 INFO L226 Difference]: Without dead ends: 1117 [2018-02-04 04:12:05,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2405, Invalid=11167, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 04:12:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2018-02-04 04:12:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1112. [2018-02-04 04:12:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-02-04 04:12:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1115 transitions. [2018-02-04 04:12:05,647 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1115 transitions. Word has length 994 [2018-02-04 04:12:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:05,648 INFO L432 AbstractCegarLoop]: Abstraction has 1112 states and 1115 transitions. [2018-02-04 04:12:05,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 04:12:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1115 transitions. [2018-02-04 04:12:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2018-02-04 04:12:05,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:05,655 INFO L351 BasicCegarLoop]: trace histogram [167, 152, 151, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:05,655 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1521424346, now seen corresponding path program 35 times [2018-02-04 04:12:05,656 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:05,656 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:05,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:05,656 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:05,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:05,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-02-04 04:12:07,059 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:07,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:07,060 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:12:09,541 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-02-04 04:12:09,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:09,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 19455 proven. 4728 refuted. 0 times theorem prover too weak. 50115 trivial. 0 not checked. [2018-02-04 04:12:10,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:10,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 19 [2018-02-04 04:12:10,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:12:10,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:12:10,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:12:10,471 INFO L87 Difference]: Start difference. First operand 1112 states and 1115 transitions. Second operand 20 states. [2018-02-04 04:12:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:10,931 INFO L93 Difference]: Finished difference Result 1124 states and 1128 transitions. [2018-02-04 04:12:10,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:12:10,932 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1102 [2018-02-04 04:12:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:10,934 INFO L225 Difference]: With dead ends: 1124 [2018-02-04 04:12:10,934 INFO L226 Difference]: Without dead ends: 1124 [2018-02-04 04:12:10,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1120 GetRequests, 1097 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:12:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-02-04 04:12:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1118. [2018-02-04 04:12:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-02-04 04:12:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1122 transitions. [2018-02-04 04:12:10,941 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1122 transitions. Word has length 1102 [2018-02-04 04:12:10,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:10,941 INFO L432 AbstractCegarLoop]: Abstraction has 1118 states and 1122 transitions. [2018-02-04 04:12:10,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:12:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1122 transitions. [2018-02-04 04:12:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-02-04 04:12:10,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:10,948 INFO L351 BasicCegarLoop]: trace histogram [168, 153, 152, 152, 152, 152, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:10,948 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:10,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1687333586, now seen corresponding path program 36 times [2018-02-04 04:12:10,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:10,948 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:10,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:10,949 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:10,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:10,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 15547 proven. 740 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-02-04 04:12:13,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:13,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:13,081 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:12:13,528 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-02-04 04:12:13,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:13,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 14652 proven. 3681 refuted. 0 times theorem prover too weak. 56904 trivial. 0 not checked. [2018-02-04 04:12:14,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:14,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 26] total 46 [2018-02-04 04:12:14,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 04:12:14,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 04:12:14,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1695, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 04:12:14,080 INFO L87 Difference]: Start difference. First operand 1118 states and 1122 transitions. Second operand 46 states. [2018-02-04 04:12:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:14,882 INFO L93 Difference]: Finished difference Result 1356 states and 1365 transitions. [2018-02-04 04:12:14,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 04:12:14,882 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1108 [2018-02-04 04:12:14,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:14,885 INFO L225 Difference]: With dead ends: 1356 [2018-02-04 04:12:14,885 INFO L226 Difference]: Without dead ends: 1356 [2018-02-04 04:12:14,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1181 GetRequests, 1101 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1421, Invalid=5221, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 04:12:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2018-02-04 04:12:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1352. [2018-02-04 04:12:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-02-04 04:12:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1361 transitions. [2018-02-04 04:12:14,894 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1361 transitions. Word has length 1108 [2018-02-04 04:12:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:14,894 INFO L432 AbstractCegarLoop]: Abstraction has 1352 states and 1361 transitions. [2018-02-04 04:12:14,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 04:12:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1361 transitions. [2018-02-04 04:12:14,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1211 [2018-02-04 04:12:14,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:14,907 INFO L351 BasicCegarLoop]: trace histogram [184, 168, 167, 167, 167, 167, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:14,907 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:14,907 INFO L82 PathProgramCache]: Analyzing trace with hash 482695993, now seen corresponding path program 37 times [2018-02-04 04:12:14,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:14,907 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:14,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:14,908 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:14,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:14,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 90563 backedges. 28558 proven. 2167 refuted. 0 times theorem prover too weak. 59838 trivial. 0 not checked. [2018-02-04 04:12:17,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:17,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:17,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:12:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:17,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 90563 backedges. 40543 proven. 660 refuted. 0 times theorem prover too weak. 49360 trivial. 0 not checked. [2018-02-04 04:12:17,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:17,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 50 [2018-02-04 04:12:17,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 04:12:17,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 04:12:17,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 04:12:17,942 INFO L87 Difference]: Start difference. First operand 1352 states and 1361 transitions. Second operand 50 states. [2018-02-04 04:12:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:18,457 INFO L93 Difference]: Finished difference Result 1235 states and 1238 transitions. [2018-02-04 04:12:18,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 04:12:18,457 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1210 [2018-02-04 04:12:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:18,459 INFO L225 Difference]: With dead ends: 1235 [2018-02-04 04:12:18,459 INFO L226 Difference]: Without dead ends: 1226 [2018-02-04 04:12:18,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1257 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=936, Invalid=3096, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 04:12:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2018-02-04 04:12:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1226. [2018-02-04 04:12:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-02-04 04:12:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1229 transitions. [2018-02-04 04:12:18,467 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1229 transitions. Word has length 1210 [2018-02-04 04:12:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:18,467 INFO L432 AbstractCegarLoop]: Abstraction has 1226 states and 1229 transitions. [2018-02-04 04:12:18,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 04:12:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1229 transitions. [2018-02-04 04:12:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2018-02-04 04:12:18,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:18,474 INFO L351 BasicCegarLoop]: trace histogram [185, 169, 168, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:18,474 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1655146865, now seen corresponding path program 38 times [2018-02-04 04:12:18,475 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:18,475 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:18,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:18,475 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:12:18,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:18,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-02-04 04:12:20,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:20,834 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:20,834 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:12:20,891 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:12:20,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:20,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-02-04 04:12:21,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:21,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 53 [2018-02-04 04:12:21,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:12:21,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:12:21,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:12:21,510 INFO L87 Difference]: Start difference. First operand 1226 states and 1229 transitions. Second operand 53 states. [2018-02-04 04:12:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:22,191 INFO L93 Difference]: Finished difference Result 1235 states and 1236 transitions. [2018-02-04 04:12:22,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 04:12:22,191 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1216 [2018-02-04 04:12:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:22,193 INFO L225 Difference]: With dead ends: 1235 [2018-02-04 04:12:22,193 INFO L226 Difference]: Without dead ends: 1229 [2018-02-04 04:12:22,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1054, Invalid=3502, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:12:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-02-04 04:12:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2018-02-04 04:12:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-02-04 04:12:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1227 transitions. [2018-02-04 04:12:22,199 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1227 transitions. Word has length 1216 [2018-02-04 04:12:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:22,200 INFO L432 AbstractCegarLoop]: Abstraction has 1226 states and 1227 transitions. [2018-02-04 04:12:22,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:12:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1227 transitions. [2018-02-04 04:12:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-02-04 04:12:22,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:22,212 INFO L351 BasicCegarLoop]: trace histogram [186, 170, 169, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:22,212 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1276924311, now seen corresponding path program 39 times [2018-02-04 04:12:22,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:22,212 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:22,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:22,213 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:22,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:22,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-02-04 04:12:23,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:23,739 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:23,740 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:12:23,819 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-02-04 04:12:23,819 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:23,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-02-04 04:12:24,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:24,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-02-04 04:12:24,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:12:24,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:12:24,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:12:24,237 INFO L87 Difference]: Start difference. First operand 1226 states and 1227 transitions. Second operand 29 states. [2018-02-04 04:12:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:24,634 INFO L93 Difference]: Finished difference Result 1238 states and 1240 transitions. [2018-02-04 04:12:24,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:12:24,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1222 [2018-02-04 04:12:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:24,638 INFO L225 Difference]: With dead ends: 1238 [2018-02-04 04:12:24,638 INFO L226 Difference]: Without dead ends: 1238 [2018-02-04 04:12:24,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1257 GetRequests, 1214 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=581, Invalid=1399, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:12:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-02-04 04:12:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1232. [2018-02-04 04:12:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-02-04 04:12:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1234 transitions. [2018-02-04 04:12:24,645 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1234 transitions. Word has length 1222 [2018-02-04 04:12:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:24,646 INFO L432 AbstractCegarLoop]: Abstraction has 1232 states and 1234 transitions. [2018-02-04 04:12:24,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:12:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1234 transitions. [2018-02-04 04:12:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-02-04 04:12:24,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:24,653 INFO L351 BasicCegarLoop]: trace histogram [187, 171, 170, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:24,653 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:24,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2048514593, now seen corresponding path program 40 times [2018-02-04 04:12:24,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:24,653 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:24,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:24,653 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:24,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:24,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 18415 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-02-04 04:12:27,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:27,215 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:27,216 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:12:27,268 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:12:27,268 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:27,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 31279 proven. 2758 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-02-04 04:12:28,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:28,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 43] total 78 [2018-02-04 04:12:28,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 04:12:28,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 04:12:28,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=5012, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 04:12:28,524 INFO L87 Difference]: Start difference. First operand 1232 states and 1234 transitions. Second operand 78 states. [2018-02-04 04:12:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:30,164 INFO L93 Difference]: Finished difference Result 1363 states and 1366 transitions. [2018-02-04 04:12:30,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-02-04 04:12:30,164 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1228 [2018-02-04 04:12:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:30,167 INFO L225 Difference]: With dead ends: 1363 [2018-02-04 04:12:30,167 INFO L226 Difference]: Without dead ends: 1363 [2018-02-04 04:12:30,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1320 GetRequests, 1191 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2976, Invalid=14054, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 04:12:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-02-04 04:12:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1358. [2018-02-04 04:12:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-02-04 04:12:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1361 transitions. [2018-02-04 04:12:30,174 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1361 transitions. Word has length 1228 [2018-02-04 04:12:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:30,175 INFO L432 AbstractCegarLoop]: Abstraction has 1358 states and 1361 transitions. [2018-02-04 04:12:30,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 04:12:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1361 transitions. [2018-02-04 04:12:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2018-02-04 04:12:30,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:30,183 INFO L351 BasicCegarLoop]: trace histogram [206, 189, 188, 188, 188, 188, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:30,183 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:30,183 INFO L82 PathProgramCache]: Analyzing trace with hash 811391088, now seen corresponding path program 41 times [2018-02-04 04:12:30,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:30,183 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:30,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:30,184 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:30,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:30,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-02-04 04:12:32,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:32,114 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:32,114 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:12:36,868 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-02-04 04:12:36,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:37,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-02-04 04:12:37,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:37,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-02-04 04:12:37,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:12:37,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:12:37,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:12:37,788 INFO L87 Difference]: Start difference. First operand 1358 states and 1361 transitions. Second operand 41 states. [2018-02-04 04:12:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:38,139 INFO L93 Difference]: Finished difference Result 1370 states and 1374 transitions. [2018-02-04 04:12:38,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:12:38,139 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1348 [2018-02-04 04:12:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:38,142 INFO L225 Difference]: With dead ends: 1370 [2018-02-04 04:12:38,142 INFO L226 Difference]: Without dead ends: 1370 [2018-02-04 04:12:38,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1328 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:12:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-02-04 04:12:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1364. [2018-02-04 04:12:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2018-02-04 04:12:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1368 transitions. [2018-02-04 04:12:38,148 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1368 transitions. Word has length 1348 [2018-02-04 04:12:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:38,149 INFO L432 AbstractCegarLoop]: Abstraction has 1364 states and 1368 transitions. [2018-02-04 04:12:38,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:12:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1368 transitions. [2018-02-04 04:12:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2018-02-04 04:12:38,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:38,157 INFO L351 BasicCegarLoop]: trace histogram [207, 190, 189, 189, 189, 189, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:38,157 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash 802628328, now seen corresponding path program 42 times [2018-02-04 04:12:38,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:38,157 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:38,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:38,158 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:38,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:38,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 21614 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-02-04 04:12:41,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:41,487 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:41,488 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:12:43,254 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-02-04 04:12:43,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:43,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 20567 proven. 5569 refuted. 0 times theorem prover too weak. 89204 trivial. 0 not checked. [2018-02-04 04:12:43,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:43,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 28] total 51 [2018-02-04 04:12:43,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 04:12:43,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 04:12:43,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=2091, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:12:43,925 INFO L87 Difference]: Start difference. First operand 1364 states and 1368 transitions. Second operand 51 states. [2018-02-04 04:12:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:44,933 INFO L93 Difference]: Finished difference Result 1626 states and 1635 transitions. [2018-02-04 04:12:44,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 04:12:44,934 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1354 [2018-02-04 04:12:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:44,936 INFO L225 Difference]: With dead ends: 1626 [2018-02-04 04:12:44,937 INFO L226 Difference]: Without dead ends: 1626 [2018-02-04 04:12:44,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1436 GetRequests, 1346 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1784, Invalid=6588, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 04:12:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2018-02-04 04:12:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1622. [2018-02-04 04:12:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-02-04 04:12:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1631 transitions. [2018-02-04 04:12:44,949 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1631 transitions. Word has length 1354 [2018-02-04 04:12:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:44,950 INFO L432 AbstractCegarLoop]: Abstraction has 1622 states and 1631 transitions. [2018-02-04 04:12:44,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 04:12:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1631 transitions. [2018-02-04 04:12:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1469 [2018-02-04 04:12:44,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:44,961 INFO L351 BasicCegarLoop]: trace histogram [225, 207, 206, 206, 206, 206, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:44,961 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2005170369, now seen corresponding path program 43 times [2018-02-04 04:12:44,962 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:44,962 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:44,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:44,962 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:44,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:45,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 136686 backedges. 40033 proven. 2761 refuted. 0 times theorem prover too weak. 93892 trivial. 0 not checked. [2018-02-04 04:12:48,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:48,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:48,551 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:12:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:48,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 136686 backedges. 57190 proven. 850 refuted. 0 times theorem prover too weak. 78646 trivial. 0 not checked. [2018-02-04 04:12:49,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:49,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 56 [2018-02-04 04:12:49,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 04:12:49,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 04:12:49,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2341, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:12:49,418 INFO L87 Difference]: Start difference. First operand 1622 states and 1631 transitions. Second operand 56 states. [2018-02-04 04:12:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:49,916 INFO L93 Difference]: Finished difference Result 1493 states and 1496 transitions. [2018-02-04 04:12:49,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 04:12:49,916 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1468 [2018-02-04 04:12:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:49,919 INFO L225 Difference]: With dead ends: 1493 [2018-02-04 04:12:49,919 INFO L226 Difference]: Without dead ends: 1484 [2018-02-04 04:12:49,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1521 GetRequests, 1451 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1179, Invalid=3933, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 04:12:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-02-04 04:12:49,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1484. [2018-02-04 04:12:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-02-04 04:12:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1487 transitions. [2018-02-04 04:12:49,928 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1487 transitions. Word has length 1468 [2018-02-04 04:12:49,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:49,929 INFO L432 AbstractCegarLoop]: Abstraction has 1484 states and 1487 transitions. [2018-02-04 04:12:49,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 04:12:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1487 transitions. [2018-02-04 04:12:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1475 [2018-02-04 04:12:49,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:49,939 INFO L351 BasicCegarLoop]: trace histogram [226, 208, 207, 207, 207, 207, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:49,939 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:49,939 INFO L82 PathProgramCache]: Analyzing trace with hash -773621513, now seen corresponding path program 44 times [2018-02-04 04:12:49,939 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:49,940 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:49,940 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:49,940 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:12:49,940 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:49,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 43121 proven. 954 refuted. 0 times theorem prover too weak. 93886 trivial. 0 not checked. [2018-02-04 04:12:53,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:53,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:53,666 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:12:53,749 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:12:53,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:53,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 23606 proven. 1009 refuted. 0 times theorem prover too weak. 113346 trivial. 0 not checked. [2018-02-04 04:12:54,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:54,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 74 [2018-02-04 04:12:54,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 04:12:54,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 04:12:54,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=4683, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 04:12:54,903 INFO L87 Difference]: Start difference. First operand 1484 states and 1487 transitions. Second operand 74 states. [2018-02-04 04:12:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:56,813 INFO L93 Difference]: Finished difference Result 1628 states and 1630 transitions. [2018-02-04 04:12:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-02-04 04:12:56,813 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1474 [2018-02-04 04:12:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:56,816 INFO L225 Difference]: With dead ends: 1628 [2018-02-04 04:12:56,816 INFO L226 Difference]: Without dead ends: 1619 [2018-02-04 04:12:56,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1607 GetRequests, 1460 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6154 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2749, Invalid=19303, Unknown=0, NotChecked=0, Total=22052 [2018-02-04 04:12:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-02-04 04:12:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1610. [2018-02-04 04:12:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2018-02-04 04:12:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1612 transitions. [2018-02-04 04:12:56,825 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1612 transitions. Word has length 1474 [2018-02-04 04:12:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:56,825 INFO L432 AbstractCegarLoop]: Abstraction has 1610 states and 1612 transitions. [2018-02-04 04:12:56,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 04:12:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1612 transitions. [2018-02-04 04:12:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1607 [2018-02-04 04:12:56,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:56,836 INFO L351 BasicCegarLoop]: trace histogram [247, 228, 227, 227, 227, 227, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:56,836 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash -736205386, now seen corresponding path program 45 times [2018-02-04 04:12:56,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:56,837 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:56,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:56,837 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:56,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:56,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 165398 backedges. 48915 proven. 1064 refuted. 0 times theorem prover too weak. 115419 trivial. 0 not checked. [2018-02-04 04:13:01,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:01,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:01,478 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:13:01,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-02-04 04:13:01,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:01,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 165398 backedges. 25096 proven. 1083 refuted. 0 times theorem prover too weak. 139219 trivial. 0 not checked. [2018-02-04 04:13:02,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:02,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 22] total 63 [2018-02-04 04:13:02,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 04:13:02,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 04:13:02,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=3315, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:13:02,641 INFO L87 Difference]: Start difference. First operand 1610 states and 1612 transitions. Second operand 63 states. [2018-02-04 04:13:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:04,362 INFO L93 Difference]: Finished difference Result 1635 states and 1637 transitions. [2018-02-04 04:13:04,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 04:13:04,362 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1606 [2018-02-04 04:13:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:04,365 INFO L225 Difference]: With dead ends: 1635 [2018-02-04 04:13:04,365 INFO L226 Difference]: Without dead ends: 1629 [2018-02-04 04:13:04,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1684 GetRequests, 1586 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2685 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1696, Invalid=8204, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 04:13:04,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2018-02-04 04:13:04,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1622. [2018-02-04 04:13:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-02-04 04:13:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1624 transitions. [2018-02-04 04:13:04,372 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1624 transitions. Word has length 1606 [2018-02-04 04:13:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:04,373 INFO L432 AbstractCegarLoop]: Abstraction has 1622 states and 1624 transitions. [2018-02-04 04:13:04,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 04:13:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1624 transitions. [2018-02-04 04:13:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1619 [2018-02-04 04:13:04,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:04,384 INFO L351 BasicCegarLoop]: trace histogram [249, 230, 229, 229, 229, 229, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:04,384 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash -758475034, now seen corresponding path program 46 times [2018-02-04 04:13:04,385 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:04,385 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:04,385 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:04,385 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:04,385 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:04,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-02-04 04:13:07,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:07,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:07,168 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:13:07,353 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:13:07,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:07,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-02-04 04:13:08,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:08,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-02-04 04:13:08,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 04:13:08,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 04:13:08,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=1449, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:13:08,108 INFO L87 Difference]: Start difference. First operand 1622 states and 1624 transitions. Second operand 44 states. [2018-02-04 04:13:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:08,649 INFO L93 Difference]: Finished difference Result 1647 states and 1651 transitions. [2018-02-04 04:13:08,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:13:08,650 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1618 [2018-02-04 04:13:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:08,652 INFO L225 Difference]: With dead ends: 1647 [2018-02-04 04:13:08,653 INFO L226 Difference]: Without dead ends: 1647 [2018-02-04 04:13:08,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1640 GetRequests, 1597 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=1449, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:13:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2018-02-04 04:13:08,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1628. [2018-02-04 04:13:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-02-04 04:13:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1631 transitions. [2018-02-04 04:13:08,660 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1631 transitions. Word has length 1618 [2018-02-04 04:13:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:08,660 INFO L432 AbstractCegarLoop]: Abstraction has 1628 states and 1631 transitions. [2018-02-04 04:13:08,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 04:13:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1631 transitions. [2018-02-04 04:13:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-02-04 04:13:08,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:08,672 INFO L351 BasicCegarLoop]: trace histogram [250, 231, 230, 230, 230, 230, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:08,672 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash -828526370, now seen corresponding path program 47 times [2018-02-04 04:13:08,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:08,672 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:08,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:08,673 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:08,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:08,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29077 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-02-04 04:13:13,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:13,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:13,719 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:13:20,199 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-02-04 04:13:20,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:20,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29011 proven. 6824 refuted. 0 times theorem prover too weak. 133790 trivial. 0 not checked. [2018-02-04 04:13:21,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:21,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 50] total 74 [2018-02-04 04:13:21,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 04:13:21,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 04:13:21,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=4319, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 04:13:21,686 INFO L87 Difference]: Start difference. First operand 1628 states and 1631 transitions. Second operand 74 states. [2018-02-04 04:13:23,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:23,100 INFO L93 Difference]: Finished difference Result 1780 states and 1784 transitions. [2018-02-04 04:13:23,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 04:13:23,101 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1624 [2018-02-04 04:13:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:23,103 INFO L225 Difference]: With dead ends: 1780 [2018-02-04 04:13:23,103 INFO L226 Difference]: Without dead ends: 1780 [2018-02-04 04:13:23,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1714 GetRequests, 1597 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2962, Invalid=11080, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 04:13:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2018-02-04 04:13:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1772. [2018-02-04 04:13:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-02-04 04:13:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 1776 transitions. [2018-02-04 04:13:23,110 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 1776 transitions. Word has length 1624 [2018-02-04 04:13:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:23,111 INFO L432 AbstractCegarLoop]: Abstraction has 1772 states and 1776 transitions. [2018-02-04 04:13:23,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 04:13:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 1776 transitions. [2018-02-04 04:13:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1757 [2018-02-04 04:13:23,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:23,124 INFO L351 BasicCegarLoop]: trace histogram [271, 251, 250, 250, 250, 250, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:23,124 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:23,124 INFO L82 PathProgramCache]: Analyzing trace with hash -500562851, now seen corresponding path program 48 times [2018-02-04 04:13:23,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:23,124 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:23,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:23,124 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:23,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:23,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 199920 backedges. 55569 proven. 3846 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-02-04 04:13:29,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:29,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:29,539 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:13:30,005 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 04:13:30,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:30,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 199920 backedges. 30421 proven. 1323 refuted. 0 times theorem prover too weak. 168176 trivial. 0 not checked. [2018-02-04 04:13:31,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:31,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 24] total 73 [2018-02-04 04:13:31,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 04:13:31,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 04:13:31,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=4437, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 04:13:31,173 INFO L87 Difference]: Start difference. First operand 1772 states and 1776 transitions. Second operand 73 states. [2018-02-04 04:13:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:32,958 INFO L93 Difference]: Finished difference Result 2071 states and 2080 transitions. [2018-02-04 04:13:32,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 04:13:32,958 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1756 [2018-02-04 04:13:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:32,961 INFO L225 Difference]: With dead ends: 2071 [2018-02-04 04:13:32,962 INFO L226 Difference]: Without dead ends: 2071 [2018-02-04 04:13:32,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1870 GetRequests, 1734 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4536 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4305, Invalid=14601, Unknown=0, NotChecked=0, Total=18906 [2018-02-04 04:13:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2018-02-04 04:13:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1922. [2018-02-04 04:13:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-02-04 04:13:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 1929 transitions. [2018-02-04 04:13:32,974 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 1929 transitions. Word has length 1756 [2018-02-04 04:13:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:32,974 INFO L432 AbstractCegarLoop]: Abstraction has 1922 states and 1929 transitions. [2018-02-04 04:13:32,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 04:13:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 1929 transitions. [2018-02-04 04:13:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1769 [2018-02-04 04:13:32,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:32,988 INFO L351 BasicCegarLoop]: trace histogram [273, 253, 252, 252, 252, 252, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:32,988 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:32,988 INFO L82 PathProgramCache]: Analyzing trace with hash 527799053, now seen corresponding path program 49 times [2018-02-04 04:13:32,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:32,989 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:32,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:32,989 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:32,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:33,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33377 proven. 1285 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-02-04 04:13:39,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:39,122 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:39,123 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:13:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:39,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33442 proven. 1220 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-02-04 04:13:40,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:40,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 72 [2018-02-04 04:13:40,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 04:13:40,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 04:13:40,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1177, Invalid=3935, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 04:13:40,568 INFO L87 Difference]: Start difference. First operand 1922 states and 1929 transitions. Second operand 72 states. [2018-02-04 04:13:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:41,768 INFO L93 Difference]: Finished difference Result 2217 states and 2228 transitions. [2018-02-04 04:13:41,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 04:13:41,769 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 1768 [2018-02-04 04:13:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:41,773 INFO L225 Difference]: With dead ends: 2217 [2018-02-04 04:13:41,773 INFO L226 Difference]: Without dead ends: 2217 [2018-02-04 04:13:41,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1858 GetRequests, 1745 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3324, Invalid=9786, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 04:13:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-02-04 04:13:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2207. [2018-02-04 04:13:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2018-02-04 04:13:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 2218 transitions. [2018-02-04 04:13:41,793 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 2218 transitions. Word has length 1768 [2018-02-04 04:13:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:41,794 INFO L432 AbstractCegarLoop]: Abstraction has 2207 states and 2218 transitions. [2018-02-04 04:13:41,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 04:13:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2218 transitions. [2018-02-04 04:13:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1901 [2018-02-04 04:13:41,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:41,819 INFO L351 BasicCegarLoop]: trace histogram [294, 273, 272, 272, 272, 272, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:41,819 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1101666444, now seen corresponding path program 50 times [2018-02-04 04:13:41,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:41,820 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:41,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:41,821 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:13:41,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:41,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-02-04 04:13:48,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:48,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:48,605 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:13:48,724 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:13:48,725 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:48,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-02-04 04:13:50,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:50,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 68 [2018-02-04 04:13:50,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 04:13:50,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 04:13:50,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=3477, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:13:50,039 INFO L87 Difference]: Start difference. First operand 2207 states and 2218 transitions. Second operand 68 states. [2018-02-04 04:13:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:50,848 INFO L93 Difference]: Finished difference Result 2081 states and 2084 transitions. [2018-02-04 04:13:50,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 04:13:50,849 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 1900 [2018-02-04 04:13:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:50,851 INFO L225 Difference]: With dead ends: 2081 [2018-02-04 04:13:50,851 INFO L226 Difference]: Without dead ends: 1928 [2018-02-04 04:13:50,852 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1965 GetRequests, 1879 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2641 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1749, Invalid=5907, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 04:13:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-02-04 04:13:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1922. [2018-02-04 04:13:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-02-04 04:13:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 1924 transitions. [2018-02-04 04:13:50,861 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 1924 transitions. Word has length 1900 [2018-02-04 04:13:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:50,862 INFO L432 AbstractCegarLoop]: Abstraction has 1922 states and 1924 transitions. [2018-02-04 04:13:50,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 04:13:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 1924 transitions. [2018-02-04 04:13:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1913 [2018-02-04 04:13:50,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:50,878 INFO L351 BasicCegarLoop]: trace histogram [296, 275, 274, 274, 274, 274, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:50,878 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:50,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1723381956, now seen corresponding path program 51 times [2018-02-04 04:13:50,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:50,878 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:50,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:50,879 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:50,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:50,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-02-04 04:13:55,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:55,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:55,090 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:13:55,343 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-02-04 04:13:55,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:55,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-02-04 04:13:56,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:56,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 29 [2018-02-04 04:13:56,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 04:13:56,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 04:13:56,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=550, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:13:56,236 INFO L87 Difference]: Start difference. First operand 1922 states and 1924 transitions. Second operand 30 states. [2018-02-04 04:13:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:56,564 INFO L93 Difference]: Finished difference Result 1937 states and 1940 transitions. [2018-02-04 04:13:56,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:13:56,565 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1912 [2018-02-04 04:13:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:56,567 INFO L225 Difference]: With dead ends: 1937 [2018-02-04 04:13:56,568 INFO L226 Difference]: Without dead ends: 1937 [2018-02-04 04:13:56,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1957 GetRequests, 1908 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=886, Invalid=1664, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:13:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-02-04 04:13:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1928. [2018-02-04 04:13:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-02-04 04:13:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 1931 transitions. [2018-02-04 04:13:56,576 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 1931 transitions. Word has length 1912 [2018-02-04 04:13:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:56,577 INFO L432 AbstractCegarLoop]: Abstraction has 1928 states and 1931 transitions. [2018-02-04 04:13:56,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 04:13:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 1931 transitions. [2018-02-04 04:13:56,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2018-02-04 04:13:56,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:56,593 INFO L351 BasicCegarLoop]: trace histogram [297, 276, 275, 275, 275, 275, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:56,593 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash -701609804, now seen corresponding path program 52 times [2018-02-04 04:13:56,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:56,593 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:56,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:56,594 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:56,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:56,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 241092 backedges. 38080 proven. 1412 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-02-04 04:14:04,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:04,563 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:04,563 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:14:04,654 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:14:04,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:04,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-02-04 04:14:05,290 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 04:14:05,290 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:14:05,293 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:14:05,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:14:05 BoogieIcfgContainer [2018-02-04 04:14:05,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:14:05,293 INFO L168 Benchmark]: Toolchain (without parser) took 169875.42 ms. Allocated memory was 397.9 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 353.3 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 717.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:05,294 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:14:05,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.27 ms. Allocated memory is still 397.9 MB. Free memory was 353.3 MB in the beginning and 345.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:05,294 INFO L168 Benchmark]: Boogie Preprocessor took 28.29 ms. Allocated memory is still 397.9 MB. Free memory was 345.4 MB in the beginning and 342.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:05,295 INFO L168 Benchmark]: RCFGBuilder took 171.60 ms. Allocated memory is still 397.9 MB. Free memory was 342.7 MB in the beginning and 325.5 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:05,295 INFO L168 Benchmark]: TraceAbstraction took 169537.18 ms. Allocated memory was 397.9 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 325.5 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 689.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:05,296 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.17 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 135.27 ms. Allocated memory is still 397.9 MB. Free memory was 353.3 MB in the beginning and 345.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.29 ms. Allocated memory is still 397.9 MB. Free memory was 345.4 MB in the beginning and 342.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 171.60 ms. Allocated memory is still 397.9 MB. Free memory was 342.7 MB in the beginning and 325.5 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 169537.18 ms. Allocated memory was 397.9 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 325.5 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 689.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 169.5s OverallTime, 61 OverallIterations, 297 TraceHistogramMax, 32.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2147 SDtfs, 20390 SDslu, 21461 SDs, 0 SdLazy, 57745 SolverSat, 2985 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43370 GetRequests, 40481 SyntacticMatches, 21 SemanticMatches, 2868 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56538 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2207occurred in iteration=58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 60 MinimizatonAttempts, 679 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 22.3s SatisfiabilityAnalysisTime, 91.9s InterpolantComputationTime, 82348 NumberOfCodeBlocks, 76770 NumberOfCodeBlocksAsserted, 613 NumberOfCheckSat, 82234 ConstructedInterpolants, 0 QuantifiedInterpolants, 144370076 SizeOfPredicates, 120 NumberOfNonLiveVariables, 81329 ConjunctsInSsa, 1352 ConjunctsInUnsatCore, 114 InterpolantComputations, 7 PerfectInterpolantSequences, 5972072/6063620 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-14-05-302.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-14-05-302.csv Completed graceful shutdown