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/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:42:40,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:42:40,419 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:42:40,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:42:40,430 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:42:40,430 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:42:40,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:42:40,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:42:40,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:42:40,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:42:40,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:42:40,435 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:42:40,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:42:40,437 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:42:40,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:42:40,439 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:42:40,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:42:40,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:42:40,443 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:42:40,444 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:42:40,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:42:40,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:42:40,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:42:40,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:42:40,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:42:40,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:42:40,449 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:42:40,449 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:42:40,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:42:40,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:42:40,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:42:40,450 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 17:42:40,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:42:40,460 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:42:40,461 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:42:40,461 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:42:40,461 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:42:40,462 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:42:40,462 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:42:40,462 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:42:40,462 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:42:40,462 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:42:40,462 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:42:40,463 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:42:40,463 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:42:40,463 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:42:40,463 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:42:40,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:42:40,463 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:42:40,464 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:42:40,464 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:42:40,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:42:40,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:42:40,464 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:42:40,464 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:42:40,464 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:42:40,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:42:40,503 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:42:40,505 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:42:40,506 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:42:40,506 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:42:40,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-02-04 17:42:40,599 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:42:40,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:42:40,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:42:40,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:42:40,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:42:40,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:42:40" (1/1) ... [2018-02-04 17:42:40,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65bd712e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40, skipping insertion in model container [2018-02-04 17:42:40,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:42:40" (1/1) ... [2018-02-04 17:42:40,618 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:42:40,628 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:42:40,713 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:42:40,722 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:42:40,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40 WrapperNode [2018-02-04 17:42:40,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:42:40,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:42:40,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:42:40,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:42:40,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40" (1/1) ... [2018-02-04 17:42:40,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40" (1/1) ... [2018-02-04 17:42:40,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40" (1/1) ... [2018-02-04 17:42:40,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40" (1/1) ... [2018-02-04 17:42:40,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40" (1/1) ... [2018-02-04 17:42:40,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40" (1/1) ... [2018-02-04 17:42:40,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40" (1/1) ... [2018-02-04 17:42:40,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:42:40,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:42:40,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:42:40,745 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:42:40,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40" (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 17:42:40,779 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:42:40,779 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:42:40,780 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 17:42:40,780 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:42:40,780 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 17:42:40,780 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 17:42:40,780 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:42:40,780 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:42:40,780 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:42:40,868 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:42:40,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:42:40 BoogieIcfgContainer [2018-02-04 17:42:40,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:42:40,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:42:40,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:42:40,871 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:42:40,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:42:40" (1/3) ... [2018-02-04 17:42:40,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bf9adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:42:40, skipping insertion in model container [2018-02-04 17:42:40,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:42:40" (2/3) ... [2018-02-04 17:42:40,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bf9adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:42:40, skipping insertion in model container [2018-02-04 17:42:40,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:42:40" (3/3) ... [2018-02-04 17:42:40,873 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-02-04 17:42:40,878 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:42:40,883 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 17:42:40,905 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:42:40,905 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:42:40,905 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:42:40,905 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:42:40,905 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:42:40,905 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:42:40,905 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:42:40,905 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:42:40,906 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:42:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-04 17:42:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 17:42:40,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:40,926 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:40,926 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1734695582, now seen corresponding path program 1 times [2018-02-04 17:42:40,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:40,932 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:40,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:40,965 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:40,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:40,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:41,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:42:41,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:42:41,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:42:41,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:42:41,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:42:41,064 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-02-04 17:42:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:41,127 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 17:42:41,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:42:41,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 17:42:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:41,133 INFO L225 Difference]: With dead ends: 50 [2018-02-04 17:42:41,133 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 17:42:41,134 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 17:42:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 17:42:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-02-04 17:42:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:42:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-02-04 17:42:41,201 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 7 [2018-02-04 17:42:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:41,202 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-02-04 17:42:41,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:42:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-02-04 17:42:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 17:42:41,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:41,202 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:41,202 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:41,203 INFO L82 PathProgramCache]: Analyzing trace with hash 337601429, now seen corresponding path program 1 times [2018-02-04 17:42:41,203 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:41,203 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:41,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:41,204 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:41,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:41,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:41,241 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 17:42:41,242 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:41,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:41,242 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:41,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:41,266 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 17:42:41,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:41,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-04 17:42:41,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:42:41,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:42:41,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:42:41,268 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 4 states. [2018-02-04 17:42:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:41,320 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 17:42:41,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:42:41,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 17:42:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:41,321 INFO L225 Difference]: With dead ends: 54 [2018-02-04 17:42:41,322 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 17:42:41,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:42:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 17:42:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-02-04 17:42:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:42:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 17:42:41,326 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2018-02-04 17:42:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:41,326 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 17:42:41,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:42:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 17:42:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:42:41,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:41,326 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:41,326 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1746445058, now seen corresponding path program 2 times [2018-02-04 17:42:41,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:41,327 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:41,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:41,327 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:41,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:41,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:41,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:41,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:41,402 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:42:41,411 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:42:41,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:41,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:41,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:41,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-04 17:42:41,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:42:41,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:42:41,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:42:41,441 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-02-04 17:42:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:41,562 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 17:42:41,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:42:41,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 17:42:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:41,564 INFO L225 Difference]: With dead ends: 67 [2018-02-04 17:42:41,564 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 17:42:41,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:42:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 17:42:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-04 17:42:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 17:42:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 17:42:41,571 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 17 [2018-02-04 17:42:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:41,571 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 17:42:41,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:42:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 17:42:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:42:41,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:41,572 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:41,572 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash -228598475, now seen corresponding path program 3 times [2018-02-04 17:42:41,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:41,573 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:41,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:41,574 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:41,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:41,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:41,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:41,629 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:41,630 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:42:41,638 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:42:41,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:41,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:41,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:41,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 17:42:41,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:42:41,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:42:41,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:42:41,650 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 7 states. [2018-02-04 17:42:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:41,794 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-02-04 17:42:41,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:42:41,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 17:42:41,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:41,795 INFO L225 Difference]: With dead ends: 80 [2018-02-04 17:42:41,796 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 17:42:41,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:42:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 17:42:41,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-02-04 17:42:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 17:42:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-02-04 17:42:41,802 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 22 [2018-02-04 17:42:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:41,802 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-02-04 17:42:41,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:42:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-02-04 17:42:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:42:41,803 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:41,803 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:41,803 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:41,803 INFO L82 PathProgramCache]: Analyzing trace with hash 756148062, now seen corresponding path program 4 times [2018-02-04 17:42:41,803 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:41,804 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:41,804 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:41,805 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:41,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:41,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:41,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:41,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:41,876 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:42:41,886 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:42:41,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:41,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:41,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:41,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 17:42:41,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:42:41,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:42:41,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:42:41,902 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 7 states. [2018-02-04 17:42:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:42,092 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-02-04 17:42:42,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:42:42,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 17:42:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:42,095 INFO L225 Difference]: With dead ends: 93 [2018-02-04 17:42:42,095 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 17:42:42,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:42:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 17:42:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-02-04 17:42:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 17:42:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-04 17:42:42,104 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 27 [2018-02-04 17:42:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:42,104 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-04 17:42:42,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:42:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-04 17:42:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:42:42,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:42,105 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:42,106 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:42,106 INFO L82 PathProgramCache]: Analyzing trace with hash 671928021, now seen corresponding path program 5 times [2018-02-04 17:42:42,106 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:42,106 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:42,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:42,108 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:42,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:42,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:42,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:42,172 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:42,173 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:42:42,185 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 17:42:42,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:42,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:42,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:42,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-02-04 17:42:42,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:42:42,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:42:42,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:42:42,245 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 14 states. [2018-02-04 17:42:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:42,439 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-02-04 17:42:42,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:42:42,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-02-04 17:42:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:42,440 INFO L225 Difference]: With dead ends: 106 [2018-02-04 17:42:42,440 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 17:42:42,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:42:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 17:42:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-02-04 17:42:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 17:42:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-02-04 17:42:42,446 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 32 [2018-02-04 17:42:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:42,446 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-02-04 17:42:42,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:42:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-02-04 17:42:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 17:42:42,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:42,447 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:42,448 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:42,448 INFO L82 PathProgramCache]: Analyzing trace with hash -203753026, now seen corresponding path program 6 times [2018-02-04 17:42:42,448 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:42,448 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:42,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:42,449 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:42,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:42,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:42,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:42,523 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:42,524 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:42:42,534 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 17:42:42,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:42,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:42,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:42,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-02-04 17:42:42,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:42:42,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:42:42,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:42:42,574 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 13 states. [2018-02-04 17:42:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:42,730 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-02-04 17:42:42,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:42:42,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 17:42:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:42,731 INFO L225 Difference]: With dead ends: 119 [2018-02-04 17:42:42,731 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 17:42:42,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:42:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 17:42:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-02-04 17:42:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 17:42:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-02-04 17:42:42,736 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 37 [2018-02-04 17:42:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:42,737 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-02-04 17:42:42,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:42:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-02-04 17:42:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 17:42:42,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:42,737 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:42,737 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:42,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1846527883, now seen corresponding path program 7 times [2018-02-04 17:42:42,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:42,738 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:42,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:42,739 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:42,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:42,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:42,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:42,814 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:42,814 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:42,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:42,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:42,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 17:42:42,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:42:42,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:42:42,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:42:42,835 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 11 states. [2018-02-04 17:42:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:42,987 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-02-04 17:42:42,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:42:42,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-04 17:42:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:42,988 INFO L225 Difference]: With dead ends: 132 [2018-02-04 17:42:42,988 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 17:42:42,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:42:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 17:42:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-02-04 17:42:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 17:42:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-02-04 17:42:42,991 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 42 [2018-02-04 17:42:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:42,992 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-02-04 17:42:42,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:42:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-02-04 17:42:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 17:42:42,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:42,992 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:42,992 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:42,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2109248542, now seen corresponding path program 8 times [2018-02-04 17:42:42,993 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:42,993 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:42,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:42,993 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:42,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:42,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:43,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:43,095 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:43,095 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:42:43,105 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:42:43,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:43,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:43,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:43,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 17:42:43,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:42:43,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:42:43,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:42:43,115 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 11 states. [2018-02-04 17:42:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:43,534 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2018-02-04 17:42:43,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:42:43,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 17:42:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:43,535 INFO L225 Difference]: With dead ends: 145 [2018-02-04 17:42:43,535 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 17:42:43,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:42:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 17:42:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2018-02-04 17:42:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 17:42:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-02-04 17:42:43,549 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 47 [2018-02-04 17:42:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:43,550 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-02-04 17:42:43,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:42:43,550 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-02-04 17:42:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 17:42:43,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:43,551 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:43,556 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash 408164885, now seen corresponding path program 9 times [2018-02-04 17:42:43,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:43,557 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:43,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:43,558 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:43,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:43,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:43,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:43,666 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:43,667 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:42:43,677 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 17:42:43,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:43,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:43,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:43,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 17:42:43,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:42:43,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:42:43,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:42:43,754 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 23 states. [2018-02-04 17:42:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:44,217 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-02-04 17:42:44,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:42:44,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-04 17:42:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:44,218 INFO L225 Difference]: With dead ends: 158 [2018-02-04 17:42:44,218 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 17:42:44,218 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:42:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 17:42:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2018-02-04 17:42:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 17:42:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2018-02-04 17:42:44,224 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 52 [2018-02-04 17:42:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:44,224 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2018-02-04 17:42:44,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:42:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2018-02-04 17:42:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 17:42:44,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:44,226 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:44,226 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2136951170, now seen corresponding path program 10 times [2018-02-04 17:42:44,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:44,226 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:44,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:44,227 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:44,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:44,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:44,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:44,333 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:44,333 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:42:44,342 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:42:44,342 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:44,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:44,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:44,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-02-04 17:42:44,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:42:44,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:42:44,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:42:44,356 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand 14 states. [2018-02-04 17:42:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:44,608 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-02-04 17:42:44,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:42:44,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-02-04 17:42:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:44,609 INFO L225 Difference]: With dead ends: 171 [2018-02-04 17:42:44,609 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 17:42:44,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:42:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 17:42:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-02-04 17:42:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 17:42:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-02-04 17:42:44,614 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 57 [2018-02-04 17:42:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:44,615 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-02-04 17:42:44,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:42:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-02-04 17:42:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 17:42:44,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:44,616 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:44,617 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1325560757, now seen corresponding path program 11 times [2018-02-04 17:42:44,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:44,617 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:44,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:44,618 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:44,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:44,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:44,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:44,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:44,715 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:42:44,726 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 17:42:44,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:44,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:44,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:44,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-02-04 17:42:44,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:42:44,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:42:44,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:42:44,848 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 26 states. [2018-02-04 17:42:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:45,465 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-02-04 17:42:45,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:42:45,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-02-04 17:42:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:45,466 INFO L225 Difference]: With dead ends: 184 [2018-02-04 17:42:45,466 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 17:42:45,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:42:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 17:42:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-02-04 17:42:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 17:42:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2018-02-04 17:42:45,469 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 62 [2018-02-04 17:42:45,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:45,469 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2018-02-04 17:42:45,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:42:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2018-02-04 17:42:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 17:42:45,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:45,470 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:45,470 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:45,470 INFO L82 PathProgramCache]: Analyzing trace with hash 923361502, now seen corresponding path program 12 times [2018-02-04 17:42:45,470 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:45,470 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:45,471 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:45,471 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:45,471 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:45,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:45,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:45,562 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:45,562 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:42:45,572 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 17:42:45,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:45,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:45,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:45,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-02-04 17:42:45,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:42:45,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:42:45,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:42:45,660 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand 29 states. [2018-02-04 17:42:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:46,001 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-02-04 17:42:46,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:42:46,002 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-02-04 17:42:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:46,002 INFO L225 Difference]: With dead ends: 197 [2018-02-04 17:42:46,002 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 17:42:46,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:42:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 17:42:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-02-04 17:42:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 17:42:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-02-04 17:42:46,006 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 67 [2018-02-04 17:42:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:46,006 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-02-04 17:42:46,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:42:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-02-04 17:42:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 17:42:46,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:46,007 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:46,007 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash 356861269, now seen corresponding path program 13 times [2018-02-04 17:42:46,007 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:46,007 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:46,008 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:46,008 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:46,008 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:46,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:46,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:46,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:46,129 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:46,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:46,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:46,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-02-04 17:42:46,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:42:46,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:42:46,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:42:46,143 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 17 states. [2018-02-04 17:42:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:46,410 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2018-02-04 17:42:46,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:42:46,411 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-04 17:42:46,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:46,411 INFO L225 Difference]: With dead ends: 210 [2018-02-04 17:42:46,411 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 17:42:46,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:42:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 17:42:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2018-02-04 17:42:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 17:42:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2018-02-04 17:42:46,415 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 72 [2018-02-04 17:42:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:46,415 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2018-02-04 17:42:46,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:42:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-02-04 17:42:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 17:42:46,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:46,415 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:46,415 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:46,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1075276994, now seen corresponding path program 14 times [2018-02-04 17:42:46,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:46,416 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:46,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:46,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:46,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:46,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:46,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:46,517 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:46,517 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:42:46,523 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:42:46,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:46,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:46,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:46,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-02-04 17:42:46,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:42:46,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:42:46,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:42:46,540 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand 18 states. [2018-02-04 17:42:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:46,833 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-02-04 17:42:46,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:42:46,833 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-04 17:42:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:46,833 INFO L225 Difference]: With dead ends: 223 [2018-02-04 17:42:46,834 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 17:42:46,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:42:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 17:42:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2018-02-04 17:42:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 17:42:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-02-04 17:42:46,838 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 77 [2018-02-04 17:42:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:46,838 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-02-04 17:42:46,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:42:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-02-04 17:42:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 17:42:46,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:46,839 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:46,839 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:46,839 INFO L82 PathProgramCache]: Analyzing trace with hash 904302325, now seen corresponding path program 15 times [2018-02-04 17:42:46,839 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:46,839 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:46,840 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:46,840 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:46,840 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:46,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:46,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:46,938 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:46,939 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:42:46,946 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 17:42:46,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:46,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:47,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:47,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-02-04 17:42:47,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:42:47,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:42:47,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:42:47,038 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 35 states. [2018-02-04 17:42:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:47,910 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-02-04 17:42:47,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:42:47,910 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-02-04 17:42:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:47,911 INFO L225 Difference]: With dead ends: 236 [2018-02-04 17:42:47,911 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 17:42:47,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:42:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 17:42:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-02-04 17:42:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 17:42:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 250 transitions. [2018-02-04 17:42:47,915 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 250 transitions. Word has length 82 [2018-02-04 17:42:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:47,915 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 250 transitions. [2018-02-04 17:42:47,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:42:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 250 transitions. [2018-02-04 17:42:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 17:42:47,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:47,915 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:47,915 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:47,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2125745566, now seen corresponding path program 16 times [2018-02-04 17:42:47,916 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:47,916 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:47,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:47,916 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:47,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:47,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:48,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:48,064 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:48,064 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:42:48,071 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:42:48,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:48,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:48,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:48,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-02-04 17:42:48,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:42:48,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:42:48,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:42:48,097 INFO L87 Difference]: Start difference. First operand 218 states and 250 transitions. Second operand 19 states. [2018-02-04 17:42:49,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:49,065 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2018-02-04 17:42:49,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:42:49,065 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-04 17:42:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:49,066 INFO L225 Difference]: With dead ends: 249 [2018-02-04 17:42:49,066 INFO L226 Difference]: Without dead ends: 249 [2018-02-04 17:42:49,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:42:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-04 17:42:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 230. [2018-02-04 17:42:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-04 17:42:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-02-04 17:42:49,069 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 87 [2018-02-04 17:42:49,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:49,069 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-02-04 17:42:49,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:42:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-02-04 17:42:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 17:42:49,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:49,070 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:49,070 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash 120606869, now seen corresponding path program 17 times [2018-02-04 17:42:49,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:49,070 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:49,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:49,071 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:49,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:49,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:49,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:49,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:49,185 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:42:49,193 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 17:42:49,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:49,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:49,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:49,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-02-04 17:42:49,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 17:42:49,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 17:42:49,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:42:49,368 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 38 states. [2018-02-04 17:42:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:50,159 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2018-02-04 17:42:50,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:42:50,159 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 92 [2018-02-04 17:42:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:50,160 INFO L225 Difference]: With dead ends: 262 [2018-02-04 17:42:50,160 INFO L226 Difference]: Without dead ends: 262 [2018-02-04 17:42:50,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:42:50,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-04 17:42:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2018-02-04 17:42:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 17:42:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-02-04 17:42:50,165 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 92 [2018-02-04 17:42:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:50,166 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-02-04 17:42:50,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 17:42:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-02-04 17:42:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 17:42:50,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:50,167 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:50,167 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:50,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2070056958, now seen corresponding path program 18 times [2018-02-04 17:42:50,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:50,167 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:50,168 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:50,168 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:50,168 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:50,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:50,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:50,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:50,315 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:42:50,325 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 17:42:50,325 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:50,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:50,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:50,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-02-04 17:42:50,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:42:50,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:42:50,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:42:50,463 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 41 states. [2018-02-04 17:42:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:51,693 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2018-02-04 17:42:51,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:42:51,693 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 97 [2018-02-04 17:42:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:51,694 INFO L225 Difference]: With dead ends: 275 [2018-02-04 17:42:51,694 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 17:42:51,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:42:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 17:42:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2018-02-04 17:42:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 17:42:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 292 transitions. [2018-02-04 17:42:51,700 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 292 transitions. Word has length 97 [2018-02-04 17:42:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:51,700 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 292 transitions. [2018-02-04 17:42:51,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:42:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 292 transitions. [2018-02-04 17:42:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 17:42:51,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:51,701 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:51,701 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash 183274037, now seen corresponding path program 19 times [2018-02-04 17:42:51,701 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:51,701 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:51,702 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:51,702 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:51,702 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:51,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:51,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:51,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:51,907 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:51,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:51,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:51,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-02-04 17:42:51,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:42:51,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:42:51,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:42:51,947 INFO L87 Difference]: Start difference. First operand 254 states and 292 transitions. Second operand 23 states. [2018-02-04 17:42:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:52,513 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2018-02-04 17:42:52,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:42:52,513 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-02-04 17:42:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:52,514 INFO L225 Difference]: With dead ends: 288 [2018-02-04 17:42:52,514 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 17:42:52,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:42:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 17:42:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2018-02-04 17:42:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 17:42:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-02-04 17:42:52,518 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 102 [2018-02-04 17:42:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:52,518 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-02-04 17:42:52,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:42:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-02-04 17:42:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 17:42:52,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:52,519 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:52,519 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1033282978, now seen corresponding path program 20 times [2018-02-04 17:42:52,519 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:52,519 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:52,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:52,519 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:52,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:52,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:52,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:52,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:52,756 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:42:52,764 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:42:52,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:52,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:52,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:52,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-02-04 17:42:52,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 17:42:52,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 17:42:52,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:42:52,787 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 24 states. [2018-02-04 17:42:53,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:53,362 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2018-02-04 17:42:53,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:42:53,363 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-02-04 17:42:53,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:53,363 INFO L225 Difference]: With dead ends: 301 [2018-02-04 17:42:53,364 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 17:42:53,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:42:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 17:42:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 278. [2018-02-04 17:42:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-04 17:42:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 320 transitions. [2018-02-04 17:42:53,369 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 320 transitions. Word has length 107 [2018-02-04 17:42:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:53,370 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 320 transitions. [2018-02-04 17:42:53,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 17:42:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 320 transitions. [2018-02-04 17:42:53,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 17:42:53,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:53,371 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:53,371 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:53,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1905968171, now seen corresponding path program 21 times [2018-02-04 17:42:53,371 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:53,371 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:53,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:53,372 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:53,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:53,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:53,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:53,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:53,618 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:42:53,630 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 17:42:53,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:53,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:53,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:53,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-02-04 17:42:53,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:42:53,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:42:53,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:42:53,654 INFO L87 Difference]: Start difference. First operand 278 states and 320 transitions. Second operand 25 states. [2018-02-04 17:42:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:54,243 INFO L93 Difference]: Finished difference Result 314 states and 359 transitions. [2018-02-04 17:42:54,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:42:54,255 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-04 17:42:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:54,256 INFO L225 Difference]: With dead ends: 314 [2018-02-04 17:42:54,256 INFO L226 Difference]: Without dead ends: 314 [2018-02-04 17:42:54,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 17:42:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-04 17:42:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 290. [2018-02-04 17:42:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-04 17:42:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2018-02-04 17:42:54,260 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 112 [2018-02-04 17:42:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:54,260 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2018-02-04 17:42:54,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:42:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2018-02-04 17:42:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 17:42:54,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:54,261 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:54,261 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:54,261 INFO L82 PathProgramCache]: Analyzing trace with hash -994136898, now seen corresponding path program 22 times [2018-02-04 17:42:54,261 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:54,261 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:54,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:54,262 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:54,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:54,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:54,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:54,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:54,446 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:42:54,454 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:42:54,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:54,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:54,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:54,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-02-04 17:42:54,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:42:54,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:42:54,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:42:54,479 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand 26 states. [2018-02-04 17:42:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:55,067 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2018-02-04 17:42:55,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:42:55,067 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-04 17:42:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:55,068 INFO L225 Difference]: With dead ends: 327 [2018-02-04 17:42:55,068 INFO L226 Difference]: Without dead ends: 327 [2018-02-04 17:42:55,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 17:42:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-04 17:42:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2018-02-04 17:42:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-04 17:42:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 348 transitions. [2018-02-04 17:42:55,072 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 348 transitions. Word has length 117 [2018-02-04 17:42:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:55,072 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 348 transitions. [2018-02-04 17:42:55,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:42:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 348 transitions. [2018-02-04 17:42:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 17:42:55,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:55,074 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:55,074 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1248093557, now seen corresponding path program 23 times [2018-02-04 17:42:55,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:55,074 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:55,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:55,075 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:55,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:55,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:55,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:55,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:55,315 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:42:55,331 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 17:42:55,331 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:55,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:55,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:55,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2018-02-04 17:42:55,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:42:55,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:42:55,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:42:55,688 INFO L87 Difference]: Start difference. First operand 302 states and 348 transitions. Second operand 50 states. [2018-02-04 17:42:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:57,911 INFO L93 Difference]: Finished difference Result 340 states and 389 transitions. [2018-02-04 17:42:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:42:57,912 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 122 [2018-02-04 17:42:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:57,912 INFO L225 Difference]: With dead ends: 340 [2018-02-04 17:42:57,913 INFO L226 Difference]: Without dead ends: 340 [2018-02-04 17:42:57,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:42:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-04 17:42:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 314. [2018-02-04 17:42:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-04 17:42:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-02-04 17:42:57,916 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 122 [2018-02-04 17:42:57,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:57,916 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-02-04 17:42:57,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:42:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-02-04 17:42:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 17:42:57,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:57,917 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:57,917 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1210546402, now seen corresponding path program 24 times [2018-02-04 17:42:57,917 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:57,917 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:57,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:57,918 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:57,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:57,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:58,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:58,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:58,158 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:42:58,172 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 17:42:58,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:58,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:58,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:58,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 36 [2018-02-04 17:42:58,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:42:58,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:42:58,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:42:58,357 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 37 states. [2018-02-04 17:42:59,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:59,254 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-02-04 17:42:59,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:42:59,254 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-02-04 17:42:59,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:59,255 INFO L225 Difference]: With dead ends: 353 [2018-02-04 17:42:59,255 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 17:42:59,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1067, Invalid=2593, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:42:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 17:42:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 326. [2018-02-04 17:42:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-04 17:42:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 376 transitions. [2018-02-04 17:42:59,260 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 376 transitions. Word has length 127 [2018-02-04 17:42:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:59,260 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 376 transitions. [2018-02-04 17:42:59,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:42:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 376 transitions. [2018-02-04 17:42:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 17:42:59,260 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:59,260 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:59,261 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash 53741333, now seen corresponding path program 25 times [2018-02-04 17:42:59,261 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:59,261 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:59,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:59,261 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:59,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:59,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:59,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:59,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:59,514 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:59,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:59,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:59,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-02-04 17:42:59,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:42:59,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:42:59,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:42:59,544 INFO L87 Difference]: Start difference. First operand 326 states and 376 transitions. Second operand 29 states. [2018-02-04 17:43:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:00,162 INFO L93 Difference]: Finished difference Result 366 states and 419 transitions. [2018-02-04 17:43:00,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 17:43:00,162 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-02-04 17:43:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:00,164 INFO L225 Difference]: With dead ends: 366 [2018-02-04 17:43:00,164 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 17:43:00,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 17:43:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 17:43:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2018-02-04 17:43:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 17:43:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 390 transitions. [2018-02-04 17:43:00,172 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 390 transitions. Word has length 132 [2018-02-04 17:43:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:00,173 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 390 transitions. [2018-02-04 17:43:00,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:43:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 390 transitions. [2018-02-04 17:43:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 17:43:00,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:00,174 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:00,174 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash -173217410, now seen corresponding path program 26 times [2018-02-04 17:43:00,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:00,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:00,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:00,175 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:00,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:00,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:00,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:00,441 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:00,441 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:00,447 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:00,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:00,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:00,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:00,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-02-04 17:43:00,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 17:43:00,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 17:43:00,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:43:00,467 INFO L87 Difference]: Start difference. First operand 338 states and 390 transitions. Second operand 30 states. [2018-02-04 17:43:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:01,220 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-02-04 17:43:01,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:43:01,220 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-02-04 17:43:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:01,221 INFO L225 Difference]: With dead ends: 379 [2018-02-04 17:43:01,221 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 17:43:01,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:43:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 17:43:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 350. [2018-02-04 17:43:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 17:43:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 404 transitions. [2018-02-04 17:43:01,225 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 404 transitions. Word has length 137 [2018-02-04 17:43:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:01,225 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 404 transitions. [2018-02-04 17:43:01,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 17:43:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 404 transitions. [2018-02-04 17:43:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 17:43:01,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:01,226 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:01,226 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:01,226 INFO L82 PathProgramCache]: Analyzing trace with hash 681451701, now seen corresponding path program 27 times [2018-02-04 17:43:01,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:01,226 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:01,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:01,227 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:01,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:01,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:01,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:01,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:01,527 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:01,535 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 17:43:01,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:01,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:01,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:01,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-02-04 17:43:01,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 17:43:01,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 17:43:01,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:43:01,553 INFO L87 Difference]: Start difference. First operand 350 states and 404 transitions. Second operand 31 states. [2018-02-04 17:43:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:02,409 INFO L93 Difference]: Finished difference Result 392 states and 449 transitions. [2018-02-04 17:43:02,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:43:02,410 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-02-04 17:43:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:02,410 INFO L225 Difference]: With dead ends: 392 [2018-02-04 17:43:02,411 INFO L226 Difference]: Without dead ends: 392 [2018-02-04 17:43:02,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 17:43:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-04 17:43:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2018-02-04 17:43:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-04 17:43:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 418 transitions. [2018-02-04 17:43:02,415 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 418 transitions. Word has length 142 [2018-02-04 17:43:02,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:02,415 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 418 transitions. [2018-02-04 17:43:02,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 17:43:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 418 transitions. [2018-02-04 17:43:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 17:43:02,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:02,415 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:02,415 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:02,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1555157982, now seen corresponding path program 28 times [2018-02-04 17:43:02,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:02,416 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:02,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:02,416 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:02,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:02,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:02,745 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:02,746 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:02,746 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:02,752 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:02,752 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:02,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:03,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:03,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2018-02-04 17:43:03,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 17:43:03,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 17:43:03,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:43:03,132 INFO L87 Difference]: Start difference. First operand 362 states and 418 transitions. Second operand 61 states. [2018-02-04 17:43:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:05,493 INFO L93 Difference]: Finished difference Result 405 states and 464 transitions. [2018-02-04 17:43:05,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 17:43:05,493 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 147 [2018-02-04 17:43:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:05,494 INFO L225 Difference]: With dead ends: 405 [2018-02-04 17:43:05,494 INFO L226 Difference]: Without dead ends: 405 [2018-02-04 17:43:05,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:43:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-04 17:43:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 374. [2018-02-04 17:43:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-04 17:43:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 432 transitions. [2018-02-04 17:43:05,501 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 432 transitions. Word has length 147 [2018-02-04 17:43:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:05,501 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 432 transitions. [2018-02-04 17:43:05,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 17:43:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 432 transitions. [2018-02-04 17:43:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-04 17:43:05,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:05,502 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:05,502 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:05,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1978446421, now seen corresponding path program 29 times [2018-02-04 17:43:05,503 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:05,503 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:05,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:05,503 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:05,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:05,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:05,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:05,825 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:05,825 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:05,840 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 17:43:05,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:05,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:06,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:06,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2018-02-04 17:43:06,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 17:43:06,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 17:43:06,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 17:43:06,261 INFO L87 Difference]: Start difference. First operand 374 states and 432 transitions. Second operand 62 states. [2018-02-04 17:43:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:09,105 INFO L93 Difference]: Finished difference Result 418 states and 479 transitions. [2018-02-04 17:43:09,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:43:09,106 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2018-02-04 17:43:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:09,107 INFO L225 Difference]: With dead ends: 418 [2018-02-04 17:43:09,107 INFO L226 Difference]: Without dead ends: 418 [2018-02-04 17:43:09,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:43:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-04 17:43:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 386. [2018-02-04 17:43:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-04 17:43:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 446 transitions. [2018-02-04 17:43:09,113 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 446 transitions. Word has length 152 [2018-02-04 17:43:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:09,113 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 446 transitions. [2018-02-04 17:43:09,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 17:43:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 446 transitions. [2018-02-04 17:43:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 17:43:09,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:09,115 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:09,115 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1344453058, now seen corresponding path program 30 times [2018-02-04 17:43:09,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:09,115 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:09,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:09,116 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:09,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:09,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:09,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:09,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:09,476 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:09,488 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 17:43:09,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:09,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:09,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:09,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-02-04 17:43:09,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:43:09,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:43:09,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=818, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:43:09,556 INFO L87 Difference]: Start difference. First operand 386 states and 446 transitions. Second operand 37 states. [2018-02-04 17:43:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:10,391 INFO L93 Difference]: Finished difference Result 431 states and 494 transitions. [2018-02-04 17:43:10,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 17:43:10,391 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-02-04 17:43:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:10,392 INFO L225 Difference]: With dead ends: 431 [2018-02-04 17:43:10,392 INFO L226 Difference]: Without dead ends: 431 [2018-02-04 17:43:10,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1562, Invalid=2860, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 17:43:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-04 17:43:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 398. [2018-02-04 17:43:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-04 17:43:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 460 transitions. [2018-02-04 17:43:10,397 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 460 transitions. Word has length 157 [2018-02-04 17:43:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:10,398 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 460 transitions. [2018-02-04 17:43:10,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:43:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 460 transitions. [2018-02-04 17:43:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 17:43:10,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:10,399 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:10,399 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1846952971, now seen corresponding path program 31 times [2018-02-04 17:43:10,399 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:10,400 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:10,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:10,400 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:10,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:10,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:10,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:10,797 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:10,798 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:10,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:10,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:10,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 17:43:10,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:43:10,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:43:10,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:43:10,844 INFO L87 Difference]: Start difference. First operand 398 states and 460 transitions. Second operand 35 states. [2018-02-04 17:43:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:11,620 INFO L93 Difference]: Finished difference Result 444 states and 509 transitions. [2018-02-04 17:43:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:43:11,620 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-02-04 17:43:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:11,622 INFO L225 Difference]: With dead ends: 444 [2018-02-04 17:43:11,622 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 17:43:11,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:43:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 17:43:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2018-02-04 17:43:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 17:43:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 474 transitions. [2018-02-04 17:43:11,626 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 474 transitions. Word has length 162 [2018-02-04 17:43:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:11,635 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 474 transitions. [2018-02-04 17:43:11,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:43:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 474 transitions. [2018-02-04 17:43:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 17:43:11,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:11,636 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:11,636 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:11,637 INFO L82 PathProgramCache]: Analyzing trace with hash -156942178, now seen corresponding path program 32 times [2018-02-04 17:43:11,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:11,637 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:11,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:11,638 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:11,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:11,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:12,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:12,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:12,116 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:12,123 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:12,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:12,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:12,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:12,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 17:43:12,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:43:12,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:43:12,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:43:12,179 INFO L87 Difference]: Start difference. First operand 410 states and 474 transitions. Second operand 35 states. [2018-02-04 17:43:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:15,457 INFO L93 Difference]: Finished difference Result 457 states and 524 transitions. [2018-02-04 17:43:15,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 17:43:15,458 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-04 17:43:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:15,459 INFO L225 Difference]: With dead ends: 457 [2018-02-04 17:43:15,459 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 17:43:15,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:43:15,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 17:43:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-02-04 17:43:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 17:43:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 488 transitions. [2018-02-04 17:43:15,465 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 488 transitions. Word has length 167 [2018-02-04 17:43:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:15,465 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 488 transitions. [2018-02-04 17:43:15,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:43:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 488 transitions. [2018-02-04 17:43:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 17:43:15,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:15,467 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:15,467 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:15,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1361101419, now seen corresponding path program 33 times [2018-02-04 17:43:15,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:15,467 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:15,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:15,468 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:15,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:15,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:15,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:15,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:15,932 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:15,943 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 17:43:15,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:15,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:15,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:15,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-02-04 17:43:15,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:43:15,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:43:15,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:43:15,986 INFO L87 Difference]: Start difference. First operand 422 states and 488 transitions. Second operand 37 states. [2018-02-04 17:43:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:16,845 INFO L93 Difference]: Finished difference Result 470 states and 539 transitions. [2018-02-04 17:43:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 17:43:16,845 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-02-04 17:43:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:16,846 INFO L225 Difference]: With dead ends: 470 [2018-02-04 17:43:16,846 INFO L226 Difference]: Without dead ends: 470 [2018-02-04 17:43:16,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 17:43:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-04 17:43:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2018-02-04 17:43:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-04 17:43:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-02-04 17:43:16,850 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 172 [2018-02-04 17:43:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:16,851 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 502 transitions. [2018-02-04 17:43:16,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:43:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 502 transitions. [2018-02-04 17:43:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 17:43:16,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:16,852 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:16,852 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash -587218178, now seen corresponding path program 34 times [2018-02-04 17:43:16,852 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:16,852 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:16,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:16,853 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:16,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:16,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:17,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:17,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:17,269 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:17,276 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:17,276 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:17,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:17,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:17,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-02-04 17:43:17,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 17:43:17,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 17:43:17,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:43:17,298 INFO L87 Difference]: Start difference. First operand 434 states and 502 transitions. Second operand 38 states. [2018-02-04 17:43:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:18,251 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2018-02-04 17:43:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:43:18,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-02-04 17:43:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:18,253 INFO L225 Difference]: With dead ends: 483 [2018-02-04 17:43:18,253 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 17:43:18,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 17:43:18,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 17:43:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 446. [2018-02-04 17:43:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-04 17:43:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 516 transitions. [2018-02-04 17:43:18,256 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 516 transitions. Word has length 177 [2018-02-04 17:43:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:18,256 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 516 transitions. [2018-02-04 17:43:18,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 17:43:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 516 transitions. [2018-02-04 17:43:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 17:43:18,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:18,257 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:18,257 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:18,257 INFO L82 PathProgramCache]: Analyzing trace with hash 714553141, now seen corresponding path program 35 times [2018-02-04 17:43:18,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:18,258 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:18,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:18,258 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:18,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:18,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:18,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:18,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:18,626 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:18,639 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 17:43:18,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:18,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:19,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:19,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 73 [2018-02-04 17:43:19,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 17:43:19,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 17:43:19,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:43:19,102 INFO L87 Difference]: Start difference. First operand 446 states and 516 transitions. Second operand 74 states. [2018-02-04 17:43:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:24,230 INFO L93 Difference]: Finished difference Result 496 states and 569 transitions. [2018-02-04 17:43:24,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:43:24,230 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 182 [2018-02-04 17:43:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:24,231 INFO L225 Difference]: With dead ends: 496 [2018-02-04 17:43:24,231 INFO L226 Difference]: Without dead ends: 496 [2018-02-04 17:43:24,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 17:43:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-02-04 17:43:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 458. [2018-02-04 17:43:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-04 17:43:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 530 transitions. [2018-02-04 17:43:24,235 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 530 transitions. Word has length 182 [2018-02-04 17:43:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:24,235 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 530 transitions. [2018-02-04 17:43:24,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 17:43:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 530 transitions. [2018-02-04 17:43:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 17:43:24,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:24,236 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:24,236 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:24,237 INFO L82 PathProgramCache]: Analyzing trace with hash 325242206, now seen corresponding path program 36 times [2018-02-04 17:43:24,237 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:24,237 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:24,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:24,238 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:24,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:24,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:24,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:24,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:24,658 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:24,674 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 17:43:24,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:24,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:24,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:24,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-02-04 17:43:24,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 17:43:24,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 17:43:24,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1244, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:43:24,835 INFO L87 Difference]: Start difference. First operand 458 states and 530 transitions. Second operand 45 states. [2018-02-04 17:43:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:26,207 INFO L93 Difference]: Finished difference Result 509 states and 584 transitions. [2018-02-04 17:43:26,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 17:43:26,207 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-02-04 17:43:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:26,209 INFO L225 Difference]: With dead ends: 509 [2018-02-04 17:43:26,209 INFO L226 Difference]: Without dead ends: 509 [2018-02-04 17:43:26,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2205, Invalid=4275, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 17:43:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-04 17:43:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 470. [2018-02-04 17:43:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-02-04 17:43:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 544 transitions. [2018-02-04 17:43:26,214 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 544 transitions. Word has length 187 [2018-02-04 17:43:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:26,214 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 544 transitions. [2018-02-04 17:43:26,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 17:43:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 544 transitions. [2018-02-04 17:43:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 17:43:26,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:26,215 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:26,215 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:26,216 INFO L82 PathProgramCache]: Analyzing trace with hash 777758933, now seen corresponding path program 37 times [2018-02-04 17:43:26,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:26,216 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:26,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:26,216 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:26,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:26,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:26,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:26,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:26,664 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:26,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:26,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:26,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-02-04 17:43:26,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:43:26,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:43:26,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:43:26,703 INFO L87 Difference]: Start difference. First operand 470 states and 544 transitions. Second operand 41 states. [2018-02-04 17:43:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:27,668 INFO L93 Difference]: Finished difference Result 522 states and 599 transitions. [2018-02-04 17:43:27,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 17:43:27,668 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-02-04 17:43:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:27,669 INFO L225 Difference]: With dead ends: 522 [2018-02-04 17:43:27,669 INFO L226 Difference]: Without dead ends: 522 [2018-02-04 17:43:27,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 17:43:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-02-04 17:43:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 482. [2018-02-04 17:43:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-02-04 17:43:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 558 transitions. [2018-02-04 17:43:27,673 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 558 transitions. Word has length 192 [2018-02-04 17:43:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:27,673 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 558 transitions. [2018-02-04 17:43:27,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:43:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 558 transitions. [2018-02-04 17:43:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 17:43:27,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:27,674 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:27,674 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1362862146, now seen corresponding path program 38 times [2018-02-04 17:43:27,674 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:27,674 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:27,675 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:27,675 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:27,675 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:27,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:28,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:28,095 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:28,095 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:28,102 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:28,102 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:28,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:28,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:28,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-02-04 17:43:28,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 17:43:28,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 17:43:28,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:43:28,130 INFO L87 Difference]: Start difference. First operand 482 states and 558 transitions. Second operand 42 states. [2018-02-04 17:43:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:29,262 INFO L93 Difference]: Finished difference Result 535 states and 614 transitions. [2018-02-04 17:43:29,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 17:43:29,262 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-02-04 17:43:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:29,263 INFO L225 Difference]: With dead ends: 535 [2018-02-04 17:43:29,263 INFO L226 Difference]: Without dead ends: 535 [2018-02-04 17:43:29,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 17:43:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-04 17:43:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 494. [2018-02-04 17:43:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-04 17:43:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 572 transitions. [2018-02-04 17:43:29,267 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 572 transitions. Word has length 197 [2018-02-04 17:43:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:29,267 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 572 transitions. [2018-02-04 17:43:29,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 17:43:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 572 transitions. [2018-02-04 17:43:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 17:43:29,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:29,268 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:29,268 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:29,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1324782197, now seen corresponding path program 39 times [2018-02-04 17:43:29,268 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:29,268 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:29,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:29,268 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:29,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:29,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:29,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:29,721 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:29,721 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:29,736 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 17:43:29,736 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:29,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:29,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:29,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-02-04 17:43:29,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 17:43:29,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 17:43:29,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:43:29,783 INFO L87 Difference]: Start difference. First operand 494 states and 572 transitions. Second operand 43 states. [2018-02-04 17:43:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:30,884 INFO L93 Difference]: Finished difference Result 548 states and 629 transitions. [2018-02-04 17:43:30,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 17:43:30,884 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-02-04 17:43:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:30,885 INFO L225 Difference]: With dead ends: 548 [2018-02-04 17:43:30,885 INFO L226 Difference]: Without dead ends: 548 [2018-02-04 17:43:30,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 17:43:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-02-04 17:43:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 506. [2018-02-04 17:43:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-02-04 17:43:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 586 transitions. [2018-02-04 17:43:30,891 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 586 transitions. Word has length 202 [2018-02-04 17:43:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:30,891 INFO L432 AbstractCegarLoop]: Abstraction has 506 states and 586 transitions. [2018-02-04 17:43:30,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 17:43:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 586 transitions. [2018-02-04 17:43:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 17:43:30,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:30,892 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:30,892 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2003142114, now seen corresponding path program 40 times [2018-02-04 17:43:30,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:30,893 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:30,893 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:30,893 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:30,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:30,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:31,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:31,340 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:31,341 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:31,348 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:31,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:31,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:31,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:31,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-02-04 17:43:31,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:43:31,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:43:31,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:43:31,377 INFO L87 Difference]: Start difference. First operand 506 states and 586 transitions. Second operand 44 states. [2018-02-04 17:43:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:33,270 INFO L93 Difference]: Finished difference Result 561 states and 644 transitions. [2018-02-04 17:43:33,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 17:43:33,270 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-02-04 17:43:33,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:33,271 INFO L225 Difference]: With dead ends: 561 [2018-02-04 17:43:33,271 INFO L226 Difference]: Without dead ends: 561 [2018-02-04 17:43:33,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 17:43:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-04 17:43:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 518. [2018-02-04 17:43:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-02-04 17:43:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 600 transitions. [2018-02-04 17:43:33,276 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 600 transitions. Word has length 207 [2018-02-04 17:43:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:33,276 INFO L432 AbstractCegarLoop]: Abstraction has 518 states and 600 transitions. [2018-02-04 17:43:33,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:43:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 600 transitions. [2018-02-04 17:43:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 17:43:33,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:33,278 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:33,278 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash 749859861, now seen corresponding path program 41 times [2018-02-04 17:43:33,278 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:33,278 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:33,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:33,279 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:33,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:33,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:33,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:33,906 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:33,907 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:33,923 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 17:43:33,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:33,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:34,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:34,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 85 [2018-02-04 17:43:34,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-02-04 17:43:34,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-02-04 17:43:34,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 17:43:34,584 INFO L87 Difference]: Start difference. First operand 518 states and 600 transitions. Second operand 86 states. [2018-02-04 17:43:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:40,106 INFO L93 Difference]: Finished difference Result 574 states and 659 transitions. [2018-02-04 17:43:40,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 17:43:40,106 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 212 [2018-02-04 17:43:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:40,108 INFO L225 Difference]: With dead ends: 574 [2018-02-04 17:43:40,108 INFO L226 Difference]: Without dead ends: 574 [2018-02-04 17:43:40,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 17:43:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-04 17:43:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 530. [2018-02-04 17:43:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-04 17:43:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 614 transitions. [2018-02-04 17:43:40,111 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 614 transitions. Word has length 212 [2018-02-04 17:43:40,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:40,111 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 614 transitions. [2018-02-04 17:43:40,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-02-04 17:43:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 614 transitions. [2018-02-04 17:43:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 17:43:40,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:40,112 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:40,112 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:40,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1629807490, now seen corresponding path program 42 times [2018-02-04 17:43:40,112 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:40,112 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:40,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:40,113 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:40,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:40,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:40,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:40,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:40,631 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:40,645 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 17:43:40,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:40,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:40,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:40,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 48 [2018-02-04 17:43:40,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 17:43:40,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 17:43:40,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=1388, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:43:40,773 INFO L87 Difference]: Start difference. First operand 530 states and 614 transitions. Second operand 49 states. [2018-02-04 17:43:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:42,194 INFO L93 Difference]: Finished difference Result 587 states and 674 transitions. [2018-02-04 17:43:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 17:43:42,194 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-02-04 17:43:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:42,195 INFO L225 Difference]: With dead ends: 587 [2018-02-04 17:43:42,195 INFO L226 Difference]: Without dead ends: 587 [2018-02-04 17:43:42,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2936, Invalid=5254, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 17:43:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-04 17:43:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 542. [2018-02-04 17:43:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-02-04 17:43:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 628 transitions. [2018-02-04 17:43:42,200 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 628 transitions. Word has length 217 [2018-02-04 17:43:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:42,200 INFO L432 AbstractCegarLoop]: Abstraction has 542 states and 628 transitions. [2018-02-04 17:43:42,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 17:43:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 628 transitions. [2018-02-04 17:43:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-04 17:43:42,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:42,201 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:42,201 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash 324521397, now seen corresponding path program 43 times [2018-02-04 17:43:42,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:42,201 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:42,201 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:42,201 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:42,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:42,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:42,805 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:42,805 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:42,805 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:42,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:42,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:42,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-02-04 17:43:42,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 17:43:42,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 17:43:42,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:43:42,841 INFO L87 Difference]: Start difference. First operand 542 states and 628 transitions. Second operand 47 states. [2018-02-04 17:43:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:44,019 INFO L93 Difference]: Finished difference Result 600 states and 689 transitions. [2018-02-04 17:43:44,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:43:44,019 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-02-04 17:43:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:44,020 INFO L225 Difference]: With dead ends: 600 [2018-02-04 17:43:44,020 INFO L226 Difference]: Without dead ends: 600 [2018-02-04 17:43:44,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 17:43:44,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-02-04 17:43:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 554. [2018-02-04 17:43:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-02-04 17:43:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 642 transitions. [2018-02-04 17:43:44,025 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 642 transitions. Word has length 222 [2018-02-04 17:43:44,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:44,025 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 642 transitions. [2018-02-04 17:43:44,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 17:43:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 642 transitions. [2018-02-04 17:43:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 17:43:44,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:44,026 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:44,026 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:44,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1945913054, now seen corresponding path program 44 times [2018-02-04 17:43:44,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:44,026 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:44,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:44,026 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:43:44,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:44,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:44,587 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:44,587 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:44,588 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:43:44,595 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:43:44,595 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:44,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:44,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:44,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-02-04 17:43:44,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 17:43:44,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 17:43:44,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:43:44,736 INFO L87 Difference]: Start difference. First operand 554 states and 642 transitions. Second operand 55 states. [2018-02-04 17:43:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:46,525 INFO L93 Difference]: Finished difference Result 613 states and 704 transitions. [2018-02-04 17:43:46,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 17:43:46,526 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2018-02-04 17:43:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:46,527 INFO L225 Difference]: With dead ends: 613 [2018-02-04 17:43:46,527 INFO L226 Difference]: Without dead ends: 613 [2018-02-04 17:43:46,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3077, Invalid=6625, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 17:43:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-02-04 17:43:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 566. [2018-02-04 17:43:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-02-04 17:43:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 656 transitions. [2018-02-04 17:43:46,531 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 656 transitions. Word has length 227 [2018-02-04 17:43:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:46,531 INFO L432 AbstractCegarLoop]: Abstraction has 566 states and 656 transitions. [2018-02-04 17:43:46,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 17:43:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 656 transitions. [2018-02-04 17:43:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 17:43:46,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:46,533 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:46,533 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:46,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1707991211, now seen corresponding path program 45 times [2018-02-04 17:43:46,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:46,533 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:46,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:46,534 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:46,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:46,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:47,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:47,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:47,122 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:43:47,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 17:43:47,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:47,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:47,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:47,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-02-04 17:43:47,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 17:43:47,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 17:43:47,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:43:47,176 INFO L87 Difference]: Start difference. First operand 566 states and 656 transitions. Second operand 49 states. [2018-02-04 17:43:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:48,425 INFO L93 Difference]: Finished difference Result 626 states and 719 transitions. [2018-02-04 17:43:48,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 17:43:48,426 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-02-04 17:43:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:48,427 INFO L225 Difference]: With dead ends: 626 [2018-02-04 17:43:48,427 INFO L226 Difference]: Without dead ends: 626 [2018-02-04 17:43:48,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 17:43:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-02-04 17:43:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 578. [2018-02-04 17:43:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-04 17:43:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 670 transitions. [2018-02-04 17:43:48,431 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 670 transitions. Word has length 232 [2018-02-04 17:43:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:48,431 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 670 transitions. [2018-02-04 17:43:48,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 17:43:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 670 transitions. [2018-02-04 17:43:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 17:43:48,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:48,432 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:48,432 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:48,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1861482814, now seen corresponding path program 46 times [2018-02-04 17:43:48,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:48,432 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:48,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:48,433 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:48,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:48,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:49,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:49,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:49,013 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:43:49,024 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:43:49,024 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:49,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:49,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:49,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-02-04 17:43:49,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:43:49,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:43:49,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:43:49,066 INFO L87 Difference]: Start difference. First operand 578 states and 670 transitions. Second operand 50 states. [2018-02-04 17:43:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:50,570 INFO L93 Difference]: Finished difference Result 639 states and 734 transitions. [2018-02-04 17:43:50,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 17:43:50,570 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-02-04 17:43:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:50,571 INFO L225 Difference]: With dead ends: 639 [2018-02-04 17:43:50,571 INFO L226 Difference]: Without dead ends: 639 [2018-02-04 17:43:50,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 17:43:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-02-04 17:43:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 590. [2018-02-04 17:43:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-02-04 17:43:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 684 transitions. [2018-02-04 17:43:50,575 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 684 transitions. Word has length 237 [2018-02-04 17:43:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:50,575 INFO L432 AbstractCegarLoop]: Abstraction has 590 states and 684 transitions. [2018-02-04 17:43:50,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:43:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 684 transitions. [2018-02-04 17:43:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-04 17:43:50,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:50,576 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:50,576 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:50,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1141565685, now seen corresponding path program 47 times [2018-02-04 17:43:50,576 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:50,576 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:50,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:50,577 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:50,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:50,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:51,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:51,250 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:51,251 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:43:51,266 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 17:43:51,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:51,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:52,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:52,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 97 [2018-02-04 17:43:52,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-02-04 17:43:52,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-02-04 17:43:52,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-02-04 17:43:52,029 INFO L87 Difference]: Start difference. First operand 590 states and 684 transitions. Second operand 98 states. [2018-02-04 17:43:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:43:57,592 INFO L93 Difference]: Finished difference Result 652 states and 749 transitions. [2018-02-04 17:43:57,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:43:57,592 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 242 [2018-02-04 17:43:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:43:57,593 INFO L225 Difference]: With dead ends: 652 [2018-02-04 17:43:57,593 INFO L226 Difference]: Without dead ends: 652 [2018-02-04 17:43:57,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4419 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 17:43:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-02-04 17:43:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 602. [2018-02-04 17:43:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-02-04 17:43:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 698 transitions. [2018-02-04 17:43:57,598 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 698 transitions. Word has length 242 [2018-02-04 17:43:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:43:57,598 INFO L432 AbstractCegarLoop]: Abstraction has 602 states and 698 transitions. [2018-02-04 17:43:57,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-02-04 17:43:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 698 transitions. [2018-02-04 17:43:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-04 17:43:57,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:43:57,599 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 17:43:57,599 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:43:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 993538974, now seen corresponding path program 48 times [2018-02-04 17:43:57,599 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:43:57,599 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:43:57,599 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:57,600 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:43:57,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:43:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:43:57,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:43:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:58,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:43:58,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:43:58,254 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:43:58,271 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 17:43:58,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:43:58,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:43:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:43:58,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:43:58,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 68 [2018-02-04 17:43:58,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 17:43:58,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 17:43:58,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=3260, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 17:43:58,693 INFO L87 Difference]: Start difference. First operand 602 states and 698 transitions. Second operand 69 states. [2018-02-04 17:44:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:01,780 INFO L93 Difference]: Finished difference Result 665 states and 764 transitions. [2018-02-04 17:44:01,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 17:44:01,780 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-02-04 17:44:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:01,781 INFO L225 Difference]: With dead ends: 665 [2018-02-04 17:44:01,781 INFO L226 Difference]: Without dead ends: 665 [2018-02-04 17:44:01,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3855, Invalid=9717, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 17:44:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-04 17:44:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 614. [2018-02-04 17:44:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-02-04 17:44:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 712 transitions. [2018-02-04 17:44:01,786 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 712 transitions. Word has length 247 [2018-02-04 17:44:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:01,786 INFO L432 AbstractCegarLoop]: Abstraction has 614 states and 712 transitions. [2018-02-04 17:44:01,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 17:44:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 712 transitions. [2018-02-04 17:44:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-04 17:44:01,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:01,787 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:01,788 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:01,788 INFO L82 PathProgramCache]: Analyzing trace with hash 522988181, now seen corresponding path program 49 times [2018-02-04 17:44:01,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:01,788 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:01,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:01,788 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:01,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:01,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:02,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:02,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:02,600 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:44:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:02,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:02,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:02,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-02-04 17:44:02,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:44:02,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:44:02,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:44:02,654 INFO L87 Difference]: Start difference. First operand 614 states and 712 transitions. Second operand 53 states. [2018-02-04 17:44:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:04,388 INFO L93 Difference]: Finished difference Result 678 states and 779 transitions. [2018-02-04 17:44:04,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:44:04,389 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-02-04 17:44:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:04,391 INFO L225 Difference]: With dead ends: 678 [2018-02-04 17:44:04,391 INFO L226 Difference]: Without dead ends: 678 [2018-02-04 17:44:04,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 17:44:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-02-04 17:44:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 626. [2018-02-04 17:44:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-02-04 17:44:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 726 transitions. [2018-02-04 17:44:04,398 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 726 transitions. Word has length 252 [2018-02-04 17:44:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:04,399 INFO L432 AbstractCegarLoop]: Abstraction has 626 states and 726 transitions. [2018-02-04 17:44:04,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:44:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 726 transitions. [2018-02-04 17:44:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 17:44:04,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:04,400 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:04,400 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:04,401 INFO L82 PathProgramCache]: Analyzing trace with hash 683603454, now seen corresponding path program 50 times [2018-02-04 17:44:04,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:04,401 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:04,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:04,401 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:44:04,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:04,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:05,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:05,142 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:05,143 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:44:05,151 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:44:05,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:05,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:05,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:05,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-02-04 17:44:05,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 17:44:05,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 17:44:05,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 17:44:05,256 INFO L87 Difference]: Start difference. First operand 626 states and 726 transitions. Second operand 58 states. [2018-02-04 17:44:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:07,205 INFO L93 Difference]: Finished difference Result 691 states and 794 transitions. [2018-02-04 17:44:07,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 17:44:07,205 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 257 [2018-02-04 17:44:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:07,207 INFO L225 Difference]: With dead ends: 691 [2018-02-04 17:44:07,207 INFO L226 Difference]: Without dead ends: 691 [2018-02-04 17:44:07,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4042, Invalid=7514, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 17:44:07,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-02-04 17:44:07,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 638. [2018-02-04 17:44:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-02-04 17:44:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 740 transitions. [2018-02-04 17:44:07,213 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 740 transitions. Word has length 257 [2018-02-04 17:44:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:07,213 INFO L432 AbstractCegarLoop]: Abstraction has 638 states and 740 transitions. [2018-02-04 17:44:07,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 17:44:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 740 transitions. [2018-02-04 17:44:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 17:44:07,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:07,215 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:07,215 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:07,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1700783157, now seen corresponding path program 51 times [2018-02-04 17:44:07,215 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:07,215 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:07,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:07,216 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:07,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:07,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:07,978 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:07,978 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:07,978 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:44:07,999 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-04 17:44:07,999 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:08,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:08,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:08,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-02-04 17:44:08,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 17:44:08,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 17:44:08,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:44:08,037 INFO L87 Difference]: Start difference. First operand 638 states and 740 transitions. Second operand 55 states. [2018-02-04 17:44:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:09,781 INFO L93 Difference]: Finished difference Result 704 states and 809 transitions. [2018-02-04 17:44:09,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 17:44:09,781 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-02-04 17:44:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:09,782 INFO L225 Difference]: With dead ends: 704 [2018-02-04 17:44:09,783 INFO L226 Difference]: Without dead ends: 704 [2018-02-04 17:44:09,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-02-04 17:44:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-02-04 17:44:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 650. [2018-02-04 17:44:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-02-04 17:44:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 754 transitions. [2018-02-04 17:44:09,787 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 754 transitions. Word has length 262 [2018-02-04 17:44:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:09,787 INFO L432 AbstractCegarLoop]: Abstraction has 650 states and 754 transitions. [2018-02-04 17:44:09,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 17:44:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 754 transitions. [2018-02-04 17:44:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-04 17:44:09,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:09,788 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:09,788 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:09,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1946271650, now seen corresponding path program 52 times [2018-02-04 17:44:09,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:09,789 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:09,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:09,789 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:09,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:09,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:10,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:10,567 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:10,567 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:44:10,576 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:44:10,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:10,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:11,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:11,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-02-04 17:44:11,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-02-04 17:44:11,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-02-04 17:44:11,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 17:44:11,361 INFO L87 Difference]: Start difference. First operand 650 states and 754 transitions. Second operand 109 states. [2018-02-04 17:44:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:17,529 INFO L93 Difference]: Finished difference Result 717 states and 824 transitions. [2018-02-04 17:44:17,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 17:44:17,530 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 267 [2018-02-04 17:44:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:17,531 INFO L225 Difference]: With dead ends: 717 [2018-02-04 17:44:17,531 INFO L226 Difference]: Without dead ends: 717 [2018-02-04 17:44:17,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 17:44:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-02-04 17:44:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 662. [2018-02-04 17:44:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-02-04 17:44:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 768 transitions. [2018-02-04 17:44:17,535 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 768 transitions. Word has length 267 [2018-02-04 17:44:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:17,536 INFO L432 AbstractCegarLoop]: Abstraction has 662 states and 768 transitions. [2018-02-04 17:44:17,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-02-04 17:44:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 768 transitions. [2018-02-04 17:44:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-04 17:44:17,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:17,537 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:17,537 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:17,537 INFO L82 PathProgramCache]: Analyzing trace with hash 468719061, now seen corresponding path program 53 times [2018-02-04 17:44:17,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:17,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:17,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:17,537 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:17,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:17,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:18,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:18,365 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:18,366 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:44:18,384 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-02-04 17:44:18,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:18,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:19,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:19,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 109 [2018-02-04 17:44:19,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-02-04 17:44:19,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-02-04 17:44:19,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 17:44:19,283 INFO L87 Difference]: Start difference. First operand 662 states and 768 transitions. Second operand 110 states. [2018-02-04 17:44:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:25,923 INFO L93 Difference]: Finished difference Result 730 states and 839 transitions. [2018-02-04 17:44:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 17:44:25,924 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 272 [2018-02-04 17:44:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:25,925 INFO L225 Difference]: With dead ends: 730 [2018-02-04 17:44:25,925 INFO L226 Difference]: Without dead ends: 730 [2018-02-04 17:44:25,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5619 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-02-04 17:44:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-02-04 17:44:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 674. [2018-02-04 17:44:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-02-04 17:44:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 782 transitions. [2018-02-04 17:44:25,929 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 782 transitions. Word has length 272 [2018-02-04 17:44:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:25,930 INFO L432 AbstractCegarLoop]: Abstraction has 674 states and 782 transitions. [2018-02-04 17:44:25,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-02-04 17:44:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 782 transitions. [2018-02-04 17:44:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 17:44:25,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:25,931 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:25,931 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:25,932 INFO L82 PathProgramCache]: Analyzing trace with hash 502010558, now seen corresponding path program 54 times [2018-02-04 17:44:25,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:25,932 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:25,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:25,932 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:25,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:25,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:26,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:26,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:26,768 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:44:26,785 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-02-04 17:44:26,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:26,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:26,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:26,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 60 [2018-02-04 17:44:26,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 17:44:26,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 17:44:26,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1558, Invalid=2102, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:44:26,995 INFO L87 Difference]: Start difference. First operand 674 states and 782 transitions. Second operand 61 states. [2018-02-04 17:44:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:28,888 INFO L93 Difference]: Finished difference Result 743 states and 854 transitions. [2018-02-04 17:44:28,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 17:44:28,889 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 277 [2018-02-04 17:44:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:28,890 INFO L225 Difference]: With dead ends: 743 [2018-02-04 17:44:28,890 INFO L226 Difference]: Without dead ends: 743 [2018-02-04 17:44:28,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4742, Invalid=8368, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 17:44:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-02-04 17:44:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 686. [2018-02-04 17:44:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-02-04 17:44:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 796 transitions. [2018-02-04 17:44:28,894 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 796 transitions. Word has length 277 [2018-02-04 17:44:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:28,894 INFO L432 AbstractCegarLoop]: Abstraction has 686 states and 796 transitions. [2018-02-04 17:44:28,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 17:44:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 796 transitions. [2018-02-04 17:44:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-02-04 17:44:28,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:28,895 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:28,895 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:28,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1280917643, now seen corresponding path program 55 times [2018-02-04 17:44:28,895 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:28,895 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:28,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:28,896 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:28,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:28,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:29,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:29,724 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:29,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:44:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:29,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:29,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:29,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-02-04 17:44:29,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 17:44:29,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 17:44:29,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:44:29,796 INFO L87 Difference]: Start difference. First operand 686 states and 796 transitions. Second operand 59 states. [2018-02-04 17:44:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:31,609 INFO L93 Difference]: Finished difference Result 756 states and 869 transitions. [2018-02-04 17:44:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 17:44:31,609 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-02-04 17:44:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:31,611 INFO L225 Difference]: With dead ends: 756 [2018-02-04 17:44:31,611 INFO L226 Difference]: Without dead ends: 756 [2018-02-04 17:44:31,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-02-04 17:44:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-04 17:44:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 698. [2018-02-04 17:44:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-02-04 17:44:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 810 transitions. [2018-02-04 17:44:31,617 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 810 transitions. Word has length 282 [2018-02-04 17:44:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:31,617 INFO L432 AbstractCegarLoop]: Abstraction has 698 states and 810 transitions. [2018-02-04 17:44:31,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 17:44:31,617 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 810 transitions. [2018-02-04 17:44:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 17:44:31,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:31,618 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:31,618 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:31,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1543400734, now seen corresponding path program 56 times [2018-02-04 17:44:31,618 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:31,618 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:31,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:31,619 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:44:31,619 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:31,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:32,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:32,581 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:32,582 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:44:32,591 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:44:32,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:32,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:32,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:32,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-02-04 17:44:32,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 17:44:32,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 17:44:32,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 17:44:32,638 INFO L87 Difference]: Start difference. First operand 698 states and 810 transitions. Second operand 60 states. [2018-02-04 17:44:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:35,240 INFO L93 Difference]: Finished difference Result 769 states and 884 transitions. [2018-02-04 17:44:35,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 17:44:35,240 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-02-04 17:44:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:35,242 INFO L225 Difference]: With dead ends: 769 [2018-02-04 17:44:35,242 INFO L226 Difference]: Without dead ends: 769 [2018-02-04 17:44:35,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 17:44:35,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-02-04 17:44:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 710. [2018-02-04 17:44:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-02-04 17:44:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 824 transitions. [2018-02-04 17:44:35,249 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 824 transitions. Word has length 287 [2018-02-04 17:44:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:35,249 INFO L432 AbstractCegarLoop]: Abstraction has 710 states and 824 transitions. [2018-02-04 17:44:35,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 17:44:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 824 transitions. [2018-02-04 17:44:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 17:44:35,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:35,251 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:35,251 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1462902507, now seen corresponding path program 57 times [2018-02-04 17:44:35,251 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:35,251 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:35,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:35,252 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:35,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:35,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:36,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:36,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:36,222 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:44:36,238 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-02-04 17:44:36,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:36,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:37,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:37,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 118 [2018-02-04 17:44:37,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-02-04 17:44:37,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-02-04 17:44:37,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 17:44:37,131 INFO L87 Difference]: Start difference. First operand 710 states and 824 transitions. Second operand 119 states. [2018-02-04 17:44:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:42,610 INFO L93 Difference]: Finished difference Result 782 states and 899 transitions. [2018-02-04 17:44:42,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 17:44:42,611 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 292 [2018-02-04 17:44:42,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:42,612 INFO L225 Difference]: With dead ends: 782 [2018-02-04 17:44:42,612 INFO L226 Difference]: Without dead ends: 782 [2018-02-04 17:44:42,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6611 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 17:44:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-02-04 17:44:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 722. [2018-02-04 17:44:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-02-04 17:44:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 838 transitions. [2018-02-04 17:44:42,618 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 838 transitions. Word has length 292 [2018-02-04 17:44:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:42,618 INFO L432 AbstractCegarLoop]: Abstraction has 722 states and 838 transitions. [2018-02-04 17:44:42,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-02-04 17:44:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 838 transitions. [2018-02-04 17:44:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 17:44:42,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:42,619 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:42,619 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash -399814786, now seen corresponding path program 58 times [2018-02-04 17:44:42,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:42,620 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:42,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:42,620 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:42,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:42,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:43,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:43,625 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:43,625 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:44:43,635 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:44:43,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:43,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:43,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:43,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 66 [2018-02-04 17:44:43,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 17:44:43,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 17:44:43,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1743, Invalid=2679, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 17:44:43,756 INFO L87 Difference]: Start difference. First operand 722 states and 838 transitions. Second operand 67 states. [2018-02-04 17:44:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:46,097 INFO L93 Difference]: Finished difference Result 795 states and 914 transitions. [2018-02-04 17:44:46,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 17:44:46,097 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 297 [2018-02-04 17:44:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:46,098 INFO L225 Difference]: With dead ends: 795 [2018-02-04 17:44:46,098 INFO L226 Difference]: Without dead ends: 795 [2018-02-04 17:44:46,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5387, Invalid=10113, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 17:44:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-02-04 17:44:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 734. [2018-02-04 17:44:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-02-04 17:44:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 852 transitions. [2018-02-04 17:44:46,103 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 852 transitions. Word has length 297 [2018-02-04 17:44:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:46,104 INFO L432 AbstractCegarLoop]: Abstraction has 734 states and 852 transitions. [2018-02-04 17:44:46,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 17:44:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 852 transitions. [2018-02-04 17:44:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-02-04 17:44:46,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:46,105 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:46,105 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:46,105 INFO L82 PathProgramCache]: Analyzing trace with hash 590314165, now seen corresponding path program 59 times [2018-02-04 17:44:46,105 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:46,105 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:46,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:46,105 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:46,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:46,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:47,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:47,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:47,176 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:44:47,195 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-02-04 17:44:47,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:47,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:48,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:48,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61] total 121 [2018-02-04 17:44:48,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-02-04 17:44:48,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-02-04 17:44:48,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2018-02-04 17:44:48,266 INFO L87 Difference]: Start difference. First operand 734 states and 852 transitions. Second operand 122 states. [2018-02-04 17:44:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:44:56,835 INFO L93 Difference]: Finished difference Result 808 states and 929 transitions. [2018-02-04 17:44:56,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 17:44:56,835 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 302 [2018-02-04 17:44:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:44:56,836 INFO L225 Difference]: With dead ends: 808 [2018-02-04 17:44:56,837 INFO L226 Difference]: Without dead ends: 808 [2018-02-04 17:44:56,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6963 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-02-04 17:44:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-02-04 17:44:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 746. [2018-02-04 17:44:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-02-04 17:44:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 866 transitions. [2018-02-04 17:44:56,842 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 866 transitions. Word has length 302 [2018-02-04 17:44:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:44:56,842 INFO L432 AbstractCegarLoop]: Abstraction has 746 states and 866 transitions. [2018-02-04 17:44:56,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-02-04 17:44:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 866 transitions. [2018-02-04 17:44:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 17:44:56,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:44:56,843 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-02-04 17:44:56,843 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:44:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash -387401250, now seen corresponding path program 60 times [2018-02-04 17:44:56,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:44:56,843 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:44:56,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:56,844 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:44:56,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:44:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:44:56,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:44:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:57,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:44:57,904 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:44:57,905 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:44:57,924 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-02-04 17:44:57,924 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:44:57,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:44:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:44:59,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:44:59,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62] total 120 [2018-02-04 17:44:59,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-02-04 17:44:59,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-02-04 17:44:59,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3548, Invalid=10972, Unknown=0, NotChecked=0, Total=14520 [2018-02-04 17:44:59,016 INFO L87 Difference]: Start difference. First operand 746 states and 866 transitions. Second operand 121 states. [2018-02-04 17:45:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:06,634 INFO L93 Difference]: Finished difference Result 821 states and 944 transitions. [2018-02-04 17:45:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 17:45:06,634 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 307 [2018-02-04 17:45:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:06,636 INFO L225 Difference]: With dead ends: 821 [2018-02-04 17:45:06,636 INFO L226 Difference]: Without dead ends: 821 [2018-02-04 17:45:06,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10577 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5803, Invalid=25349, Unknown=0, NotChecked=0, Total=31152 [2018-02-04 17:45:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-02-04 17:45:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 758. [2018-02-04 17:45:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-02-04 17:45:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 880 transitions. [2018-02-04 17:45:06,641 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 880 transitions. Word has length 307 [2018-02-04 17:45:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:06,641 INFO L432 AbstractCegarLoop]: Abstraction has 758 states and 880 transitions. [2018-02-04 17:45:06,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-02-04 17:45:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 880 transitions. [2018-02-04 17:45:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-02-04 17:45:06,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:06,642 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:06,642 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:45:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1776972715, now seen corresponding path program 61 times [2018-02-04 17:45:06,642 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:06,642 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:06,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:06,643 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:06,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:06,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:07,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:07,733 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:07,733 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:07,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:07,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:07,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-02-04 17:45:07,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 17:45:07,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 17:45:07,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:45:07,793 INFO L87 Difference]: Start difference. First operand 758 states and 880 transitions. Second operand 65 states. [2018-02-04 17:45:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:09,920 INFO L93 Difference]: Finished difference Result 834 states and 959 transitions. [2018-02-04 17:45:09,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 17:45:09,920 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-02-04 17:45:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:09,922 INFO L225 Difference]: With dead ends: 834 [2018-02-04 17:45:09,922 INFO L226 Difference]: Without dead ends: 834 [2018-02-04 17:45:09,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-02-04 17:45:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-02-04 17:45:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 770. [2018-02-04 17:45:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-02-04 17:45:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 894 transitions. [2018-02-04 17:45:09,928 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 894 transitions. Word has length 312 [2018-02-04 17:45:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:09,928 INFO L432 AbstractCegarLoop]: Abstraction has 770 states and 894 transitions. [2018-02-04 17:45:09,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 17:45:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 894 transitions. [2018-02-04 17:45:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-02-04 17:45:09,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:09,929 INFO L351 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:09,929 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:45:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1764535358, now seen corresponding path program 62 times [2018-02-04 17:45:09,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:09,930 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:09,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:09,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:09,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:09,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:11,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:11,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:11,027 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:45:11,037 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:45:11,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:11,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:11,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:11,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-02-04 17:45:11,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 17:45:11,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 17:45:11,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:45:11,089 INFO L87 Difference]: Start difference. First operand 770 states and 894 transitions. Second operand 66 states. [2018-02-04 17:45:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:13,733 INFO L93 Difference]: Finished difference Result 847 states and 974 transitions. [2018-02-04 17:45:13,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 17:45:13,733 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-02-04 17:45:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:13,735 INFO L225 Difference]: With dead ends: 847 [2018-02-04 17:45:13,735 INFO L226 Difference]: Without dead ends: 847 [2018-02-04 17:45:13,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-02-04 17:45:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-02-04 17:45:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 782. [2018-02-04 17:45:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-02-04 17:45:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 908 transitions. [2018-02-04 17:45:13,739 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 908 transitions. Word has length 317 [2018-02-04 17:45:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:13,740 INFO L432 AbstractCegarLoop]: Abstraction has 782 states and 908 transitions. [2018-02-04 17:45:13,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 17:45:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 908 transitions. [2018-02-04 17:45:13,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-02-04 17:45:13,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:13,741 INFO L351 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:13,741 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:45:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1615468021, now seen corresponding path program 63 times [2018-02-04 17:45:13,741 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:13,741 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:13,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:13,742 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:13,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:13,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:14,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:14,833 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:14,833 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:45:14,851 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-02-04 17:45:14,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:14,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:15,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:15,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 130 [2018-02-04 17:45:15,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-02-04 17:45:15,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-02-04 17:45:15,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 17:45:15,883 INFO L87 Difference]: Start difference. First operand 782 states and 908 transitions. Second operand 131 states. [2018-02-04 17:45:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:23,441 INFO L93 Difference]: Finished difference Result 860 states and 989 transitions. [2018-02-04 17:45:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 17:45:23,441 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 322 [2018-02-04 17:45:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:23,444 INFO L225 Difference]: With dead ends: 860 [2018-02-04 17:45:23,444 INFO L226 Difference]: Without dead ends: 860 [2018-02-04 17:45:23,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8063 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 17:45:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-02-04 17:45:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 794. [2018-02-04 17:45:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-02-04 17:45:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 922 transitions. [2018-02-04 17:45:23,452 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 922 transitions. Word has length 322 [2018-02-04 17:45:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:23,452 INFO L432 AbstractCegarLoop]: Abstraction has 794 states and 922 transitions. [2018-02-04 17:45:23,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-02-04 17:45:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 922 transitions. [2018-02-04 17:45:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 17:45:23,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:23,454 INFO L351 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:23,454 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:45:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1200806242, now seen corresponding path program 64 times [2018-02-04 17:45:23,454 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:23,454 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:23,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:23,455 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:23,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:23,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:24,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:24,999 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:24,999 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:45:25,010 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:45:25,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:25,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:25,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:25,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-02-04 17:45:25,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 17:45:25,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 17:45:25,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 17:45:25,100 INFO L87 Difference]: Start difference. First operand 794 states and 922 transitions. Second operand 67 states. [2018-02-04 17:45:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:36,884 INFO L93 Difference]: Finished difference Result 873 states and 1004 transitions. [2018-02-04 17:45:36,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 17:45:36,884 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-02-04 17:45:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:36,886 INFO L225 Difference]: With dead ends: 873 [2018-02-04 17:45:36,886 INFO L226 Difference]: Without dead ends: 873 [2018-02-04 17:45:36,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 17:45:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-02-04 17:45:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 806. [2018-02-04 17:45:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-02-04 17:45:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 936 transitions. [2018-02-04 17:45:36,892 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 936 transitions. Word has length 327 [2018-02-04 17:45:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:36,893 INFO L432 AbstractCegarLoop]: Abstraction has 806 states and 936 transitions. [2018-02-04 17:45:36,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 17:45:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 936 transitions. [2018-02-04 17:45:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-02-04 17:45:36,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:36,894 INFO L351 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:36,894 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:45:36,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1813452693, now seen corresponding path program 65 times [2018-02-04 17:45:36,894 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:36,894 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:36,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:36,895 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:45:36,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:36,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:38,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:38,169 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:38,170 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:45:38,195 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-02-04 17:45:38,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:45:38,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:39,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:45:39,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 133 [2018-02-04 17:45:39,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-02-04 17:45:39,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-02-04 17:45:39,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4555, Invalid=13267, Unknown=0, NotChecked=0, Total=17822 [2018-02-04 17:45:39,490 INFO L87 Difference]: Start difference. First operand 806 states and 936 transitions. Second operand 134 states. Received shutdown request... [2018-02-04 17:45:40,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:45:40,470 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:45:40,474 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:45:40,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:45:40 BoogieIcfgContainer [2018-02-04 17:45:40,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:45:40,475 INFO L168 Benchmark]: Toolchain (without parser) took 179875.47 ms. Allocated memory was 403.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 361.1 MB in the beginning and 2.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 294.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:45:40,476 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 403.2 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:45:40,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 125.45 ms. Allocated memory is still 403.2 MB. Free memory was 361.1 MB in the beginning and 353.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:45:40,476 INFO L168 Benchmark]: Boogie Preprocessor took 18.03 ms. Allocated memory is still 403.2 MB. Free memory was 353.0 MB in the beginning and 351.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:45:40,477 INFO L168 Benchmark]: RCFGBuilder took 124.09 ms. Allocated memory is still 403.2 MB. Free memory was 351.7 MB in the beginning and 338.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:45:40,477 INFO L168 Benchmark]: TraceAbstraction took 179605.60 ms. Allocated memory was 403.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 338.5 MB in the beginning and 2.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 271.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:45:40,478 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.10 ms. Allocated memory is still 403.2 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 125.45 ms. Allocated memory is still 403.2 MB. Free memory was 361.1 MB in the beginning and 353.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 18.03 ms. Allocated memory is still 403.2 MB. Free memory was 353.0 MB in the beginning and 351.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 124.09 ms. Allocated memory is still 403.2 MB. Free memory was 351.7 MB in the beginning and 338.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 179605.60 ms. Allocated memory was 403.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 338.5 MB in the beginning and 2.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 271.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (806states) and interpolant automaton (currently 12 states, 134 states before enhancement), while ReachableStatesComputation was computing reachable states (79 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (806states) and interpolant automaton (currently 12 states, 134 states before enhancement), while ReachableStatesComputation was computing reachable states (79 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (806states) and interpolant automaton (currently 12 states, 134 states before enhancement), while ReachableStatesComputation was computing reachable states (79 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (806states) and interpolant automaton (currently 12 states, 134 states before enhancement), while ReachableStatesComputation was computing reachable states (79 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (806states) and interpolant automaton (currently 12 states, 134 states before enhancement), while ReachableStatesComputation was computing reachable states (79 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (806states) and interpolant automaton (currently 12 states, 134 states before enhancement), while ReachableStatesComputation was computing reachable states (79 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. TIMEOUT Result, 179.5s OverallTime, 66 OverallIterations, 66 TraceHistogramMax, 133.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6841 SDtfs, 71370 SDslu, 109236 SDs, 0 SdLazy, 416108 SolverSat, 26562 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 84.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14836 GetRequests, 10411 SyntacticMatches, 7 SemanticMatches, 4418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101670 ImplicationChecksByTransitivity, 56.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=806occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 65 MinimizatonAttempts, 2275 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 42.6s InterpolantComputationTime, 22367 NumberOfCodeBlocks, 22367 NumberOfCodeBlocksAsserted, 1231 NumberOfCheckSat, 22236 ConstructedInterpolants, 0 QuantifiedInterpolants, 18664230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 24505 ConjunctsInSsa, 3236 ConjunctsInUnsatCore, 131 InterpolantComputations, 1 PerfectInterpolantSequences, 0/466180 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-45-40-485.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-45-40-485.csv Completed graceful shutdown