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-c17473d-m [2018-02-04 18:49:26,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:49:26,877 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:49:26,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:49:26,887 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:49:26,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:49:26,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:49:26,891 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:49:26,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:49:26,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:49:26,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:49:26,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:49:26,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:49:26,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:49:26,899 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:49:26,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:49:26,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:49:26,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:49:26,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:49:26,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:49:26,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:49:26,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:49:26,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:49:26,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:49:26,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:49:26,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:49:26,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:49:26,913 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:49:26,913 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:49:26,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:49:26,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:49:26,915 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 18:49:26,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:49:26,927 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:49:26,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:49:26,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:49:26,932 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:49:26,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:49:26,933 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:49:26,933 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:49:26,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:49:26,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:49:26,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:49:26,934 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:49:26,934 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:49:26,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:49:26,935 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:49:26,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:49:26,935 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:49:26,936 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:49:26,936 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:49:26,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:49:26,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:49:26,936 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:49:26,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:49:26,937 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:49:26,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:49:27,006 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:49:27,009 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:49:27,011 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:49:27,012 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:49:27,012 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 18:49:27,132 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:49:27,133 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:49:27,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:49:27,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:49:27,138 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:49:27,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:49:27" (1/1) ... [2018-02-04 18:49:27,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5899baa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27, skipping insertion in model container [2018-02-04 18:49:27,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:49:27" (1/1) ... [2018-02-04 18:49:27,153 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:49:27,167 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:49:27,252 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:49:27,263 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:49:27,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27 WrapperNode [2018-02-04 18:49:27,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:49:27,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:49:27,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:49:27,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:49:27,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27" (1/1) ... [2018-02-04 18:49:27,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27" (1/1) ... [2018-02-04 18:49:27,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27" (1/1) ... [2018-02-04 18:49:27,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27" (1/1) ... [2018-02-04 18:49:27,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27" (1/1) ... [2018-02-04 18:49:27,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27" (1/1) ... [2018-02-04 18:49:27,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27" (1/1) ... [2018-02-04 18:49:27,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:49:27,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:49:27,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:49:27,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:49:27,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27" (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 18:49:27,325 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:49:27,325 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:49:27,325 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 18:49:27,325 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:49:27,325 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:49:27,325 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:49:27,325 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:49:27,326 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:49:27,326 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:49:27,326 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 18:49:27,326 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:49:27,326 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:49:27,326 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:49:27,436 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:49:27,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:49:27 BoogieIcfgContainer [2018-02-04 18:49:27,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:49:27,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:49:27,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:49:27,439 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:49:27,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:49:27" (1/3) ... [2018-02-04 18:49:27,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3745a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:49:27, skipping insertion in model container [2018-02-04 18:49:27,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:27" (2/3) ... [2018-02-04 18:49:27,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3745a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:49:27, skipping insertion in model container [2018-02-04 18:49:27,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:49:27" (3/3) ... [2018-02-04 18:49:27,442 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-02-04 18:49:27,450 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:49:27,456 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 18:49:27,495 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:49:27,496 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:49:27,496 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:49:27,496 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:49:27,496 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:49:27,496 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:49:27,496 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:49:27,496 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:49:27,497 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:49:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 18:49:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 18:49:27,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:27,520 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:27,520 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 18:49:27,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:27,526 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:27,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:27,571 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:27,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:27,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:49:27,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:27,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:49:27,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:49:27,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:49:27,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:49:27,715 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 18:49:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:27,785 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 18:49:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:49:27,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 18:49:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:27,792 INFO L225 Difference]: With dead ends: 63 [2018-02-04 18:49:27,792 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 18:49:27,793 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 18:49:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 18:49:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 18:49:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 18:49:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 18:49:27,869 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 18:49:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:27,869 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 18:49:27,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:49:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 18:49:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 18:49:27,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:27,870 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:27,870 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:27,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 18:49:27,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:27,870 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:27,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:27,871 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:27,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:27,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:49:27,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:27,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:49:27,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:49:27,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:49:27,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:49:27,907 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-04 18:49:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:27,945 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 18:49:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:49:27,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 18:49:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:27,947 INFO L225 Difference]: With dead ends: 60 [2018-02-04 18:49:27,947 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 18:49:27,948 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 18:49:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 18:49:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-04 18:49:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 18:49:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-04 18:49:27,951 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-04 18:49:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:27,952 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-04 18:49:27,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:49:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-04 18:49:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:49:27,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:27,953 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 18:49:27,953 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:27,953 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 18:49:27,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:27,953 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:27,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:27,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:27,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:27,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:49:28,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:28,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:49:28,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:49:28,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:49:28,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:49:28,104 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-04 18:49:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:28,168 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 18:49:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:49:28,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 18:49:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:28,169 INFO L225 Difference]: With dead ends: 54 [2018-02-04 18:49:28,169 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 18:49:28,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:49:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 18:49:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 18:49:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 18:49:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-04 18:49:28,172 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-04 18:49:28,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:28,173 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-04 18:49:28,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:49:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-04 18:49:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:49:28,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:28,173 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 18:49:28,173 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 18:49:28,173 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:28,173 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:28,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,174 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:28,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:28,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:49:28,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:28,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:49:28,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:49:28,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:49:28,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:49:28,208 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-04 18:49:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:28,247 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 18:49:28,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:49:28,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 18:49:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:28,249 INFO L225 Difference]: With dead ends: 50 [2018-02-04 18:49:28,249 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 18:49:28,249 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 18:49:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 18:49:28,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 18:49:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 18:49:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 18:49:28,251 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-04 18:49:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:28,252 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 18:49:28,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:49:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 18:49:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 18:49:28,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:28,252 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 18:49:28,252 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:28,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 18:49:28,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:28,253 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:28,253 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,253 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:28,253 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:28,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:28,299 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 18:49:28,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:28,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:28,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:28,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:28,339 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 18:49:28,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:28,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-04 18:49:28,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:49:28,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:49:28,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:49:28,340 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-02-04 18:49:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:28,366 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-02-04 18:49:28,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:49:28,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 18:49:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:28,367 INFO L225 Difference]: With dead ends: 65 [2018-02-04 18:49:28,367 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 18:49:28,367 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 18:49:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 18:49:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-02-04 18:49:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 18:49:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-02-04 18:49:28,373 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-02-04 18:49:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:28,373 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-02-04 18:49:28,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:49:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-02-04 18:49:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 18:49:28,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:28,374 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 18:49:28,374 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-04 18:49:28,374 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:28,375 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:28,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,376 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:28,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:28,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:28,412 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 18:49:28,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:28,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:49:28,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:49:28,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:49:28,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:49:28,414 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-02-04 18:49:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:28,455 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-04 18:49:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:49:28,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 18:49:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:28,456 INFO L225 Difference]: With dead ends: 66 [2018-02-04 18:49:28,456 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 18:49:28,456 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 18:49:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 18:49:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-02-04 18:49:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 18:49:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 18:49:28,458 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2018-02-04 18:49:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:28,459 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 18:49:28,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:49:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 18:49:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 18:49:28,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:28,459 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 18:49:28,459 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:28,460 INFO L82 PathProgramCache]: Analyzing trace with hash -280350351, now seen corresponding path program 2 times [2018-02-04 18:49:28,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:28,460 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:28,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,460 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:28,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:28,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:28,524 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 18:49:28,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:28,525 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:28,526 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:28,543 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:49:28,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:28,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:28,600 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 18:49:28,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:49:28,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2018-02-04 18:49:28,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:49:28,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:49:28,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:49:28,601 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 12 states. [2018-02-04 18:49:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:28,721 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-02-04 18:49:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:49:28,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-04 18:49:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:28,722 INFO L225 Difference]: With dead ends: 88 [2018-02-04 18:49:28,722 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 18:49:28,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:49:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 18:49:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-02-04 18:49:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 18:49:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-04 18:49:28,728 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2018-02-04 18:49:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:28,728 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-04 18:49:28,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:49:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-04 18:49:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 18:49:28,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:28,729 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 18:49:28,730 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:28,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-04 18:49:28,730 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:28,730 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:28,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,731 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:28,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:28,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:28,758 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 18:49:28,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:28,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:28,759 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:28,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:28,781 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 18:49:28,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:28,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-04 18:49:28,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:49:28,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:49:28,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:49:28,782 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 5 states. [2018-02-04 18:49:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:28,831 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-02-04 18:49:28,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:49:28,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-04 18:49:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:28,834 INFO L225 Difference]: With dead ends: 98 [2018-02-04 18:49:28,834 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 18:49:28,834 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 18:49:28,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 18:49:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-02-04 18:49:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 18:49:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-04 18:49:28,840 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 31 [2018-02-04 18:49:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:28,840 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-04 18:49:28,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:49:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-04 18:49:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 18:49:28,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:28,842 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 18:49:28,843 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:28,843 INFO L82 PathProgramCache]: Analyzing trace with hash -193392944, now seen corresponding path program 1 times [2018-02-04 18:49:28,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:28,843 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:28,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,844 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:28,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:28,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:28,914 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 18:49:28,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:28,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:49:28,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:49:28,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:49:28,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:49:28,915 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-04 18:49:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:28,981 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-02-04 18:49:28,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:49:28,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-02-04 18:49:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:28,982 INFO L225 Difference]: With dead ends: 87 [2018-02-04 18:49:28,982 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 18:49:28,982 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 18:49:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 18:49:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 18:49:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 18:49:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 18:49:28,985 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 40 [2018-02-04 18:49:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:28,986 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 18:49:28,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:49:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 18:49:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 18:49:28,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:28,986 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 18:49:28,986 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:28,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1033895800, now seen corresponding path program 2 times [2018-02-04 18:49:28,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:28,987 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:28,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,987 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:28,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:28,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:29,036 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 18:49:29,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:29,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:29,038 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:29,054 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:49:29,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:29,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:29,087 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 18:49:29,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:29,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 18:49:29,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:49:29,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:49:29,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:49:29,088 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 8 states. [2018-02-04 18:49:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:29,157 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-04 18:49:29,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:49:29,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 18:49:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:29,157 INFO L225 Difference]: With dead ends: 90 [2018-02-04 18:49:29,157 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 18:49:29,158 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 18:49:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 18:49:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-02-04 18:49:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 18:49:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-02-04 18:49:29,162 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2018-02-04 18:49:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:29,162 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-02-04 18:49:29,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:49:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-02-04 18:49:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 18:49:29,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:29,163 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 18:49:29,164 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash -821508032, now seen corresponding path program 3 times [2018-02-04 18:49:29,164 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:29,164 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:29,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:29,165 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:29,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:29,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:29,222 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 18:49:29,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:29,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:29,223 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:49:29,234 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 18:49:29,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:29,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:29,290 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 18:49:29,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:29,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 11 [2018-02-04 18:49:29,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:49:29,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:49:29,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:49:29,291 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 12 states. [2018-02-04 18:49:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:29,481 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-02-04 18:49:29,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 18:49:29,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-02-04 18:49:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:29,481 INFO L225 Difference]: With dead ends: 150 [2018-02-04 18:49:29,482 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 18:49:29,482 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 18:49:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 18:49:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 113. [2018-02-04 18:49:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 18:49:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-02-04 18:49:29,486 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 52 [2018-02-04 18:49:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:29,487 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-02-04 18:49:29,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:49:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-02-04 18:49:29,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 18:49:29,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:29,488 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 18:49:29,488 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 1 times [2018-02-04 18:49:29,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:29,488 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:29,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:29,489 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:29,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:29,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:29,545 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 18:49:29,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:29,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:29,546 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:29,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:29,595 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 18:49:29,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:29,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-02-04 18:49:29,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 18:49:29,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 18:49:29,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-04 18:49:29,597 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 11 states. [2018-02-04 18:49:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:29,706 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-04 18:49:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:49:29,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-02-04 18:49:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:29,708 INFO L225 Difference]: With dead ends: 133 [2018-02-04 18:49:29,708 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 18:49:29,708 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 18:49:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 18:49:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 92. [2018-02-04 18:49:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 18:49:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-02-04 18:49:29,713 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 67 [2018-02-04 18:49:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:29,714 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-02-04 18:49:29,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 18:49:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-02-04 18:49:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 18:49:29,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:29,715 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 18:49:29,715 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash 737150591, now seen corresponding path program 4 times [2018-02-04 18:49:29,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:29,715 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:29,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:29,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:29,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:29,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:29,795 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 18:49:29,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:29,796 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:29,796 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:49:29,809 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:49:29,809 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:29,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:29,913 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 18:49:29,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:29,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-02-04 18:49:29,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:49:29,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:49:29,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:49:29,914 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 17 states. [2018-02-04 18:49:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:30,265 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-02-04 18:49:30,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:49:30,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-02-04 18:49:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:30,267 INFO L225 Difference]: With dead ends: 157 [2018-02-04 18:49:30,271 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 18:49:30,271 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 18:49:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 18:49:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2018-02-04 18:49:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 18:49:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-02-04 18:49:30,276 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 88 [2018-02-04 18:49:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:30,276 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-02-04 18:49:30,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 18:49:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-02-04 18:49:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 18:49:30,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:30,278 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 18:49:30,278 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:30,279 INFO L82 PathProgramCache]: Analyzing trace with hash 347418750, now seen corresponding path program 5 times [2018-02-04 18:49:30,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:30,279 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:30,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:30,280 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:30,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:30,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:30,420 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 18:49:30,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:30,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:30,421 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:49:30,472 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 18:49:30,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:30,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:30,548 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 18:49:30,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:30,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-02-04 18:49:30,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 18:49:30,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 18:49:30,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:49:30,550 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 14 states. [2018-02-04 18:49:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:30,627 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-02-04 18:49:30,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:49:30,628 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-02-04 18:49:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:30,629 INFO L225 Difference]: With dead ends: 152 [2018-02-04 18:49:30,629 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 18:49:30,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:49:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 18:49:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-02-04 18:49:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 18:49:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-04 18:49:30,631 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 124 [2018-02-04 18:49:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:30,631 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-04 18:49:30,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 18:49:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-04 18:49:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-02-04 18:49:30,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:30,633 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 18:49:30,633 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:30,633 INFO L82 PathProgramCache]: Analyzing trace with hash 714000310, now seen corresponding path program 6 times [2018-02-04 18:49:30,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:30,633 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:30,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:30,633 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:30,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:30,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:30,718 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 18:49:30,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:30,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:30,719 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:49:30,750 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-04 18:49:30,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:30,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:30,782 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 18:49:30,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:30,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 18:49:30,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:49:30,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:49:30,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:49:30,784 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 7 states. [2018-02-04 18:49:30,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:30,842 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2018-02-04 18:49:30,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:49:30,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-02-04 18:49:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:30,843 INFO L225 Difference]: With dead ends: 155 [2018-02-04 18:49:30,843 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 18:49:30,843 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 18:49:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 18:49:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2018-02-04 18:49:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 18:49:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2018-02-04 18:49:30,847 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 130 [2018-02-04 18:49:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:30,848 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2018-02-04 18:49:30,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:49:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2018-02-04 18:49:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-04 18:49:30,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:30,850 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 18:49:30,850 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:30,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1770915246, now seen corresponding path program 7 times [2018-02-04 18:49:30,850 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:30,850 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:30,851 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:30,851 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:30,851 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:30,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:30,956 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 18:49:30,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:30,956 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:30,957 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:30,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:31,090 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 18:49:31,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:31,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-02-04 18:49:31,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:49:31,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:49:31,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:49:31,091 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 21 states. [2018-02-04 18:49:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:31,265 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2018-02-04 18:49:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 18:49:31,265 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 136 [2018-02-04 18:49:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:31,266 INFO L225 Difference]: With dead ends: 196 [2018-02-04 18:49:31,266 INFO L226 Difference]: Without dead ends: 196 [2018-02-04 18:49:31,266 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 18:49:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-04 18:49:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2018-02-04 18:49:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 18:49:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 192 transitions. [2018-02-04 18:49:31,269 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 192 transitions. Word has length 136 [2018-02-04 18:49:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:31,269 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 192 transitions. [2018-02-04 18:49:31,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:49:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 192 transitions. [2018-02-04 18:49:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 18:49:31,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:31,270 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 18:49:31,270 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:31,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1745720749, now seen corresponding path program 8 times [2018-02-04 18:49:31,271 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:31,271 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:31,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:31,271 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:31,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:31,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:31,375 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 18:49:31,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:31,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:31,376 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:31,390 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:49:31,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:31,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:31,457 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 18:49:31,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:31,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-02-04 18:49:31,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:49:31,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:49:31,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:49:31,458 INFO L87 Difference]: Start difference. First operand 188 states and 192 transitions. Second operand 17 states. [2018-02-04 18:49:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:31,578 INFO L93 Difference]: Finished difference Result 200 states and 202 transitions. [2018-02-04 18:49:31,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 18:49:31,578 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 172 [2018-02-04 18:49:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:31,579 INFO L225 Difference]: With dead ends: 200 [2018-02-04 18:49:31,579 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 18:49:31,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:49:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 18:49:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2018-02-04 18:49:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 18:49:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-02-04 18:49:31,582 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 172 [2018-02-04 18:49:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:31,582 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-02-04 18:49:31,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 18:49:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-02-04 18:49:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-04 18:49:31,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:31,583 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 18:49:31,583 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 655613349, now seen corresponding path program 9 times [2018-02-04 18:49:31,583 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:31,583 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:31,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:31,584 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:31,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:31,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:31,693 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 18:49:31,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:31,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:31,695 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:49:31,720 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 18:49:31,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:31,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:31,816 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 18:49:31,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:31,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-02-04 18:49:31,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:49:31,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:49:31,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:49:31,817 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 18 states. [2018-02-04 18:49:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:32,048 INFO L93 Difference]: Finished difference Result 256 states and 261 transitions. [2018-02-04 18:49:32,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:49:32,048 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 178 [2018-02-04 18:49:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:32,049 INFO L225 Difference]: With dead ends: 256 [2018-02-04 18:49:32,049 INFO L226 Difference]: Without dead ends: 256 [2018-02-04 18:49:32,049 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 18:49:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-04 18:49:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 236. [2018-02-04 18:49:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 18:49:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 240 transitions. [2018-02-04 18:49:32,052 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 240 transitions. Word has length 178 [2018-02-04 18:49:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:32,052 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 240 transitions. [2018-02-04 18:49:32,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:49:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 240 transitions. [2018-02-04 18:49:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-02-04 18:49:32,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:32,054 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 18:49:32,054 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:32,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1371544148, now seen corresponding path program 10 times [2018-02-04 18:49:32,054 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:32,054 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:32,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:32,055 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:32,055 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:32,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:32,233 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 18:49:32,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:32,234 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:32,234 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:49:32,254 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:49:32,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:32,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:32,524 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 18:49:32,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:32,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 30 [2018-02-04 18:49:32,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 18:49:32,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 18:49:32,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-02-04 18:49:32,526 INFO L87 Difference]: Start difference. First operand 236 states and 240 transitions. Second operand 30 states. [2018-02-04 18:49:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:32,987 INFO L93 Difference]: Finished difference Result 256 states and 258 transitions. [2018-02-04 18:49:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 18:49:32,988 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 226 [2018-02-04 18:49:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:32,989 INFO L225 Difference]: With dead ends: 256 [2018-02-04 18:49:32,989 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 18:49:32,989 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 18:49:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 18:49:32,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2018-02-04 18:49:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 18:49:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 244 transitions. [2018-02-04 18:49:32,993 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 244 transitions. Word has length 226 [2018-02-04 18:49:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:32,993 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 244 transitions. [2018-02-04 18:49:32,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 18:49:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 244 transitions. [2018-02-04 18:49:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 18:49:32,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:32,994 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 18:49:32,994 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1000315148, now seen corresponding path program 11 times [2018-02-04 18:49:32,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:32,995 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:32,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:32,995 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:32,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:33,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:33,106 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 18:49:33,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:33,106 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:33,107 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:49:33,165 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-04 18:49:33,165 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:33,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:33,262 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 18:49:33,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:33,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-02-04 18:49:33,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:49:33,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:49:33,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:49:33,263 INFO L87 Difference]: Start difference. First operand 242 states and 244 transitions. Second operand 17 states. [2018-02-04 18:49:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:33,336 INFO L93 Difference]: Finished difference Result 257 states and 260 transitions. [2018-02-04 18:49:33,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:49:33,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 232 [2018-02-04 18:49:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:33,337 INFO L225 Difference]: With dead ends: 257 [2018-02-04 18:49:33,337 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 18:49:33,337 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 18:49:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 18:49:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 248. [2018-02-04 18:49:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 18:49:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 251 transitions. [2018-02-04 18:49:33,340 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 251 transitions. Word has length 232 [2018-02-04 18:49:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:33,340 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 251 transitions. [2018-02-04 18:49:33,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 18:49:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 251 transitions. [2018-02-04 18:49:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-04 18:49:33,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:33,341 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 18:49:33,341 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:33,341 INFO L82 PathProgramCache]: Analyzing trace with hash 710278788, now seen corresponding path program 12 times [2018-02-04 18:49:33,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:33,341 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:33,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:33,342 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:33,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:33,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:33,614 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 18:49:33,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:33,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:33,614 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:49:33,704 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-02-04 18:49:33,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:33,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:33,842 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 18:49:33,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:33,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 27 [2018-02-04 18:49:33,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 18:49:33,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 18:49:33,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-02-04 18:49:33,844 INFO L87 Difference]: Start difference. First operand 248 states and 251 transitions. Second operand 27 states. [2018-02-04 18:49:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:34,452 INFO L93 Difference]: Finished difference Result 325 states and 330 transitions. [2018-02-04 18:49:34,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 18:49:34,452 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 238 [2018-02-04 18:49:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:34,454 INFO L225 Difference]: With dead ends: 325 [2018-02-04 18:49:34,454 INFO L226 Difference]: Without dead ends: 325 [2018-02-04 18:49:34,454 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 18:49:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-04 18:49:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 308. [2018-02-04 18:49:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 18:49:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 313 transitions. [2018-02-04 18:49:34,461 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 313 transitions. Word has length 238 [2018-02-04 18:49:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:34,462 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 313 transitions. [2018-02-04 18:49:34,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 18:49:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 313 transitions. [2018-02-04 18:49:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 18:49:34,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:34,463 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 18:49:34,463 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2034889173, now seen corresponding path program 13 times [2018-02-04 18:49:34,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:34,464 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:34,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:34,464 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:34,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:34,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:34,707 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 18:49:34,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:34,708 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:34,709 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:34,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:35,024 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 18:49:35,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:35,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2018-02-04 18:49:35,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 18:49:35,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 18:49:35,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 18:49:35,026 INFO L87 Difference]: Start difference. First operand 308 states and 313 transitions. Second operand 33 states. [2018-02-04 18:49:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:35,929 INFO L93 Difference]: Finished difference Result 385 states and 389 transitions. [2018-02-04 18:49:35,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 18:49:35,930 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 292 [2018-02-04 18:49:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:35,931 INFO L225 Difference]: With dead ends: 385 [2018-02-04 18:49:35,931 INFO L226 Difference]: Without dead ends: 376 [2018-02-04 18:49:35,932 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 18:49:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-02-04 18:49:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2018-02-04 18:49:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 18:49:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 372 transitions. [2018-02-04 18:49:35,938 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 372 transitions. Word has length 292 [2018-02-04 18:49:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:35,939 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 372 transitions. [2018-02-04 18:49:35,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 18:49:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 372 transitions. [2018-02-04 18:49:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-02-04 18:49:35,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:35,941 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 18:49:35,941 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1060515318, now seen corresponding path program 14 times [2018-02-04 18:49:35,941 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:35,941 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:35,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:35,942 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:35,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:35,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:36,348 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 18:49:36,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:36,348 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:36,349 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:36,396 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:49:36,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:36,409 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:36,606 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 18:49:36,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:36,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-02-04 18:49:36,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 18:49:36,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 18:49:36,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-02-04 18:49:36,608 INFO L87 Difference]: Start difference. First operand 368 states and 372 transitions. Second operand 26 states. [2018-02-04 18:49:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:36,903 INFO L93 Difference]: Finished difference Result 380 states and 382 transitions. [2018-02-04 18:49:36,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:49:36,903 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 352 [2018-02-04 18:49:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:36,905 INFO L225 Difference]: With dead ends: 380 [2018-02-04 18:49:36,905 INFO L226 Difference]: Without dead ends: 374 [2018-02-04 18:49:36,906 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 18:49:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-02-04 18:49:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2018-02-04 18:49:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 18:49:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 370 transitions. [2018-02-04 18:49:36,911 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 370 transitions. Word has length 352 [2018-02-04 18:49:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:36,912 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 370 transitions. [2018-02-04 18:49:36,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 18:49:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 370 transitions. [2018-02-04 18:49:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-02-04 18:49:36,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:36,914 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 18:49:36,914 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:36,914 INFO L82 PathProgramCache]: Analyzing trace with hash -211464126, now seen corresponding path program 15 times [2018-02-04 18:49:36,914 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:36,915 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:36,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:36,915 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:36,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:36,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:37,212 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 18:49:37,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:37,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:37,213 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:49:37,284 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-02-04 18:49:37,284 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:37,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:37,460 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 18:49:37,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:37,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-02-04 18:49:37,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:49:37,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:49:37,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:49:37,461 INFO L87 Difference]: Start difference. First operand 368 states and 370 transitions. Second operand 21 states. [2018-02-04 18:49:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:37,699 INFO L93 Difference]: Finished difference Result 383 states and 386 transitions. [2018-02-04 18:49:37,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:49:37,699 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 358 [2018-02-04 18:49:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:37,701 INFO L225 Difference]: With dead ends: 383 [2018-02-04 18:49:37,701 INFO L226 Difference]: Without dead ends: 383 [2018-02-04 18:49:37,701 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 18:49:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-04 18:49:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2018-02-04 18:49:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-04 18:49:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 377 transitions. [2018-02-04 18:49:37,707 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 377 transitions. Word has length 358 [2018-02-04 18:49:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:37,708 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 377 transitions. [2018-02-04 18:49:37,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:49:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 377 transitions. [2018-02-04 18:49:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-02-04 18:49:37,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:37,710 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 18:49:37,710 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:37,711 INFO L82 PathProgramCache]: Analyzing trace with hash -146344646, now seen corresponding path program 16 times [2018-02-04 18:49:37,711 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:37,711 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:37,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:37,712 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:37,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:37,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:38,201 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 18:49:38,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:38,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:38,202 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:49:38,232 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:49:38,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:38,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:38,621 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 18:49:38,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:38,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 42 [2018-02-04 18:49:38,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 18:49:38,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 18:49:38,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1421, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 18:49:38,623 INFO L87 Difference]: Start difference. First operand 374 states and 377 transitions. Second operand 42 states. [2018-02-04 18:49:39,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:39,393 INFO L93 Difference]: Finished difference Result 454 states and 458 transitions. [2018-02-04 18:49:39,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 18:49:39,393 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 364 [2018-02-04 18:49:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:39,395 INFO L225 Difference]: With dead ends: 454 [2018-02-04 18:49:39,395 INFO L226 Difference]: Without dead ends: 454 [2018-02-04 18:49:39,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=879, Invalid=3677, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 18:49:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-02-04 18:49:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 446. [2018-02-04 18:49:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-04 18:49:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 450 transitions. [2018-02-04 18:49:39,402 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 450 transitions. Word has length 364 [2018-02-04 18:49:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:39,402 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 450 transitions. [2018-02-04 18:49:39,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 18:49:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 450 transitions. [2018-02-04 18:49:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-02-04 18:49:39,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:39,405 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 18:49:39,405 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1459193583, now seen corresponding path program 17 times [2018-02-04 18:49:39,405 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:39,406 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:39,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:39,406 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:39,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:39,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:39,772 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 18:49:39,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:39,772 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:39,773 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:49:39,986 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-02-04 18:49:39,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:40,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:40,192 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 18:49:40,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:40,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-04 18:49:40,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 18:49:40,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 18:49:40,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-04 18:49:40,194 INFO L87 Difference]: Start difference. First operand 446 states and 450 transitions. Second operand 23 states. [2018-02-04 18:49:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:40,420 INFO L93 Difference]: Finished difference Result 461 states and 466 transitions. [2018-02-04 18:49:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:49:40,421 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 430 [2018-02-04 18:49:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:40,422 INFO L225 Difference]: With dead ends: 461 [2018-02-04 18:49:40,422 INFO L226 Difference]: Without dead ends: 461 [2018-02-04 18:49:40,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-04 18:49:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-04 18:49:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 452. [2018-02-04 18:49:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 18:49:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 457 transitions. [2018-02-04 18:49:40,426 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 457 transitions. Word has length 430 [2018-02-04 18:49:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:40,426 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 457 transitions. [2018-02-04 18:49:40,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 18:49:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 457 transitions. [2018-02-04 18:49:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-02-04 18:49:40,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:40,428 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 18:49:40,428 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:40,428 INFO L82 PathProgramCache]: Analyzing trace with hash -275511607, now seen corresponding path program 18 times [2018-02-04 18:49:40,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:40,428 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:40,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:40,429 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:40,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:40,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:40,838 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 18:49:40,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:40,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:40,838 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:49:40,911 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-02-04 18:49:40,911 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:40,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:41,201 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 18:49:41,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:41,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 37 [2018-02-04 18:49:41,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 18:49:41,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 18:49:41,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 18:49:41,203 INFO L87 Difference]: Start difference. First operand 452 states and 457 transitions. Second operand 37 states. [2018-02-04 18:49:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:41,949 INFO L93 Difference]: Finished difference Result 535 states and 542 transitions. [2018-02-04 18:49:41,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 18:49:41,949 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 436 [2018-02-04 18:49:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:41,951 INFO L225 Difference]: With dead ends: 535 [2018-02-04 18:49:41,951 INFO L226 Difference]: Without dead ends: 535 [2018-02-04 18:49:41,951 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 18:49:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-04 18:49:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 527. [2018-02-04 18:49:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-02-04 18:49:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 534 transitions. [2018-02-04 18:49:41,955 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 534 transitions. Word has length 436 [2018-02-04 18:49:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:41,956 INFO L432 AbstractCegarLoop]: Abstraction has 527 states and 534 transitions. [2018-02-04 18:49:41,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 18:49:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 534 transitions. [2018-02-04 18:49:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-02-04 18:49:41,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:41,958 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 18:49:41,958 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1015516064, now seen corresponding path program 19 times [2018-02-04 18:49:41,958 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:41,958 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:41,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:41,958 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:41,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:41,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:42,493 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 18:49:42,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:42,493 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:42,494 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:42,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:42,767 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 18:49:42,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:42,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-02-04 18:49:42,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 18:49:42,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 18:49:42,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-02-04 18:49:42,769 INFO L87 Difference]: Start difference. First operand 527 states and 534 transitions. Second operand 32 states. [2018-02-04 18:49:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:43,116 INFO L93 Difference]: Finished difference Result 545 states and 548 transitions. [2018-02-04 18:49:43,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 18:49:43,117 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 502 [2018-02-04 18:49:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:43,118 INFO L225 Difference]: With dead ends: 545 [2018-02-04 18:49:43,118 INFO L226 Difference]: Without dead ends: 524 [2018-02-04 18:49:43,119 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 18:49:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-02-04 18:49:43,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 518. [2018-02-04 18:49:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-02-04 18:49:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 520 transitions. [2018-02-04 18:49:43,124 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 520 transitions. Word has length 502 [2018-02-04 18:49:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:43,125 INFO L432 AbstractCegarLoop]: Abstraction has 518 states and 520 transitions. [2018-02-04 18:49:43,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 18:49:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 520 transitions. [2018-02-04 18:49:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-02-04 18:49:43,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:43,128 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 18:49:43,128 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:43,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1558061400, now seen corresponding path program 20 times [2018-02-04 18:49:43,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:43,129 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:43,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:43,129 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:43,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:43,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:43,536 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 18:49:43,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:43,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:43,536 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:43,582 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:49:43,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:43,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:43,714 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 18:49:43,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:43,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-04 18:49:43,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 18:49:43,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 18:49:43,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:49:43,716 INFO L87 Difference]: Start difference. First operand 518 states and 520 transitions. Second operand 15 states. [2018-02-04 18:49:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:43,894 INFO L93 Difference]: Finished difference Result 533 states and 536 transitions. [2018-02-04 18:49:43,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 18:49:43,894 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 508 [2018-02-04 18:49:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:43,895 INFO L225 Difference]: With dead ends: 533 [2018-02-04 18:49:43,895 INFO L226 Difference]: Without dead ends: 533 [2018-02-04 18:49:43,896 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 18:49:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-04 18:49:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2018-02-04 18:49:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-02-04 18:49:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 527 transitions. [2018-02-04 18:49:43,903 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 527 transitions. Word has length 508 [2018-02-04 18:49:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:43,903 INFO L432 AbstractCegarLoop]: Abstraction has 524 states and 527 transitions. [2018-02-04 18:49:43,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 18:49:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 527 transitions. [2018-02-04 18:49:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-02-04 18:49:43,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:43,907 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 18:49:43,907 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:43,907 INFO L82 PathProgramCache]: Analyzing trace with hash -387441200, now seen corresponding path program 21 times [2018-02-04 18:49:43,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:43,907 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:43,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:43,908 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:43,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:43,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:44,484 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 18:49:44,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:44,484 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:44,484 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:49:44,550 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-02-04 18:49:44,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:44,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:45,227 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 18:49:45,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:45,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 50 [2018-02-04 18:49:45,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 18:49:45,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 18:49:45,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=2030, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 18:49:45,229 INFO L87 Difference]: Start difference. First operand 524 states and 527 transitions. Second operand 50 states. [2018-02-04 18:49:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:46,032 INFO L93 Difference]: Finished difference Result 616 states and 620 transitions. [2018-02-04 18:49:46,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 18:49:46,032 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 514 [2018-02-04 18:49:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:46,033 INFO L225 Difference]: With dead ends: 616 [2018-02-04 18:49:46,033 INFO L226 Difference]: Without dead ends: 616 [2018-02-04 18:49:46,035 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1240, Invalid=5402, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 18:49:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-02-04 18:49:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 608. [2018-02-04 18:49:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-02-04 18:49:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 612 transitions. [2018-02-04 18:49:46,041 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 612 transitions. Word has length 514 [2018-02-04 18:49:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:46,041 INFO L432 AbstractCegarLoop]: Abstraction has 608 states and 612 transitions. [2018-02-04 18:49:46,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 18:49:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 612 transitions. [2018-02-04 18:49:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-02-04 18:49:46,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:46,044 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 18:49:46,044 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1034822807, now seen corresponding path program 22 times [2018-02-04 18:49:46,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:46,045 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:46,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:46,045 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:46,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:46,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:46,491 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 18:49:46,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:46,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:46,492 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:49:46,546 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:49:46,546 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:46,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:46,842 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 18:49:46,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:46,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-02-04 18:49:46,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 18:49:46,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 18:49:46,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-02-04 18:49:46,844 INFO L87 Difference]: Start difference. First operand 608 states and 612 transitions. Second operand 26 states. [2018-02-04 18:49:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:47,117 INFO L93 Difference]: Finished difference Result 623 states and 628 transitions. [2018-02-04 18:49:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 18:49:47,117 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 592 [2018-02-04 18:49:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:47,119 INFO L225 Difference]: With dead ends: 623 [2018-02-04 18:49:47,119 INFO L226 Difference]: Without dead ends: 623 [2018-02-04 18:49:47,119 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 18:49:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-02-04 18:49:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 614. [2018-02-04 18:49:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-02-04 18:49:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 619 transitions. [2018-02-04 18:49:47,127 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 619 transitions. Word has length 592 [2018-02-04 18:49:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:47,128 INFO L432 AbstractCegarLoop]: Abstraction has 614 states and 619 transitions. [2018-02-04 18:49:47,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 18:49:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 619 transitions. [2018-02-04 18:49:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-02-04 18:49:47,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:47,133 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 18:49:47,133 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:47,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1525516849, now seen corresponding path program 23 times [2018-02-04 18:49:47,133 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:47,133 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:47,134 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:47,134 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:47,134 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:47,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:47,872 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 18:49:47,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:47,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:47,872 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:49:48,163 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-02-04 18:49:48,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:48,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:48,959 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 18:49:48,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:48,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 53 [2018-02-04 18:49:48,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 18:49:48,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 18:49:48,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=2282, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 18:49:48,961 INFO L87 Difference]: Start difference. First operand 614 states and 619 transitions. Second operand 53 states. [2018-02-04 18:49:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:49,997 INFO L93 Difference]: Finished difference Result 709 states and 716 transitions. [2018-02-04 18:49:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 18:49:49,998 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 598 [2018-02-04 18:49:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:49,999 INFO L225 Difference]: With dead ends: 709 [2018-02-04 18:49:49,999 INFO L226 Difference]: Without dead ends: 709 [2018-02-04 18:49:50,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1376, Invalid=6106, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 18:49:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-02-04 18:49:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 701. [2018-02-04 18:49:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-02-04 18:49:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 708 transitions. [2018-02-04 18:49:50,007 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 708 transitions. Word has length 598 [2018-02-04 18:49:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:50,008 INFO L432 AbstractCegarLoop]: Abstraction has 701 states and 708 transitions. [2018-02-04 18:49:50,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 18:49:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 708 transitions. [2018-02-04 18:49:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-02-04 18:49:50,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:50,013 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 18:49:50,013 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash 775068438, now seen corresponding path program 24 times [2018-02-04 18:49:50,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:50,013 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:50,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:50,014 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:50,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:50,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:50,757 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 18:49:50,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:50,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:50,758 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:49:50,889 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-04 18:49:50,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:50,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:51,407 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 18:49:51,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:51,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 48 [2018-02-04 18:49:51,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 18:49:51,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 18:49:51,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1947, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 18:49:51,408 INFO L87 Difference]: Start difference. First operand 701 states and 708 transitions. Second operand 48 states. [2018-02-04 18:49:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:52,627 INFO L93 Difference]: Finished difference Result 884 states and 889 transitions. [2018-02-04 18:49:52,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 18:49:52,628 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 676 [2018-02-04 18:49:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:52,630 INFO L225 Difference]: With dead ends: 884 [2018-02-04 18:49:52,630 INFO L226 Difference]: Without dead ends: 788 [2018-02-04 18:49:52,632 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 18:49:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-02-04 18:49:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 776. [2018-02-04 18:49:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-02-04 18:49:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 779 transitions. [2018-02-04 18:49:52,642 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 779 transitions. Word has length 676 [2018-02-04 18:49:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:52,642 INFO L432 AbstractCegarLoop]: Abstraction has 776 states and 779 transitions. [2018-02-04 18:49:52,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 18:49:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 779 transitions. [2018-02-04 18:49:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2018-02-04 18:49:52,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:52,648 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 18:49:52,648 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1095262899, now seen corresponding path program 25 times [2018-02-04 18:49:52,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:52,649 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:52,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:52,649 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:52,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:52,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:53,615 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 18:49:53,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:53,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:53,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:53,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:54,052 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 18:49:54,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:54,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 41 [2018-02-04 18:49:54,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 18:49:54,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 18:49:54,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 18:49:54,054 INFO L87 Difference]: Start difference. First operand 776 states and 779 transitions. Second operand 41 states. [2018-02-04 18:49:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:54,568 INFO L93 Difference]: Finished difference Result 805 states and 808 transitions. [2018-02-04 18:49:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 18:49:54,568 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 766 [2018-02-04 18:49:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:54,570 INFO L225 Difference]: With dead ends: 805 [2018-02-04 18:49:54,570 INFO L226 Difference]: Without dead ends: 799 [2018-02-04 18:49:54,571 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 18:49:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-02-04 18:49:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 787. [2018-02-04 18:49:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-02-04 18:49:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 790 transitions. [2018-02-04 18:49:54,577 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 790 transitions. Word has length 766 [2018-02-04 18:49:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:54,577 INFO L432 AbstractCegarLoop]: Abstraction has 787 states and 790 transitions. [2018-02-04 18:49:54,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 18:49:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 790 transitions. [2018-02-04 18:49:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-02-04 18:49:54,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:54,581 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 18:49:54,581 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:54,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1755749701, now seen corresponding path program 26 times [2018-02-04 18:49:54,581 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:54,581 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:54,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:54,582 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:54,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:54,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:55,182 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 18:49:55,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:55,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:55,183 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:55,221 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:49:55,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:55,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:55,445 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 18:49:55,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:55,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-02-04 18:49:55,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 18:49:55,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 18:49:55,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-02-04 18:49:55,446 INFO L87 Difference]: Start difference. First operand 787 states and 790 transitions. Second operand 22 states. [2018-02-04 18:49:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:55,640 INFO L93 Difference]: Finished difference Result 798 states and 801 transitions. [2018-02-04 18:49:55,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 18:49:55,640 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 772 [2018-02-04 18:49:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:55,642 INFO L225 Difference]: With dead ends: 798 [2018-02-04 18:49:55,642 INFO L226 Difference]: Without dead ends: 798 [2018-02-04 18:49:55,642 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 18:49:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2018-02-04 18:49:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 788. [2018-02-04 18:49:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-02-04 18:49:55,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 791 transitions. [2018-02-04 18:49:55,647 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 791 transitions. Word has length 772 [2018-02-04 18:49:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:55,648 INFO L432 AbstractCegarLoop]: Abstraction has 788 states and 791 transitions. [2018-02-04 18:49:55,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 18:49:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 791 transitions. [2018-02-04 18:49:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-02-04 18:49:55,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:55,655 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 18:49:55,655 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1773325315, now seen corresponding path program 27 times [2018-02-04 18:49:55,656 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:55,656 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:55,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:55,656 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:55,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:55,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:56,297 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 18:49:56,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:56,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:56,297 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:49:56,346 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-02-04 18:49:56,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:56,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:56,498 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 18:49:56,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:56,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-04 18:49:56,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:49:56,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:49:56,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:49:56,500 INFO L87 Difference]: Start difference. First operand 788 states and 791 transitions. Second operand 18 states. [2018-02-04 18:49:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:56,664 INFO L93 Difference]: Finished difference Result 816 states and 821 transitions. [2018-02-04 18:49:56,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 18:49:56,664 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 778 [2018-02-04 18:49:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:56,666 INFO L225 Difference]: With dead ends: 816 [2018-02-04 18:49:56,666 INFO L226 Difference]: Without dead ends: 816 [2018-02-04 18:49:56,666 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 18:49:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2018-02-04 18:49:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 794. [2018-02-04 18:49:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-02-04 18:49:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 798 transitions. [2018-02-04 18:49:56,672 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 798 transitions. Word has length 778 [2018-02-04 18:49:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:56,673 INFO L432 AbstractCegarLoop]: Abstraction has 794 states and 798 transitions. [2018-02-04 18:49:56,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:49:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 798 transitions. [2018-02-04 18:49:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-02-04 18:49:56,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:56,680 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 18:49:56,680 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:56,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1537597621, now seen corresponding path program 28 times [2018-02-04 18:49:56,681 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:56,681 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:56,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:56,682 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:56,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:56,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:57,766 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 18:49:57,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:57,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:57,767 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:49:57,799 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:49:57,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:57,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:58,535 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 18:49:58,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:58,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 62 [2018-02-04 18:49:58,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 18:49:58,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 18:49:58,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=3146, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 18:49:58,536 INFO L87 Difference]: Start difference. First operand 794 states and 798 transitions. Second operand 62 states. [2018-02-04 18:49:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:59,551 INFO L93 Difference]: Finished difference Result 904 states and 908 transitions. [2018-02-04 18:49:59,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 18:49:59,551 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 784 [2018-02-04 18:49:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:59,552 INFO L225 Difference]: With dead ends: 904 [2018-02-04 18:49:59,553 INFO L226 Difference]: Without dead ends: 904 [2018-02-04 18:49:59,553 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 18:49:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-02-04 18:49:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 896. [2018-02-04 18:49:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-02-04 18:49:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 900 transitions. [2018-02-04 18:49:59,558 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 900 transitions. Word has length 784 [2018-02-04 18:49:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:59,559 INFO L432 AbstractCegarLoop]: Abstraction has 896 states and 900 transitions. [2018-02-04 18:49:59,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 18:49:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 900 transitions. [2018-02-04 18:49:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-02-04 18:49:59,563 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:59,563 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 18:49:59,563 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:59,563 INFO L82 PathProgramCache]: Analyzing trace with hash -894009052, now seen corresponding path program 29 times [2018-02-04 18:49:59,563 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:59,563 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:59,564 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:59,564 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:59,564 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:59,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:00,329 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 18:50:00,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:00,329 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:00,329 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:50:01,312 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-02-04 18:50:01,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:01,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:01,751 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 18:50:01,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:01,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-02-04 18:50:01,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 18:50:01,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 18:50:01,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:50:01,752 INFO L87 Difference]: Start difference. First operand 896 states and 900 transitions. Second operand 34 states. [2018-02-04 18:50:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:02,057 INFO L93 Difference]: Finished difference Result 911 states and 916 transitions. [2018-02-04 18:50:02,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 18:50:02,057 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 880 [2018-02-04 18:50:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:02,059 INFO L225 Difference]: With dead ends: 911 [2018-02-04 18:50:02,059 INFO L226 Difference]: Without dead ends: 911 [2018-02-04 18:50:02,059 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 18:50:02,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-02-04 18:50:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 902. [2018-02-04 18:50:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-02-04 18:50:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 907 transitions. [2018-02-04 18:50:02,064 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 907 transitions. Word has length 880 [2018-02-04 18:50:02,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:02,065 INFO L432 AbstractCegarLoop]: Abstraction has 902 states and 907 transitions. [2018-02-04 18:50:02,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 18:50:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 907 transitions. [2018-02-04 18:50:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2018-02-04 18:50:02,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:02,069 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 18:50:02,069 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:02,069 INFO L82 PathProgramCache]: Analyzing trace with hash 741635228, now seen corresponding path program 30 times [2018-02-04 18:50:02,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:02,070 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:02,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:02,070 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:02,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:02,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:03,372 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 18:50:03,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:03,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:03,373 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:50:03,571 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-04 18:50:03,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:03,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:03,945 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 18:50:03,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:03,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 24] total 42 [2018-02-04 18:50:03,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 18:50:03,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 18:50:03,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 18:50:03,946 INFO L87 Difference]: Start difference. First operand 902 states and 907 transitions. Second operand 42 states. [2018-02-04 18:50:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:04,655 INFO L93 Difference]: Finished difference Result 1110 states and 1119 transitions. [2018-02-04 18:50:04,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 18:50:04,655 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 886 [2018-02-04 18:50:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:04,657 INFO L225 Difference]: With dead ends: 1110 [2018-02-04 18:50:04,657 INFO L226 Difference]: Without dead ends: 1110 [2018-02-04 18:50:04,658 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 18:50:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2018-02-04 18:50:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1106. [2018-02-04 18:50:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-02-04 18:50:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1115 transitions. [2018-02-04 18:50:04,666 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1115 transitions. Word has length 886 [2018-02-04 18:50:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:04,666 INFO L432 AbstractCegarLoop]: Abstraction has 1106 states and 1115 transitions. [2018-02-04 18:50:04,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 18:50:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1115 transitions. [2018-02-04 18:50:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2018-02-04 18:50:04,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:04,675 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 18:50:04,675 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1612034285, now seen corresponding path program 31 times [2018-02-04 18:50:04,676 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:04,676 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:04,676 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:04,676 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:04,676 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:04,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:06,128 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 18:50:06,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:06,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:06,129 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:50:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:06,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:06,622 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 18:50:06,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:06,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 44 [2018-02-04 18:50:06,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 18:50:06,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 18:50:06,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 18:50:06,623 INFO L87 Difference]: Start difference. First operand 1106 states and 1115 transitions. Second operand 44 states. [2018-02-04 18:50:06,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:06,999 INFO L93 Difference]: Finished difference Result 1001 states and 1004 transitions. [2018-02-04 18:50:06,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 18:50:06,999 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 976 [2018-02-04 18:50:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:07,001 INFO L225 Difference]: With dead ends: 1001 [2018-02-04 18:50:07,001 INFO L226 Difference]: Without dead ends: 992 [2018-02-04 18:50:07,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=721, Invalid=2359, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 18:50:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-02-04 18:50:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-02-04 18:50:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-02-04 18:50:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 995 transitions. [2018-02-04 18:50:07,007 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 995 transitions. Word has length 976 [2018-02-04 18:50:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:07,007 INFO L432 AbstractCegarLoop]: Abstraction has 992 states and 995 transitions. [2018-02-04 18:50:07,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 18:50:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 995 transitions. [2018-02-04 18:50:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-02-04 18:50:07,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:07,013 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 18:50:07,013 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1908977205, now seen corresponding path program 32 times [2018-02-04 18:50:07,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:07,013 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:07,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:07,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:50:07,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:07,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:08,552 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 18:50:08,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:08,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:08,553 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:50:08,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:50:08,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:08,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:09,061 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 18:50:09,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:09,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 47 [2018-02-04 18:50:09,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 18:50:09,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 18:50:09,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 18:50:09,062 INFO L87 Difference]: Start difference. First operand 992 states and 995 transitions. Second operand 47 states. [2018-02-04 18:50:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:09,457 INFO L93 Difference]: Finished difference Result 1001 states and 1002 transitions. [2018-02-04 18:50:09,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 18:50:09,457 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 982 [2018-02-04 18:50:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:09,459 INFO L225 Difference]: With dead ends: 1001 [2018-02-04 18:50:09,459 INFO L226 Difference]: Without dead ends: 995 [2018-02-04 18:50:09,459 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 18:50:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2018-02-04 18:50:09,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 992. [2018-02-04 18:50:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-02-04 18:50:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 993 transitions. [2018-02-04 18:50:09,464 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 993 transitions. Word has length 982 [2018-02-04 18:50:09,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:09,464 INFO L432 AbstractCegarLoop]: Abstraction has 992 states and 993 transitions. [2018-02-04 18:50:09,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 18:50:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 993 transitions. [2018-02-04 18:50:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-02-04 18:50:09,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:09,469 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 18:50:09,469 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:09,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1435708227, now seen corresponding path program 33 times [2018-02-04 18:50:09,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:09,470 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:09,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:09,470 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:09,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:09,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:10,508 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 18:50:10,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:10,508 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:10,509 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:50:10,565 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 18:50:10,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:10,583 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:10,857 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 18:50:10,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:10,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-04 18:50:10,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:50:10,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:50:10,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:50:10,859 INFO L87 Difference]: Start difference. First operand 992 states and 993 transitions. Second operand 20 states. [2018-02-04 18:50:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:11,062 INFO L93 Difference]: Finished difference Result 1004 states and 1006 transitions. [2018-02-04 18:50:11,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 18:50:11,062 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 988 [2018-02-04 18:50:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:11,064 INFO L225 Difference]: With dead ends: 1004 [2018-02-04 18:50:11,064 INFO L226 Difference]: Without dead ends: 1004 [2018-02-04 18:50:11,064 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 18:50:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-02-04 18:50:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 998. [2018-02-04 18:50:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-02-04 18:50:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1000 transitions. [2018-02-04 18:50:11,069 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1000 transitions. Word has length 988 [2018-02-04 18:50:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:11,070 INFO L432 AbstractCegarLoop]: Abstraction has 998 states and 1000 transitions. [2018-02-04 18:50:11,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:50:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1000 transitions. [2018-02-04 18:50:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-02-04 18:50:11,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:11,075 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 18:50:11,075 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:11,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1833618299, now seen corresponding path program 34 times [2018-02-04 18:50:11,075 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:11,075 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:11,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:11,076 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:11,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:11,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:12,894 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 18:50:12,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:12,894 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:12,895 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:50:12,937 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:50:12,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:12,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:13,948 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 18:50:13,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:13,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 39] total 70 [2018-02-04 18:50:13,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 18:50:13,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 18:50:13,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=805, Invalid=4025, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 18:50:13,950 INFO L87 Difference]: Start difference. First operand 998 states and 1000 transitions. Second operand 70 states. [2018-02-04 18:50:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:15,296 INFO L93 Difference]: Finished difference Result 1117 states and 1120 transitions. [2018-02-04 18:50:15,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 18:50:15,296 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 994 [2018-02-04 18:50:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:15,298 INFO L225 Difference]: With dead ends: 1117 [2018-02-04 18:50:15,298 INFO L226 Difference]: Without dead ends: 1117 [2018-02-04 18:50:15,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2405, Invalid=11167, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 18:50:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2018-02-04 18:50:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1112. [2018-02-04 18:50:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-02-04 18:50:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1115 transitions. [2018-02-04 18:50:15,307 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1115 transitions. Word has length 994 [2018-02-04 18:50:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:15,307 INFO L432 AbstractCegarLoop]: Abstraction has 1112 states and 1115 transitions. [2018-02-04 18:50:15,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 18:50:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1115 transitions. [2018-02-04 18:50:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2018-02-04 18:50:15,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:15,316 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 18:50:15,316 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1521424346, now seen corresponding path program 35 times [2018-02-04 18:50:15,317 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:15,317 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:15,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:15,317 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:15,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:15,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:16,677 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 18:50:16,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:16,677 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:16,677 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:50:19,218 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-02-04 18:50:19,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:19,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:20,106 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 18:50:20,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:20,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 19 [2018-02-04 18:50:20,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:50:20,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:50:20,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:50:20,108 INFO L87 Difference]: Start difference. First operand 1112 states and 1115 transitions. Second operand 20 states. [2018-02-04 18:50:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:20,616 INFO L93 Difference]: Finished difference Result 1124 states and 1128 transitions. [2018-02-04 18:50:20,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 18:50:20,616 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1102 [2018-02-04 18:50:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:20,618 INFO L225 Difference]: With dead ends: 1124 [2018-02-04 18:50:20,618 INFO L226 Difference]: Without dead ends: 1124 [2018-02-04 18:50:20,619 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 18:50:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-02-04 18:50:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1118. [2018-02-04 18:50:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-02-04 18:50:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1122 transitions. [2018-02-04 18:50:20,624 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1122 transitions. Word has length 1102 [2018-02-04 18:50:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:20,625 INFO L432 AbstractCegarLoop]: Abstraction has 1118 states and 1122 transitions. [2018-02-04 18:50:20,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:50:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1122 transitions. [2018-02-04 18:50:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-02-04 18:50:20,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:20,631 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 18:50:20,631 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:20,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1687333586, now seen corresponding path program 36 times [2018-02-04 18:50:20,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:20,631 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:20,631 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:20,632 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:20,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:20,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:22,869 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 18:50:22,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:22,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:22,870 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:50:23,367 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-02-04 18:50:23,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:23,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:23,941 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 18:50:23,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:23,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 26] total 46 [2018-02-04 18:50:23,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 18:50:23,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 18:50:23,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1695, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 18:50:23,943 INFO L87 Difference]: Start difference. First operand 1118 states and 1122 transitions. Second operand 46 states. [2018-02-04 18:50:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:24,798 INFO L93 Difference]: Finished difference Result 1356 states and 1365 transitions. [2018-02-04 18:50:24,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 18:50:24,798 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1108 [2018-02-04 18:50:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:24,802 INFO L225 Difference]: With dead ends: 1356 [2018-02-04 18:50:24,802 INFO L226 Difference]: Without dead ends: 1356 [2018-02-04 18:50:24,803 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 18:50:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2018-02-04 18:50:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1352. [2018-02-04 18:50:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-02-04 18:50:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1361 transitions. [2018-02-04 18:50:24,811 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1361 transitions. Word has length 1108 [2018-02-04 18:50:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:24,811 INFO L432 AbstractCegarLoop]: Abstraction has 1352 states and 1361 transitions. [2018-02-04 18:50:24,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 18:50:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1361 transitions. [2018-02-04 18:50:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1211 [2018-02-04 18:50:24,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:24,819 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 18:50:24,819 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:24,819 INFO L82 PathProgramCache]: Analyzing trace with hash 482695993, now seen corresponding path program 37 times [2018-02-04 18:50:24,819 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:24,819 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:24,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:24,820 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:24,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:24,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:27,218 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 18:50:27,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:27,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:27,219 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:50:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:27,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:27,885 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 18:50:27,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:27,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 50 [2018-02-04 18:50:27,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 18:50:27,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 18:50:27,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 18:50:27,887 INFO L87 Difference]: Start difference. First operand 1352 states and 1361 transitions. Second operand 50 states. [2018-02-04 18:50:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:28,451 INFO L93 Difference]: Finished difference Result 1235 states and 1238 transitions. [2018-02-04 18:50:28,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 18:50:28,451 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1210 [2018-02-04 18:50:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:28,454 INFO L225 Difference]: With dead ends: 1235 [2018-02-04 18:50:28,454 INFO L226 Difference]: Without dead ends: 1226 [2018-02-04 18:50:28,454 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 18:50:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2018-02-04 18:50:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1226. [2018-02-04 18:50:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-02-04 18:50:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1229 transitions. [2018-02-04 18:50:28,461 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1229 transitions. Word has length 1210 [2018-02-04 18:50:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:28,462 INFO L432 AbstractCegarLoop]: Abstraction has 1226 states and 1229 transitions. [2018-02-04 18:50:28,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 18:50:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1229 transitions. [2018-02-04 18:50:28,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2018-02-04 18:50:28,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:28,470 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 18:50:28,470 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1655146865, now seen corresponding path program 38 times [2018-02-04 18:50:28,470 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:28,470 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:28,471 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:28,471 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:50:28,471 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:28,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:31,039 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 18:50:31,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:31,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:31,039 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:50:31,099 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:50:31,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:31,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:31,727 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 18:50:31,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:31,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 53 [2018-02-04 18:50:31,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 18:50:31,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 18:50:31,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 18:50:31,729 INFO L87 Difference]: Start difference. First operand 1226 states and 1229 transitions. Second operand 53 states. [2018-02-04 18:50:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:32,384 INFO L93 Difference]: Finished difference Result 1235 states and 1236 transitions. [2018-02-04 18:50:32,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 18:50:32,384 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1216 [2018-02-04 18:50:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:32,386 INFO L225 Difference]: With dead ends: 1235 [2018-02-04 18:50:32,386 INFO L226 Difference]: Without dead ends: 1229 [2018-02-04 18:50:32,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1054, Invalid=3502, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 18:50:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-02-04 18:50:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2018-02-04 18:50:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-02-04 18:50:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1227 transitions. [2018-02-04 18:50:32,393 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1227 transitions. Word has length 1216 [2018-02-04 18:50:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:32,393 INFO L432 AbstractCegarLoop]: Abstraction has 1226 states and 1227 transitions. [2018-02-04 18:50:32,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 18:50:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1227 transitions. [2018-02-04 18:50:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-02-04 18:50:32,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:32,400 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 18:50:32,400 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:32,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1276924311, now seen corresponding path program 39 times [2018-02-04 18:50:32,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:32,401 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:32,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:32,401 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:32,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:32,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:33,911 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 18:50:33,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:33,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:33,912 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:50:33,986 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-02-04 18:50:33,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:34,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:34,411 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 18:50:34,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:34,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-02-04 18:50:34,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 18:50:34,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 18:50:34,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2018-02-04 18:50:34,413 INFO L87 Difference]: Start difference. First operand 1226 states and 1227 transitions. Second operand 29 states. [2018-02-04 18:50:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:34,726 INFO L93 Difference]: Finished difference Result 1238 states and 1240 transitions. [2018-02-04 18:50:34,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:50:34,727 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1222 [2018-02-04 18:50:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:34,729 INFO L225 Difference]: With dead ends: 1238 [2018-02-04 18:50:34,729 INFO L226 Difference]: Without dead ends: 1238 [2018-02-04 18:50:34,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1257 GetRequests, 1214 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=581, Invalid=1399, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 18:50:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-02-04 18:50:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1232. [2018-02-04 18:50:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-02-04 18:50:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1234 transitions. [2018-02-04 18:50:34,736 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1234 transitions. Word has length 1222 [2018-02-04 18:50:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:34,736 INFO L432 AbstractCegarLoop]: Abstraction has 1232 states and 1234 transitions. [2018-02-04 18:50:34,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 18:50:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1234 transitions. [2018-02-04 18:50:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-02-04 18:50:34,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:34,744 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 18:50:34,744 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:34,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2048514593, now seen corresponding path program 40 times [2018-02-04 18:50:34,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:34,744 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:34,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:34,744 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:34,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:34,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:37,422 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 18:50:37,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:37,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:37,423 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:50:37,479 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:50:37,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:37,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:38,798 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 18:50:38,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:38,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 43] total 78 [2018-02-04 18:50:38,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 18:50:38,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 18:50:38,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=5012, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 18:50:38,800 INFO L87 Difference]: Start difference. First operand 1232 states and 1234 transitions. Second operand 78 states. [2018-02-04 18:50:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:40,462 INFO L93 Difference]: Finished difference Result 1363 states and 1366 transitions. [2018-02-04 18:50:40,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-02-04 18:50:40,463 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1228 [2018-02-04 18:50:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:40,465 INFO L225 Difference]: With dead ends: 1363 [2018-02-04 18:50:40,465 INFO L226 Difference]: Without dead ends: 1363 [2018-02-04 18:50:40,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1320 GetRequests, 1191 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2976, Invalid=14054, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 18:50:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-02-04 18:50:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1358. [2018-02-04 18:50:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-02-04 18:50:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1361 transitions. [2018-02-04 18:50:40,473 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1361 transitions. Word has length 1228 [2018-02-04 18:50:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:40,474 INFO L432 AbstractCegarLoop]: Abstraction has 1358 states and 1361 transitions. [2018-02-04 18:50:40,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 18:50:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1361 transitions. [2018-02-04 18:50:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2018-02-04 18:50:40,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:40,482 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 18:50:40,482 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:40,482 INFO L82 PathProgramCache]: Analyzing trace with hash 811391088, now seen corresponding path program 41 times [2018-02-04 18:50:40,482 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:40,482 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:40,483 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:40,483 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:40,483 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:40,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:42,350 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 18:50:42,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:42,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:42,351 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:50:47,148 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-02-04 18:50:47,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:47,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:48,062 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 18:50:48,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:48,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-02-04 18:50:48,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 18:50:48,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 18:50:48,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 18:50:48,064 INFO L87 Difference]: Start difference. First operand 1358 states and 1361 transitions. Second operand 41 states. [2018-02-04 18:50:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:48,451 INFO L93 Difference]: Finished difference Result 1370 states and 1374 transitions. [2018-02-04 18:50:48,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 18:50:48,451 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1348 [2018-02-04 18:50:48,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:48,454 INFO L225 Difference]: With dead ends: 1370 [2018-02-04 18:50:48,454 INFO L226 Difference]: Without dead ends: 1370 [2018-02-04 18:50:48,454 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 18:50:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-02-04 18:50:48,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1364. [2018-02-04 18:50:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2018-02-04 18:50:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1368 transitions. [2018-02-04 18:50:48,461 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1368 transitions. Word has length 1348 [2018-02-04 18:50:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:48,462 INFO L432 AbstractCegarLoop]: Abstraction has 1364 states and 1368 transitions. [2018-02-04 18:50:48,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 18:50:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1368 transitions. [2018-02-04 18:50:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2018-02-04 18:50:48,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:48,470 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 18:50:48,471 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash 802628328, now seen corresponding path program 42 times [2018-02-04 18:50:48,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:48,471 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:48,471 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:48,472 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:48,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:48,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:51,698 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 18:50:51,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:51,698 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:51,699 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:50:53,287 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-02-04 18:50:53,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:53,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:53,997 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 18:50:53,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:53,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 28] total 51 [2018-02-04 18:50:53,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 18:50:53,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 18:50:53,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=2091, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 18:50:53,999 INFO L87 Difference]: Start difference. First operand 1364 states and 1368 transitions. Second operand 51 states. [2018-02-04 18:50:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:55,003 INFO L93 Difference]: Finished difference Result 1626 states and 1635 transitions. [2018-02-04 18:50:55,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 18:50:55,003 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1354 [2018-02-04 18:50:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:55,006 INFO L225 Difference]: With dead ends: 1626 [2018-02-04 18:50:55,006 INFO L226 Difference]: Without dead ends: 1626 [2018-02-04 18:50:55,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1436 GetRequests, 1346 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1784, Invalid=6588, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 18:50:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2018-02-04 18:50:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1622. [2018-02-04 18:50:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-02-04 18:50:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1631 transitions. [2018-02-04 18:50:55,016 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1631 transitions. Word has length 1354 [2018-02-04 18:50:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:55,016 INFO L432 AbstractCegarLoop]: Abstraction has 1622 states and 1631 transitions. [2018-02-04 18:50:55,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 18:50:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1631 transitions. [2018-02-04 18:50:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1469 [2018-02-04 18:50:55,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:55,027 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 18:50:55,027 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2005170369, now seen corresponding path program 43 times [2018-02-04 18:50:55,028 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:55,028 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:55,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:55,028 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:55,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:55,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:58,638 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 18:50:58,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:58,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:58,639 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:50:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:58,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:59,498 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 18:50:59,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:59,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 56 [2018-02-04 18:50:59,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 18:50:59,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 18:50:59,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2341, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 18:50:59,500 INFO L87 Difference]: Start difference. First operand 1622 states and 1631 transitions. Second operand 56 states. [2018-02-04 18:51:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:00,033 INFO L93 Difference]: Finished difference Result 1493 states and 1496 transitions. [2018-02-04 18:51:00,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 18:51:00,033 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1468 [2018-02-04 18:51:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:00,036 INFO L225 Difference]: With dead ends: 1493 [2018-02-04 18:51:00,036 INFO L226 Difference]: Without dead ends: 1484 [2018-02-04 18:51:00,036 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 18:51:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-02-04 18:51:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1484. [2018-02-04 18:51:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-02-04 18:51:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1487 transitions. [2018-02-04 18:51:00,042 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1487 transitions. Word has length 1468 [2018-02-04 18:51:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:00,043 INFO L432 AbstractCegarLoop]: Abstraction has 1484 states and 1487 transitions. [2018-02-04 18:51:00,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 18:51:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1487 transitions. [2018-02-04 18:51:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1475 [2018-02-04 18:51:00,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:00,052 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 18:51:00,052 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash -773621513, now seen corresponding path program 44 times [2018-02-04 18:51:00,053 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:00,053 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:00,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:00,053 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:51:00,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:00,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:03,979 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 18:51:03,980 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:03,980 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:03,980 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:51:04,061 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:51:04,061 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:51:04,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:05,212 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 18:51:05,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:05,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 74 [2018-02-04 18:51:05,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 18:51:05,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 18:51:05,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=4683, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 18:51:05,213 INFO L87 Difference]: Start difference. First operand 1484 states and 1487 transitions. Second operand 74 states. [2018-02-04 18:51:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:07,131 INFO L93 Difference]: Finished difference Result 1628 states and 1630 transitions. [2018-02-04 18:51:07,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-02-04 18:51:07,131 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1474 [2018-02-04 18:51:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:07,134 INFO L225 Difference]: With dead ends: 1628 [2018-02-04 18:51:07,134 INFO L226 Difference]: Without dead ends: 1619 [2018-02-04 18:51:07,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1607 GetRequests, 1460 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6154 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2749, Invalid=19303, Unknown=0, NotChecked=0, Total=22052 [2018-02-04 18:51:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-02-04 18:51:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1610. [2018-02-04 18:51:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2018-02-04 18:51:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1612 transitions. [2018-02-04 18:51:07,144 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1612 transitions. Word has length 1474 [2018-02-04 18:51:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:07,144 INFO L432 AbstractCegarLoop]: Abstraction has 1610 states and 1612 transitions. [2018-02-04 18:51:07,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 18:51:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1612 transitions. [2018-02-04 18:51:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1607 [2018-02-04 18:51:07,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:07,155 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 18:51:07,155 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash -736205386, now seen corresponding path program 45 times [2018-02-04 18:51:07,156 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:07,156 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:07,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:07,156 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:51:07,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:07,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:11,852 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 18:51:11,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:11,852 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:11,853 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:51:11,954 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-02-04 18:51:11,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:51:11,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:12,930 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 18:51:12,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:12,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 22] total 63 [2018-02-04 18:51:12,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 18:51:12,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 18:51:12,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=3315, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 18:51:12,932 INFO L87 Difference]: Start difference. First operand 1610 states and 1612 transitions. Second operand 63 states. [2018-02-04 18:51:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:14,599 INFO L93 Difference]: Finished difference Result 1635 states and 1637 transitions. [2018-02-04 18:51:14,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 18:51:14,599 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1606 [2018-02-04 18:51:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:14,601 INFO L225 Difference]: With dead ends: 1635 [2018-02-04 18:51:14,601 INFO L226 Difference]: Without dead ends: 1629 [2018-02-04 18:51:14,602 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1684 GetRequests, 1586 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2685 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1696, Invalid=8204, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 18:51:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2018-02-04 18:51:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1622. [2018-02-04 18:51:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-02-04 18:51:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1624 transitions. [2018-02-04 18:51:14,611 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1624 transitions. Word has length 1606 [2018-02-04 18:51:14,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:14,611 INFO L432 AbstractCegarLoop]: Abstraction has 1622 states and 1624 transitions. [2018-02-04 18:51:14,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 18:51:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1624 transitions. [2018-02-04 18:51:14,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1619 [2018-02-04 18:51:14,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:14,622 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 18:51:14,622 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:14,623 INFO L82 PathProgramCache]: Analyzing trace with hash -758475034, now seen corresponding path program 46 times [2018-02-04 18:51:14,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:14,623 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:14,623 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:14,623 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:51:14,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:14,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:17,539 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 18:51:17,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:17,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:17,540 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:51:17,719 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:51:17,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:51:17,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:18,536 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 18:51:18,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:18,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-02-04 18:51:18,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 18:51:18,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 18:51:18,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=1449, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 18:51:18,537 INFO L87 Difference]: Start difference. First operand 1622 states and 1624 transitions. Second operand 44 states. [2018-02-04 18:51:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:19,100 INFO L93 Difference]: Finished difference Result 1647 states and 1651 transitions. [2018-02-04 18:51:19,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:51:19,101 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1618 [2018-02-04 18:51:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:19,103 INFO L225 Difference]: With dead ends: 1647 [2018-02-04 18:51:19,103 INFO L226 Difference]: Without dead ends: 1647 [2018-02-04 18:51:19,104 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 18:51:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2018-02-04 18:51:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1628. [2018-02-04 18:51:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-02-04 18:51:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1631 transitions. [2018-02-04 18:51:19,111 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1631 transitions. Word has length 1618 [2018-02-04 18:51:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:19,112 INFO L432 AbstractCegarLoop]: Abstraction has 1628 states and 1631 transitions. [2018-02-04 18:51:19,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 18:51:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1631 transitions. [2018-02-04 18:51:19,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-02-04 18:51:19,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:19,124 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 18:51:19,124 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:19,124 INFO L82 PathProgramCache]: Analyzing trace with hash -828526370, now seen corresponding path program 47 times [2018-02-04 18:51:19,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:19,124 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:19,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:19,125 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:51:19,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:19,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:24,133 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 18:51:24,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:24,133 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:24,134 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:51:30,456 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-02-04 18:51:30,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:51:30,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:31,987 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 18:51:31,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:31,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 50] total 74 [2018-02-04 18:51:31,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 18:51:31,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 18:51:31,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=4319, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 18:51:31,989 INFO L87 Difference]: Start difference. First operand 1628 states and 1631 transitions. Second operand 74 states. [2018-02-04 18:51:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:33,413 INFO L93 Difference]: Finished difference Result 1780 states and 1784 transitions. [2018-02-04 18:51:33,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 18:51:33,413 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1624 [2018-02-04 18:51:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:33,416 INFO L225 Difference]: With dead ends: 1780 [2018-02-04 18:51:33,416 INFO L226 Difference]: Without dead ends: 1780 [2018-02-04 18:51:33,417 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 18:51:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2018-02-04 18:51:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1772. [2018-02-04 18:51:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-02-04 18:51:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 1776 transitions. [2018-02-04 18:51:33,424 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 1776 transitions. Word has length 1624 [2018-02-04 18:51:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:33,424 INFO L432 AbstractCegarLoop]: Abstraction has 1772 states and 1776 transitions. [2018-02-04 18:51:33,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 18:51:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 1776 transitions. [2018-02-04 18:51:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1757 [2018-02-04 18:51:33,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:33,437 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 18:51:33,437 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:33,438 INFO L82 PathProgramCache]: Analyzing trace with hash -500562851, now seen corresponding path program 48 times [2018-02-04 18:51:33,438 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:33,438 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:33,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:33,438 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:51:33,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:33,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:39,785 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 18:51:39,786 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:39,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:39,786 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:51:40,258 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 18:51:40,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:51:40,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:41,444 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 18:51:41,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:41,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 24] total 73 [2018-02-04 18:51:41,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 18:51:41,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 18:51:41,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=4437, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 18:51:41,446 INFO L87 Difference]: Start difference. First operand 1772 states and 1776 transitions. Second operand 73 states. [2018-02-04 18:51:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:43,278 INFO L93 Difference]: Finished difference Result 2071 states and 2080 transitions. [2018-02-04 18:51:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 18:51:43,278 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1756 [2018-02-04 18:51:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:43,282 INFO L225 Difference]: With dead ends: 2071 [2018-02-04 18:51:43,282 INFO L226 Difference]: Without dead ends: 2071 [2018-02-04 18:51:43,283 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 18:51:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2018-02-04 18:51:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1922. [2018-02-04 18:51:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-02-04 18:51:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 1929 transitions. [2018-02-04 18:51:43,294 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 1929 transitions. Word has length 1756 [2018-02-04 18:51:43,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:43,294 INFO L432 AbstractCegarLoop]: Abstraction has 1922 states and 1929 transitions. [2018-02-04 18:51:43,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 18:51:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 1929 transitions. [2018-02-04 18:51:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1769 [2018-02-04 18:51:43,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:43,308 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 18:51:43,308 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash 527799053, now seen corresponding path program 49 times [2018-02-04 18:51:43,308 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:43,309 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:43,309 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:43,309 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:51:43,309 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:43,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:49,165 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 18:51:49,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:49,165 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:49,166 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:51:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:49,267 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:50,631 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 18:51:50,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:50,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 72 [2018-02-04 18:51:50,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 18:51:50,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 18:51:50,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1177, Invalid=3935, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 18:51:50,632 INFO L87 Difference]: Start difference. First operand 1922 states and 1929 transitions. Second operand 72 states. [2018-02-04 18:51:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:51,835 INFO L93 Difference]: Finished difference Result 2217 states and 2228 transitions. [2018-02-04 18:51:51,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 18:51:51,835 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 1768 [2018-02-04 18:51:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:51,838 INFO L225 Difference]: With dead ends: 2217 [2018-02-04 18:51:51,839 INFO L226 Difference]: Without dead ends: 2217 [2018-02-04 18:51:51,839 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 18:51:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-02-04 18:51:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2207. [2018-02-04 18:51:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2018-02-04 18:51:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 2218 transitions. [2018-02-04 18:51:51,849 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 2218 transitions. Word has length 1768 [2018-02-04 18:51:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:51,850 INFO L432 AbstractCegarLoop]: Abstraction has 2207 states and 2218 transitions. [2018-02-04 18:51:51,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 18:51:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2218 transitions. [2018-02-04 18:51:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1901 [2018-02-04 18:51:51,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:51,865 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 18:51:51,865 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1101666444, now seen corresponding path program 50 times [2018-02-04 18:51:51,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:51,866 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:51,866 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:51,866 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:51:51,866 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:51,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:58,757 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 18:51:58,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:58,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:58,758 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:51:58,868 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:51:58,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:51:58,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:00,154 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 18:52:00,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:00,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 68 [2018-02-04 18:52:00,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 18:52:00,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 18:52:00,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=3477, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 18:52:00,155 INFO L87 Difference]: Start difference. First operand 2207 states and 2218 transitions. Second operand 68 states. [2018-02-04 18:52:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:01,021 INFO L93 Difference]: Finished difference Result 2081 states and 2084 transitions. [2018-02-04 18:52:01,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 18:52:01,021 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 1900 [2018-02-04 18:52:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:01,024 INFO L225 Difference]: With dead ends: 2081 [2018-02-04 18:52:01,024 INFO L226 Difference]: Without dead ends: 1928 [2018-02-04 18:52:01,025 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 18:52:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-02-04 18:52:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1922. [2018-02-04 18:52:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-02-04 18:52:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 1924 transitions. [2018-02-04 18:52:01,039 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 1924 transitions. Word has length 1900 [2018-02-04 18:52:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:01,039 INFO L432 AbstractCegarLoop]: Abstraction has 1922 states and 1924 transitions. [2018-02-04 18:52:01,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 18:52:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 1924 transitions. [2018-02-04 18:52:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1913 [2018-02-04 18:52:01,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:01,061 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 18:52:01,061 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:01,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1723381956, now seen corresponding path program 51 times [2018-02-04 18:52:01,061 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:01,061 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:01,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:01,061 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:01,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:01,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:05,351 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 18:52:05,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:05,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:05,352 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:52:05,649 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-02-04 18:52:05,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:05,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:06,524 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 18:52:06,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:06,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 29 [2018-02-04 18:52:06,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 18:52:06,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 18:52:06,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=550, Unknown=0, NotChecked=0, Total=870 [2018-02-04 18:52:06,526 INFO L87 Difference]: Start difference. First operand 1922 states and 1924 transitions. Second operand 30 states. [2018-02-04 18:52:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:06,859 INFO L93 Difference]: Finished difference Result 1937 states and 1940 transitions. [2018-02-04 18:52:06,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:52:06,860 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1912 [2018-02-04 18:52:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:06,862 INFO L225 Difference]: With dead ends: 1937 [2018-02-04 18:52:06,862 INFO L226 Difference]: Without dead ends: 1937 [2018-02-04 18:52:06,862 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 18:52:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-02-04 18:52:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1928. [2018-02-04 18:52:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-02-04 18:52:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 1931 transitions. [2018-02-04 18:52:06,871 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 1931 transitions. Word has length 1912 [2018-02-04 18:52:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:06,871 INFO L432 AbstractCegarLoop]: Abstraction has 1928 states and 1931 transitions. [2018-02-04 18:52:06,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 18:52:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 1931 transitions. [2018-02-04 18:52:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2018-02-04 18:52:06,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:06,888 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 18:52:06,889 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:06,889 INFO L82 PathProgramCache]: Analyzing trace with hash -701609804, now seen corresponding path program 52 times [2018-02-04 18:52:06,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:06,889 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:06,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:06,889 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:06,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:06,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:14,127 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 18:52:14,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:14,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:14,128 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:52:14,229 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:52:14,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:14,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 241092 backedges. 66944 proven. 4558 refuted. 0 times theorem prover too weak. 169590 trivial. 0 not checked. [2018-02-04 18:52:16,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:16,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 53] total 98 [2018-02-04 18:52:16,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-02-04 18:52:16,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-02-04 18:52:16,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1554, Invalid=7952, Unknown=0, NotChecked=0, Total=9506 [2018-02-04 18:52:16,616 INFO L87 Difference]: Start difference. First operand 1928 states and 1931 transitions. Second operand 98 states. [2018-02-04 18:52:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:18,941 INFO L93 Difference]: Finished difference Result 2092 states and 2096 transitions. [2018-02-04 18:52:18,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-02-04 18:52:18,942 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 1918 [2018-02-04 18:52:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:18,944 INFO L225 Difference]: With dead ends: 2092 [2018-02-04 18:52:18,945 INFO L226 Difference]: Without dead ends: 2092 [2018-02-04 18:52:18,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2035 GetRequests, 1871 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6457 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4666, Invalid=22724, Unknown=0, NotChecked=0, Total=27390 [2018-02-04 18:52:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2018-02-04 18:52:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 2084. [2018-02-04 18:52:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2018-02-04 18:52:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2088 transitions. [2018-02-04 18:52:18,956 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2088 transitions. Word has length 1918 [2018-02-04 18:52:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:18,957 INFO L432 AbstractCegarLoop]: Abstraction has 2084 states and 2088 transitions. [2018-02-04 18:52:18,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-02-04 18:52:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2088 transitions. [2018-02-04 18:52:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2069 [2018-02-04 18:52:18,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:18,974 INFO L351 BasicCegarLoop]: trace histogram [321, 299, 298, 298, 298, 298, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:18,974 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash -7420133, now seen corresponding path program 53 times [2018-02-04 18:52:18,975 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:18,975 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:18,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:18,975 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:18,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:19,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 18:52:22,458 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 18:52:22,461 INFO L168 Benchmark]: Toolchain (without parser) took 175328.94 ms. Allocated memory was 406.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 361.6 MB in the beginning and 215.1 MB in the end (delta: 146.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 5.3 GB. [2018-02-04 18:52:22,462 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 406.3 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:52:22,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.13 ms. Allocated memory is still 406.3 MB. Free memory was 361.6 MB in the beginning and 353.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:22,462 INFO L168 Benchmark]: Boogie Preprocessor took 20.24 ms. Allocated memory is still 406.3 MB. Free memory was 353.6 MB in the beginning and 350.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:22,462 INFO L168 Benchmark]: RCFGBuilder took 146.83 ms. Allocated memory is still 406.3 MB. Free memory was 350.9 MB in the beginning and 334.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:22,462 INFO L168 Benchmark]: TraceAbstraction took 175023.80 ms. Allocated memory was 406.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 333.6 MB in the beginning and 215.1 MB in the end (delta: 118.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. [2018-02-04 18:52:22,463 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 406.3 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 135.13 ms. Allocated memory is still 406.3 MB. Free memory was 361.6 MB in the beginning and 353.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.24 ms. Allocated memory is still 406.3 MB. Free memory was 353.6 MB in the beginning and 350.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 146.83 ms. Allocated memory is still 406.3 MB. Free memory was 350.9 MB in the beginning and 334.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 175023.80 ms. Allocated memory was 406.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 333.6 MB in the beginning and 215.1 MB in the end (delta: 118.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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_18-52-22-468.csv Completed graceful shutdown