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_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:04:15,551 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:04:15,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:04:15,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:04:15,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:04:15,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:04:15,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:04:15,568 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:04:15,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:04:15,570 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:04:15,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:04:15,571 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:04:15,572 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:04:15,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:04:15,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:04:15,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:04:15,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:04:15,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:04:15,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:04:15,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:04:15,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:04:15,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:04:15,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:04:15,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:04:15,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:04:15,586 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:04:15,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:04:15,586 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:04:15,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:04:15,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:04:15,587 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:04:15,587 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:04:15,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:04:15,597 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:04:15,597 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:04:15,598 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:04:15,598 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:04:15,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:04:15,598 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:04:15,598 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:04:15,598 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:04:15,598 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:04:15,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:04:15,598 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:04:15,599 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:04:15,599 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:04:15,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:04:15,599 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:04:15,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:04:15,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:04:15,599 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:04:15,599 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:04:15,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:04:15,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:04:15,600 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:04:15,600 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:04:15,600 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:04:15,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:04:15,634 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:04:15,636 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:04:15,637 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:04:15,637 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:04:15,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-02-04 04:04:15,724 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:04:15,725 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:04:15,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:04:15,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:04:15,729 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:04:15,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:04:15" (1/1) ... [2018-02-04 04:04:15,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1089cf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15, skipping insertion in model container [2018-02-04 04:04:15,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:04:15" (1/1) ... [2018-02-04 04:04:15,743 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:04:15,754 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:04:15,854 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:04:15,863 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:04:15,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15 WrapperNode [2018-02-04 04:04:15,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:04:15,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:04:15,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:04:15,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:04:15,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15" (1/1) ... [2018-02-04 04:04:15,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15" (1/1) ... [2018-02-04 04:04:15,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15" (1/1) ... [2018-02-04 04:04:15,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15" (1/1) ... [2018-02-04 04:04:15,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15" (1/1) ... [2018-02-04 04:04:15,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15" (1/1) ... [2018-02-04 04:04:15,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15" (1/1) ... [2018-02-04 04:04:15,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:04:15,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:04:15,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:04:15,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:04:15,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:04:15,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:04:15,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:04:15,929 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 04:04:15,930 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:04:15,930 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 04:04:15,930 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 04:04:15,930 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:04:15,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:04:15,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:04:16,031 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:04:16,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:04:16 BoogieIcfgContainer [2018-02-04 04:04:16,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:04:16,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:04:16,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:04:16,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:04:16,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:04:15" (1/3) ... [2018-02-04 04:04:16,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af8ecf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:04:16, skipping insertion in model container [2018-02-04 04:04:16,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:15" (2/3) ... [2018-02-04 04:04:16,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af8ecf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:04:16, skipping insertion in model container [2018-02-04 04:04:16,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:04:16" (3/3) ... [2018-02-04 04:04:16,037 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-02-04 04:04:16,042 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:04:16,047 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 04:04:16,073 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:04:16,073 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:04:16,073 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:04:16,074 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:04:16,074 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:04:16,074 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:04:16,074 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:04:16,074 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:04:16,075 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:04:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-02-04 04:04:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 04:04:16,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:16,092 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:16,092 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:16,095 INFO L82 PathProgramCache]: Analyzing trace with hash -42218404, now seen corresponding path program 1 times [2018-02-04 04:04:16,097 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:16,097 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:16,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,132 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:16,132 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:16,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:16,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:04:16,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:04:16,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:04:16,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:04:16,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:04:16,221 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-02-04 04:04:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:16,273 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 04:04:16,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:04:16,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 04:04:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:16,279 INFO L225 Difference]: With dead ends: 49 [2018-02-04 04:04:16,280 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 04:04:16,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:04:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 04:04:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-02-04 04:04:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 04:04:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-04 04:04:16,308 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 7 [2018-02-04 04:04:16,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:16,309 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-04 04:04:16,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:04:16,309 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-04 04:04:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 04:04:16,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:16,309 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:16,310 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash -207595369, now seen corresponding path program 1 times [2018-02-04 04:04:16,310 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:16,310 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:16,311 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,311 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:16,311 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:16,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:16,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:16,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:16,419 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:16,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:16,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:16,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-04 04:04:16,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:04:16,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:04:16,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:04:16,451 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2018-02-04 04:04:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:16,491 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 04:04:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:04:16,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 04:04:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:16,493 INFO L225 Difference]: With dead ends: 54 [2018-02-04 04:04:16,493 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 04:04:16,494 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 04:04:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 04:04:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2018-02-04 04:04:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 04:04:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-02-04 04:04:16,498 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 12 [2018-02-04 04:04:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:16,498 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-02-04 04:04:16,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:04:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-02-04 04:04:16,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 04:04:16,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:16,498 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:16,499 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:16,499 INFO L82 PathProgramCache]: Analyzing trace with hash -209255178, now seen corresponding path program 1 times [2018-02-04 04:04:16,499 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:16,499 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:16,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,500 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:16,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:16,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:16,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:04:16,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:04:16,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:04:16,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:04:16,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:04:16,536 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2018-02-04 04:04:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:16,555 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 04:04:16,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:04:16,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 04:04:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:16,556 INFO L225 Difference]: With dead ends: 39 [2018-02-04 04:04:16,556 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 04:04:16,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:04:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 04:04:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 04:04:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 04:04:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 04:04:16,558 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 12 [2018-02-04 04:04:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:16,559 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 04:04:16,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:04:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 04:04:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:04:16,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:16,559 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:16,560 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2132883772, now seen corresponding path program 2 times [2018-02-04 04:04:16,560 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:16,560 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:16,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,561 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:16,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:16,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:16,638 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 04:04:16,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:16,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:16,639 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:16,649 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:16,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:16,651 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:16,657 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 04:04:16,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:16,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-04 04:04:16,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:04:16,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:04:16,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:04:16,659 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 04:04:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:16,742 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-04 04:04:16,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:04:16,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:04:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:16,743 INFO L225 Difference]: With dead ends: 59 [2018-02-04 04:04:16,743 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 04:04:16,744 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 04:04:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 04:04:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-02-04 04:04:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 04:04:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 04:04:16,748 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 17 [2018-02-04 04:04:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:16,749 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 04:04:16,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:04:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 04:04:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:04:16,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:16,750 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:16,750 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:16,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2131223963, now seen corresponding path program 1 times [2018-02-04 04:04:16,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:16,750 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:16,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,751 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:16,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:16,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:04:16,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:04:16,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:04:16,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:04:16,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:04:16,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:04:16,772 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-02-04 04:04:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:16,788 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-04 04:04:16,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:04:16,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 04:04:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:16,789 INFO L225 Difference]: With dead ends: 47 [2018-02-04 04:04:16,789 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 04:04:16,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:04:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 04:04:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-02-04 04:04:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 04:04:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-04 04:04:16,794 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 17 [2018-02-04 04:04:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:16,794 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-04 04:04:16,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:04:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-04 04:04:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:04:16,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:16,795 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:16,795 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:16,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2059138999, now seen corresponding path program 3 times [2018-02-04 04:04:16,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:16,795 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:16,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,796 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:16,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:16,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:16,845 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 04:04:16,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:16,845 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:16,846 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:16,855 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 04:04:16,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:16,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:16,866 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 04:04:16,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:16,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 04:04:16,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:04:16,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:04:16,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:04:16,867 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-02-04 04:04:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:16,961 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-04 04:04:16,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:04:16,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 04:04:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:16,963 INFO L225 Difference]: With dead ends: 89 [2018-02-04 04:04:16,963 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 04:04:16,963 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 04:04:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 04:04:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2018-02-04 04:04:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 04:04:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 04:04:16,967 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 22 [2018-02-04 04:04:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:16,968 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 04:04:16,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:04:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 04:04:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:04:16,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:16,969 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:16,969 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash -6617899, now seen corresponding path program 1 times [2018-02-04 04:04:16,969 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:16,969 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:16,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,970 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:16,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:16,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:17,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:17,022 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:17,023 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:17,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:17,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:17,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 04:04:17,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:04:17,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:04:17,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:04:17,054 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 8 states. [2018-02-04 04:04:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:17,130 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-04 04:04:17,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:04:17,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-04 04:04:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:17,131 INFO L225 Difference]: With dead ends: 59 [2018-02-04 04:04:17,131 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 04:04:17,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:04:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 04:04:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 04:04:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 04:04:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 04:04:17,134 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2018-02-04 04:04:17,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:17,138 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 04:04:17,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:04:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 04:04:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:04:17,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:17,139 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:17,139 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:17,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1173615076, now seen corresponding path program 4 times [2018-02-04 04:04:17,139 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:17,139 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:17,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,140 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:17,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:17,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:17,219 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 04:04:17,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:17,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:17,220 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:17,231 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:17,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:17,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:17,257 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 04:04:17,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:17,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 04:04:17,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:04:17,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:04:17,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:04:17,258 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-02-04 04:04:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:17,376 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-04 04:04:17,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:04:17,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 04:04:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:17,377 INFO L225 Difference]: With dead ends: 94 [2018-02-04 04:04:17,377 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 04:04:17,377 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 04:04:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 04:04:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-02-04 04:04:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 04:04:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-04 04:04:17,381 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-02-04 04:04:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:17,382 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-04 04:04:17,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:04:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-04 04:04:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:04:17,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:17,383 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:17,383 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:17,383 INFO L82 PathProgramCache]: Analyzing trace with hash 155329936, now seen corresponding path program 2 times [2018-02-04 04:04:17,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:17,384 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:17,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,384 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:17,385 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:17,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 04:04:17,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:17,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:17,424 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:17,432 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:17,432 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:17,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 04:04:17,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:17,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-04 04:04:17,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:04:17,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:04:17,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:04:17,442 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-02-04 04:04:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:17,476 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-02-04 04:04:17,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:04:17,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 04:04:17,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:17,477 INFO L225 Difference]: With dead ends: 55 [2018-02-04 04:04:17,477 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 04:04:17,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:04:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 04:04:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 04:04:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 04:04:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-04 04:04:17,480 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-02-04 04:04:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:17,480 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-04 04:04:17,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:04:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-04 04:04:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:04:17,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:17,481 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:17,486 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1011667241, now seen corresponding path program 5 times [2018-02-04 04:04:17,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:17,486 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:17,487 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,487 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:17,487 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:17,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:17,539 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 04:04:17,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:17,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:17,540 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:17,549 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 04:04:17,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:17,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:17,605 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 04:04:17,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:17,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-02-04 04:04:17,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:04:17,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:04:17,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:04:17,607 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2018-02-04 04:04:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:17,707 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 04:04:17,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:04:17,708 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-02-04 04:04:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:17,708 INFO L225 Difference]: With dead ends: 43 [2018-02-04 04:04:17,709 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 04:04:17,709 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 04:04:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 04:04:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 04:04:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 04:04:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-04 04:04:17,712 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-02-04 04:04:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:17,712 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-04 04:04:17,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:04:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-04 04:04:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 04:04:17,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:17,713 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:17,713 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2070263044, now seen corresponding path program 6 times [2018-02-04 04:04:17,713 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:17,713 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:17,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,714 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:17,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:17,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:17,787 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 04:04:17,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:17,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:17,788 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:17,796 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 04:04:17,796 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:17,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:17,832 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 04:04:17,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:17,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-02-04 04:04:17,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:04:17,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:04:17,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:04:17,833 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 13 states. [2018-02-04 04:04:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:17,957 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-04 04:04:17,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:04:17,958 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 04:04:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:17,958 INFO L225 Difference]: With dead ends: 48 [2018-02-04 04:04:17,958 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 04:04:17,959 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 04:04:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 04:04:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 04:04:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 04:04:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-04 04:04:17,961 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-02-04 04:04:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:17,961 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-04 04:04:17,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:04:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-04 04:04:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:04:17,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:17,963 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:17,963 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:17,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1122500087, now seen corresponding path program 7 times [2018-02-04 04:04:17,963 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:17,963 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:17,964 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,964 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:17,964 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:17,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:18,022 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 04:04:18,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:18,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:18,024 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:18,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:18,039 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 04:04:18,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:18,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 04:04:18,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:04:18,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:04:18,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:04:18,041 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-02-04 04:04:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:18,155 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-04 04:04:18,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:04:18,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-04 04:04:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:18,156 INFO L225 Difference]: With dead ends: 53 [2018-02-04 04:04:18,156 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 04:04:18,156 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 04:04:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 04:04:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 04:04:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 04:04:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-04 04:04:18,159 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-02-04 04:04:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:18,159 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-04 04:04:18,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:04:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-04 04:04:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 04:04:18,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:18,161 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:18,161 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:18,161 INFO L82 PathProgramCache]: Analyzing trace with hash -676728868, now seen corresponding path program 8 times [2018-02-04 04:04:18,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:18,161 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:18,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:18,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:18,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:18,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:18,264 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 04:04:18,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:18,265 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:18,265 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:18,273 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:18,273 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:18,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:18,296 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 04:04:18,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:18,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 04:04:18,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:04:18,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:04:18,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:04:18,298 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 11 states. [2018-02-04 04:04:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:18,455 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-04 04:04:18,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:04:18,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 04:04:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:18,456 INFO L225 Difference]: With dead ends: 58 [2018-02-04 04:04:18,456 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 04:04:18,456 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 04:04:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 04:04:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 04:04:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 04:04:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-04 04:04:18,458 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 47 [2018-02-04 04:04:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:18,458 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-04 04:04:18,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:04:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-04 04:04:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 04:04:18,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:18,459 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:18,460 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:18,460 INFO L82 PathProgramCache]: Analyzing trace with hash -633576169, now seen corresponding path program 9 times [2018-02-04 04:04:18,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:18,460 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:18,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:18,461 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:18,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:18,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:18,539 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 04:04:18,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:18,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:18,540 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:18,548 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 04:04:18,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:18,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:18,671 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 04:04:18,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:18,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 04:04:18,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:04:18,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:04:18,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:04:18,672 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 23 states. [2018-02-04 04:04:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:18,908 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-04 04:04:18,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:04:18,908 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-04 04:04:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:18,908 INFO L225 Difference]: With dead ends: 63 [2018-02-04 04:04:18,909 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 04:04:18,909 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 04:04:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 04:04:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 04:04:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 04:04:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-02-04 04:04:18,911 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-02-04 04:04:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:18,912 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-02-04 04:04:18,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:04:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-02-04 04:04:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 04:04:18,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:18,913 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:18,913 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1365705540, now seen corresponding path program 10 times [2018-02-04 04:04:18,913 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:18,913 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:18,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:18,914 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:18,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:18,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:18,990 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 04:04:18,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:18,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:18,991 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:18,998 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:18,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:19,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:19,010 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 04:04:19,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:19,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-02-04 04:04:19,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:04:19,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:04:19,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:04:19,012 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-02-04 04:04:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:19,142 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-02-04 04:04:19,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:04:19,142 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-02-04 04:04:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:19,143 INFO L225 Difference]: With dead ends: 68 [2018-02-04 04:04:19,143 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 04:04:19,144 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 04:04:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 04:04:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 04:04:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 04:04:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-04 04:04:19,147 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 57 [2018-02-04 04:04:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:19,147 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-04 04:04:19,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:04:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-04 04:04:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 04:04:19,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:19,148 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:19,148 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:19,148 INFO L82 PathProgramCache]: Analyzing trace with hash -116235209, now seen corresponding path program 11 times [2018-02-04 04:04:19,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:19,149 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:19,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:19,150 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:19,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:19,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:19,237 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 04:04:19,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:19,237 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:19,238 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:19,249 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 04:04:19,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:19,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:19,372 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 04:04:19,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:19,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-02-04 04:04:19,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:04:19,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:04:19,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:04:19,374 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2018-02-04 04:04:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:19,709 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-02-04 04:04:19,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:04:19,710 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-04 04:04:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:19,710 INFO L225 Difference]: With dead ends: 73 [2018-02-04 04:04:19,710 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 04:04:19,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:04:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 04:04:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 04:04:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 04:04:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-02-04 04:04:19,713 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-02-04 04:04:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:19,713 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-02-04 04:04:19,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:04:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-02-04 04:04:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 04:04:19,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:19,714 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:19,714 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:19,714 INFO L82 PathProgramCache]: Analyzing trace with hash -414879332, now seen corresponding path program 12 times [2018-02-04 04:04:19,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:19,715 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:19,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:19,715 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:19,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:19,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:19,829 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 04:04:19,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:19,829 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:19,830 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:19,844 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 04:04:19,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:19,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:19,966 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 04:04:19,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:19,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-02-04 04:04:19,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:04:19,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:04:19,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:04:19,967 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 29 states. [2018-02-04 04:04:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:20,284 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-02-04 04:04:20,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:04:20,284 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-02-04 04:04:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:20,285 INFO L225 Difference]: With dead ends: 78 [2018-02-04 04:04:20,285 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 04:04:20,285 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 04:04:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 04:04:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 04:04:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 04:04:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-02-04 04:04:20,287 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 67 [2018-02-04 04:04:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:20,287 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-02-04 04:04:20,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:04:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-02-04 04:04:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 04:04:20,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:20,287 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:20,288 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1135871145, now seen corresponding path program 13 times [2018-02-04 04:04:20,288 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:20,288 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:20,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:20,288 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:20,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:20,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:20,415 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 04:04:20,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:20,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:20,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:20,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:20,453 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 04:04:20,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:20,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-02-04 04:04:20,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:04:20,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:04:20,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:04:20,454 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 17 states. [2018-02-04 04:04:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:20,664 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-02-04 04:04:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:04:20,664 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-04 04:04:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:20,664 INFO L225 Difference]: With dead ends: 83 [2018-02-04 04:04:20,664 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 04:04:20,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:04:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 04:04:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 04:04:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 04:04:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-02-04 04:04:20,667 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-02-04 04:04:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:20,667 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-02-04 04:04:20,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:04:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-02-04 04:04:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 04:04:20,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:20,668 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:20,668 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:20,668 INFO L82 PathProgramCache]: Analyzing trace with hash 571297404, now seen corresponding path program 14 times [2018-02-04 04:04:20,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:20,669 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:20,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:20,669 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:20,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:20,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:20,787 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 04:04:20,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:20,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:20,789 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:20,796 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:20,796 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:20,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:20,813 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 04:04:20,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:20,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-02-04 04:04:20,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:04:20,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:04:20,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:04:20,814 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 18 states. [2018-02-04 04:04:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:20,996 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-02-04 04:04:21,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:04:21,027 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-04 04:04:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:21,028 INFO L225 Difference]: With dead ends: 88 [2018-02-04 04:04:21,028 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 04:04:21,028 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 04:04:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 04:04:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-04 04:04:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 04:04:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-02-04 04:04:21,030 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 77 [2018-02-04 04:04:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:21,030 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-02-04 04:04:21,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:04:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-02-04 04:04:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 04:04:21,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:21,031 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:21,031 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash 239807095, now seen corresponding path program 15 times [2018-02-04 04:04:21,031 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:21,031 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:21,031 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:21,031 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:21,031 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:21,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:21,150 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 04:04:21,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:21,150 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:21,151 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:21,162 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 04:04:21,162 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:21,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:21,284 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 04:04:21,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:21,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-02-04 04:04:21,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:04:21,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:04:21,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:04:21,285 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 35 states. [2018-02-04 04:04:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:21,570 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-02-04 04:04:21,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:04:21,570 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-02-04 04:04:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:21,570 INFO L225 Difference]: With dead ends: 93 [2018-02-04 04:04:21,571 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 04:04:21,571 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 04:04:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 04:04:21,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 04:04:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 04:04:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-02-04 04:04:21,572 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-02-04 04:04:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:21,573 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-02-04 04:04:21,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:04:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-02-04 04:04:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 04:04:21,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:21,573 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:21,573 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:21,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1580297380, now seen corresponding path program 16 times [2018-02-04 04:04:21,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:21,574 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:21,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:21,574 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:21,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:21,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:21,715 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 04:04:21,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:21,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:21,716 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:21,723 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:21,723 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:21,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:21,744 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 04:04:21,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:21,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-02-04 04:04:21,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:04:21,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:04:21,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:04:21,745 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 19 states. [2018-02-04 04:04:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:22,094 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-02-04 04:04:22,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:04:22,094 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-04 04:04:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:22,094 INFO L225 Difference]: With dead ends: 98 [2018-02-04 04:04:22,094 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 04:04:22,095 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 04:04:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 04:04:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-04 04:04:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 04:04:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-02-04 04:04:22,096 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 87 [2018-02-04 04:04:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:22,097 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-02-04 04:04:22,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:04:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-02-04 04:04:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 04:04:22,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:22,097 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:22,097 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash -957222505, now seen corresponding path program 17 times [2018-02-04 04:04:22,098 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:22,098 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:22,098 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:22,098 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:22,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:22,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:22,246 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 04:04:22,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:22,246 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:22,247 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:22,261 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 04:04:22,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:22,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:22,417 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 04:04:22,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:22,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-02-04 04:04:22,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:04:22,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:04:22,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:04:22,418 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 37 states. [2018-02-04 04:04:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:22,827 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-02-04 04:04:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:04:22,827 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 92 [2018-02-04 04:04:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:22,828 INFO L225 Difference]: With dead ends: 103 [2018-02-04 04:04:22,828 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 04:04:22,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=610, Invalid=2252, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:04:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 04:04:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-02-04 04:04:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 04:04:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-02-04 04:04:22,830 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-02-04 04:04:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:22,831 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-02-04 04:04:22,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:04:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-02-04 04:04:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 04:04:22,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:22,831 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:22,831 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash 736575548, now seen corresponding path program 18 times [2018-02-04 04:04:22,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:22,831 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:22,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:22,832 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:22,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:22,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:23,016 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 04:04:23,016 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:23,016 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:23,017 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:23,028 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 04:04:23,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:23,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:23,251 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 04:04:23,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:23,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-02-04 04:04:23,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:04:23,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:04:23,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:04:23,253 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 41 states. [2018-02-04 04:04:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:23,788 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-02-04 04:04:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:04:23,788 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 97 [2018-02-04 04:04:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:23,789 INFO L225 Difference]: With dead ends: 108 [2018-02-04 04:04:23,789 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 04:04:23,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:04:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 04:04:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-04 04:04:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 04:04:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-02-04 04:04:23,792 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 97 [2018-02-04 04:04:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:23,792 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-02-04 04:04:23,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:04:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-02-04 04:04:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 04:04:23,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:23,793 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:23,793 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash -878554953, now seen corresponding path program 19 times [2018-02-04 04:04:23,794 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:23,794 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:23,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:23,794 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:23,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:23,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:23,953 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 04:04:23,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:23,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:23,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:23,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:23,974 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 04:04:23,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:23,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-02-04 04:04:23,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:04:23,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:04:23,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:04:23,975 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 23 states. [2018-02-04 04:04:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:24,254 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-02-04 04:04:24,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:04:24,254 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-02-04 04:04:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:24,255 INFO L225 Difference]: With dead ends: 113 [2018-02-04 04:04:24,255 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 04:04:24,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:04:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 04:04:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 04:04:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:04:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-02-04 04:04:24,258 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-02-04 04:04:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:24,258 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-02-04 04:04:24,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:04:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-02-04 04:04:24,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 04:04:24,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:24,258 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:24,258 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:24,259 INFO L82 PathProgramCache]: Analyzing trace with hash -399157988, now seen corresponding path program 20 times [2018-02-04 04:04:24,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:24,259 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:24,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:24,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:24,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:24,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:24,461 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 04:04:24,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:24,461 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:24,462 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:24,469 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:24,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:24,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:24,487 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 04:04:24,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:24,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-02-04 04:04:24,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:04:24,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:04:24,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:04:24,488 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 24 states. [2018-02-04 04:04:24,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:24,848 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-02-04 04:04:24,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:04:24,848 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-02-04 04:04:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:24,849 INFO L225 Difference]: With dead ends: 118 [2018-02-04 04:04:24,849 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 04:04:24,849 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:04:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 04:04:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-04 04:04:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 04:04:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-02-04 04:04:24,851 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 107 [2018-02-04 04:04:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:24,851 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-02-04 04:04:24,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:04:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-02-04 04:04:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 04:04:24,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:24,851 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:24,851 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:24,852 INFO L82 PathProgramCache]: Analyzing trace with hash 792610775, now seen corresponding path program 21 times [2018-02-04 04:04:24,852 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:24,852 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:24,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:24,853 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:24,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:24,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:25,027 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 04:04:25,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:25,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:25,027 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:25,039 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 04:04:25,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:25,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:25,055 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 04:04:25,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:25,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-02-04 04:04:25,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:04:25,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:04:25,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:04:25,056 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 25 states. [2018-02-04 04:04:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:25,344 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-02-04 04:04:25,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 04:04:25,344 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-04 04:04:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:25,345 INFO L225 Difference]: With dead ends: 123 [2018-02-04 04:04:25,345 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 04:04:25,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 04:04:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 04:04:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 04:04:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 04:04:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-02-04 04:04:25,347 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-02-04 04:04:25,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:25,347 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-02-04 04:04:25,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:04:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-02-04 04:04:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 04:04:25,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:25,347 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:25,347 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:25,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1092014588, now seen corresponding path program 22 times [2018-02-04 04:04:25,348 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:25,348 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:25,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:25,348 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:25,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:25,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:25,626 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 04:04:25,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:25,627 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:25,627 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:25,637 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:25,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:25,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:25,673 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 04:04:25,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:25,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-02-04 04:04:25,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:04:25,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:04:25,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:04:25,675 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 26 states. [2018-02-04 04:04:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:26,113 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-02-04 04:04:26,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:04:26,135 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-04 04:04:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:26,136 INFO L225 Difference]: With dead ends: 128 [2018-02-04 04:04:26,136 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 04:04:26,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 04:04:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 04:04:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 04:04:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 04:04:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-02-04 04:04:26,139 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 117 [2018-02-04 04:04:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:26,139 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-02-04 04:04:26,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 04:04:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-02-04 04:04:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 04:04:26,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:26,140 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:26,140 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1378342647, now seen corresponding path program 23 times [2018-02-04 04:04:26,141 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:26,141 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:26,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:26,141 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:26,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:26,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:26,339 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 04:04:26,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:26,340 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:26,340 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:26,350 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 04:04:26,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:26,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:26,725 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 04:04:26,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:26,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-04 04:04:26,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 04:04:26,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 04:04:26,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=1729, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:04:26,727 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 49 states. [2018-02-04 04:04:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:27,632 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-02-04 04:04:27,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:04:27,632 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 122 [2018-02-04 04:04:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:27,633 INFO L225 Difference]: With dead ends: 133 [2018-02-04 04:04:27,633 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 04:04:27,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1033, Invalid=4079, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 04:04:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 04:04:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-02-04 04:04:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 04:04:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-02-04 04:04:27,635 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-02-04 04:04:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:27,635 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-02-04 04:04:27,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 04:04:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-02-04 04:04:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 04:04:27,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:27,636 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:27,636 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:27,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1016482084, now seen corresponding path program 24 times [2018-02-04 04:04:27,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:27,636 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:27,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:27,637 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:27,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:27,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:27,860 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 04:04:27,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:27,860 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:27,861 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:27,870 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 04:04:27,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:27,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:28,035 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 04:04:28,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:28,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 36 [2018-02-04 04:04:28,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:04:28,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:04:28,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:04:28,036 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 37 states. [2018-02-04 04:04:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:28,625 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-02-04 04:04:28,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:04:28,625 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-02-04 04:04:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:28,626 INFO L225 Difference]: With dead ends: 138 [2018-02-04 04:04:28,626 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 04:04:28,626 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 04:04:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 04:04:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-04 04:04:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 04:04:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-02-04 04:04:28,628 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 127 [2018-02-04 04:04:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:28,629 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-02-04 04:04:28,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:04:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-02-04 04:04:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 04:04:28,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:28,630 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:28,630 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:28,630 INFO L82 PathProgramCache]: Analyzing trace with hash 37813783, now seen corresponding path program 25 times [2018-02-04 04:04:28,630 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:28,630 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:28,631 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:28,631 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:28,631 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:28,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:28,864 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 04:04:28,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:28,865 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:28,865 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:28,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:28,897 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 04:04:28,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:28,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-02-04 04:04:28,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:04:28,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:04:28,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:04:28,899 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 29 states. [2018-02-04 04:04:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:29,224 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-02-04 04:04:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:04:29,224 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-02-04 04:04:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:29,224 INFO L225 Difference]: With dead ends: 143 [2018-02-04 04:04:29,225 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 04:04:29,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:04:29,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 04:04:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-04 04:04:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 04:04:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-02-04 04:04:29,227 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-02-04 04:04:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:29,227 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-02-04 04:04:29,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:04:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-02-04 04:04:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 04:04:29,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:29,227 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:29,228 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash -24378436, now seen corresponding path program 26 times [2018-02-04 04:04:29,228 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:29,228 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:29,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:29,228 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:29,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:29,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:29,485 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 04:04:29,485 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:29,485 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:29,485 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:29,493 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:29,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:29,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:29,520 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 04:04:29,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:29,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-02-04 04:04:29,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 04:04:29,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 04:04:29,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:04:29,522 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 30 states. [2018-02-04 04:04:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:29,901 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-02-04 04:04:29,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:04:29,901 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-02-04 04:04:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:29,902 INFO L225 Difference]: With dead ends: 148 [2018-02-04 04:04:29,902 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 04:04:29,902 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 04:04:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 04:04:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-04 04:04:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 04:04:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-02-04 04:04:29,904 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 137 [2018-02-04 04:04:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:29,905 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-02-04 04:04:29,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 04:04:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-02-04 04:04:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 04:04:29,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:29,906 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:29,906 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:29,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1695826633, now seen corresponding path program 27 times [2018-02-04 04:04:29,906 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:29,906 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:29,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:29,906 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:29,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:29,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:30,149 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 04:04:30,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:30,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:30,149 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:30,159 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 04:04:30,159 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:30,161 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:30,175 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 04:04:30,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:30,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-02-04 04:04:30,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 04:04:30,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 04:04:30,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:04:30,176 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 31 states. [2018-02-04 04:04:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:30,546 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-02-04 04:04:30,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 04:04:30,546 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-02-04 04:04:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:30,547 INFO L225 Difference]: With dead ends: 153 [2018-02-04 04:04:30,547 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 04:04:30,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 04:04:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 04:04:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-04 04:04:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-04 04:04:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-02-04 04:04:30,550 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-02-04 04:04:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:30,550 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-02-04 04:04:30,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 04:04:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-02-04 04:04:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 04:04:30,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:30,551 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:30,551 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:30,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1683732636, now seen corresponding path program 28 times [2018-02-04 04:04:30,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:30,552 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:30,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:30,552 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:30,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:30,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:30,959 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 04:04:30,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:30,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:30,960 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:30,966 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:30,966 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:30,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:31,266 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 04:04:31,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:31,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2018-02-04 04:04:31,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 04:04:31,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 04:04:31,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:04:31,267 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 61 states. [2018-02-04 04:04:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:32,342 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-02-04 04:04:32,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:04:32,342 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 147 [2018-02-04 04:04:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:32,342 INFO L225 Difference]: With dead ends: 158 [2018-02-04 04:04:32,343 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 04:04:32,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:04:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 04:04:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-04 04:04:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 04:04:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-02-04 04:04:32,346 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 147 [2018-02-04 04:04:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:32,346 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-02-04 04:04:32,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 04:04:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-02-04 04:04:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-04 04:04:32,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:32,347 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:32,347 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 621417559, now seen corresponding path program 29 times [2018-02-04 04:04:32,348 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:32,348 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:32,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:32,348 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:32,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:32,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:32,656 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 04:04:32,656 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:32,656 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:32,657 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:32,670 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 04:04:32,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:32,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:32,983 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 04:04:32,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:32,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-02-04 04:04:32,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 04:04:32,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 04:04:32,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=959, Invalid=2701, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:04:32,985 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 61 states. [2018-02-04 04:04:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:34,100 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-02-04 04:04:34,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:04:34,100 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 152 [2018-02-04 04:04:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:34,101 INFO L225 Difference]: With dead ends: 163 [2018-02-04 04:04:34,101 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 04:04:34,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2681 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1564, Invalid=6446, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 04:04:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 04:04:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-04 04:04:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 04:04:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-02-04 04:04:34,104 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-02-04 04:04:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:34,105 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-02-04 04:04:34,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 04:04:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-02-04 04:04:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 04:04:34,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:34,106 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:34,106 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash 691459452, now seen corresponding path program 30 times [2018-02-04 04:04:34,106 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:34,106 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:34,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:34,107 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:34,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:34,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:34,478 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 04:04:34,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:34,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:34,479 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:34,497 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 04:04:34,497 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:34,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:34,579 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 04:04:34,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:34,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-02-04 04:04:34,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:04:34,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:04:34,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=818, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:04:34,581 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 37 states. [2018-02-04 04:04:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:35,073 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-02-04 04:04:35,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 04:04:35,073 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-02-04 04:04:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:35,073 INFO L225 Difference]: With dead ends: 168 [2018-02-04 04:04:35,073 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 04:04:35,074 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 04:04:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 04:04:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-02-04 04:04:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 04:04:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-02-04 04:04:35,077 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 157 [2018-02-04 04:04:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:35,077 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-02-04 04:04:35,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:04:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-02-04 04:04:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 04:04:35,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:35,078 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:35,078 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1996358519, now seen corresponding path program 31 times [2018-02-04 04:04:35,078 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:35,078 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:35,079 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:35,079 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:35,079 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:35,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:35,426 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 04:04:35,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:35,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:35,426 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:35,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:35,465 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 04:04:35,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:35,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 04:04:35,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:04:35,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:04:35,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:04:35,466 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 35 states. [2018-02-04 04:04:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:35,977 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-02-04 04:04:35,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 04:04:35,977 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-02-04 04:04:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:35,978 INFO L225 Difference]: With dead ends: 173 [2018-02-04 04:04:35,978 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 04:04:35,979 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 04:04:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 04:04:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-02-04 04:04:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 04:04:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-02-04 04:04:35,982 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-02-04 04:04:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:35,983 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-02-04 04:04:35,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:04:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-02-04 04:04:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 04:04:35,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:35,984 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:35,984 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash 603675228, now seen corresponding path program 32 times [2018-02-04 04:04:35,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:35,984 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:35,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:35,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:35,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:35,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:36,455 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 04:04:36,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:36,455 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:36,456 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:36,462 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:36,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:36,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:36,497 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 04:04:36,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:36,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 04:04:36,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:04:36,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:04:36,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:04:36,499 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 35 states. [2018-02-04 04:04:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:37,566 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-02-04 04:04:37,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 04:04:37,566 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-04 04:04:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:37,567 INFO L225 Difference]: With dead ends: 178 [2018-02-04 04:04:37,567 INFO L226 Difference]: Without dead ends: 178 [2018-02-04 04:04:37,567 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 04:04:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-04 04:04:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-04 04:04:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 04:04:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-02-04 04:04:37,570 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 167 [2018-02-04 04:04:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:37,570 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-02-04 04:04:37,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:04:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-02-04 04:04:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 04:04:37,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:37,571 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:37,571 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:37,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1420397207, now seen corresponding path program 33 times [2018-02-04 04:04:37,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:37,572 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:37,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:37,572 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:37,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:37,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:37,994 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 04:04:37,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:37,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:37,995 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:38,007 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 04:04:38,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:38,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:38,042 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 04:04:38,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:38,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-02-04 04:04:38,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:04:38,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:04:38,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:04:38,044 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 37 states. [2018-02-04 04:04:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:38,715 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-02-04 04:04:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 04:04:38,715 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-02-04 04:04:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:38,716 INFO L225 Difference]: With dead ends: 183 [2018-02-04 04:04:38,716 INFO L226 Difference]: Without dead ends: 183 [2018-02-04 04:04:38,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 04:04:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-04 04:04:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-04 04:04:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 04:04:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-02-04 04:04:38,718 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-02-04 04:04:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:38,718 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-02-04 04:04:38,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:04:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-02-04 04:04:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 04:04:38,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:38,719 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:38,719 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1375254724, now seen corresponding path program 34 times [2018-02-04 04:04:38,719 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:38,719 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:38,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:38,720 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:38,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:38,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:39,130 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 04:04:39,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:39,131 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:39,131 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:39,143 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:39,143 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:39,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:39,191 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 04:04:39,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:39,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-02-04 04:04:39,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 04:04:39,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 04:04:39,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:04:39,193 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 38 states. [2018-02-04 04:04:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:39,914 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-02-04 04:04:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 04:04:39,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-02-04 04:04:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:39,915 INFO L225 Difference]: With dead ends: 188 [2018-02-04 04:04:39,915 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 04:04:39,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 04:04:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 04:04:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-02-04 04:04:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 04:04:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-02-04 04:04:39,917 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 177 [2018-02-04 04:04:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:39,917 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-02-04 04:04:39,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 04:04:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-02-04 04:04:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 04:04:39,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:39,918 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:39,918 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1888573001, now seen corresponding path program 35 times [2018-02-04 04:04:39,918 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:39,918 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:39,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:39,919 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:39,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:39,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:40,412 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 04:04:40,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:40,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:40,413 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:40,452 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 04:04:40,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:40,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:40,917 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 04:04:40,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:40,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 72 [2018-02-04 04:04:40,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 04:04:40,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 04:04:40,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1367, Invalid=3889, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 04:04:40,919 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 73 states. [2018-02-04 04:04:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:42,785 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-02-04 04:04:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:04:42,785 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 182 [2018-02-04 04:04:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:42,786 INFO L225 Difference]: With dead ends: 193 [2018-02-04 04:04:42,786 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 04:04:42,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3968 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2203, Invalid=9353, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 04:04:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 04:04:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-04 04:04:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 04:04:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-02-04 04:04:42,789 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-02-04 04:04:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:42,789 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-02-04 04:04:42,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 04:04:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-02-04 04:04:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 04:04:42,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:42,790 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:42,790 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2093442020, now seen corresponding path program 36 times [2018-02-04 04:04:42,791 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:42,791 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:42,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:42,791 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:42,792 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:42,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:43,201 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 04:04:43,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:43,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:43,202 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:43,220 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 04:04:43,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:43,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:43,369 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 04:04:43,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:43,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-02-04 04:04:43,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 04:04:43,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 04:04:43,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1244, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:04:43,370 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 45 states. [2018-02-04 04:04:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:44,076 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-02-04 04:04:44,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:04:44,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-02-04 04:04:44,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:44,077 INFO L225 Difference]: With dead ends: 198 [2018-02-04 04:04:44,077 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 04:04:44,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2205, Invalid=4275, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 04:04:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 04:04:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-02-04 04:04:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 04:04:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-02-04 04:04:44,080 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 187 [2018-02-04 04:04:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:44,080 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-02-04 04:04:44,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 04:04:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-02-04 04:04:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 04:04:44,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:44,080 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:44,080 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:44,081 INFO L82 PathProgramCache]: Analyzing trace with hash 640639191, now seen corresponding path program 37 times [2018-02-04 04:04:44,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:44,081 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:44,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:44,081 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:44,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:44,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:44,568 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 04:04:44,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:44,568 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:44,568 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:44,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:44,597 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 04:04:44,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:44,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-02-04 04:04:44,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:04:44,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:04:44,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:04:44,598 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 41 states. [2018-02-04 04:04:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:45,192 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-02-04 04:04:45,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 04:04:45,193 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-02-04 04:04:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:45,193 INFO L225 Difference]: With dead ends: 203 [2018-02-04 04:04:45,193 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 04:04:45,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 04:04:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 04:04:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-02-04 04:04:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 04:04:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-02-04 04:04:45,195 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-02-04 04:04:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:45,195 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-02-04 04:04:45,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:04:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-02-04 04:04:45,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 04:04:45,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:45,196 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:45,196 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:45,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1578280708, now seen corresponding path program 38 times [2018-02-04 04:04:45,196 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:45,196 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:45,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:45,197 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:45,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:45,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:45,615 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 04:04:45,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:45,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:45,615 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:45,622 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:45,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:45,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:45,651 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 04:04:45,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:45,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-02-04 04:04:45,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 04:04:45,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 04:04:45,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:04:45,652 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 42 states. [2018-02-04 04:04:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:46,286 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-02-04 04:04:46,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 04:04:46,287 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-02-04 04:04:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:46,287 INFO L225 Difference]: With dead ends: 208 [2018-02-04 04:04:46,287 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 04:04:46,288 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 04:04:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 04:04:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-04 04:04:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 04:04:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-02-04 04:04:46,290 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 197 [2018-02-04 04:04:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:46,290 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-02-04 04:04:46,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 04:04:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-02-04 04:04:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 04:04:46,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:46,291 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:46,291 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:46,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1699590135, now seen corresponding path program 39 times [2018-02-04 04:04:46,291 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:46,291 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:46,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:46,291 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:46,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:46,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:46,749 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 04:04:46,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:46,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:46,750 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:46,767 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 04:04:46,767 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:46,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:46,811 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 04:04:46,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:46,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-02-04 04:04:46,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 04:04:46,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 04:04:46,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 04:04:46,812 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 43 states. [2018-02-04 04:04:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:47,462 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-02-04 04:04:47,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 04:04:47,462 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-02-04 04:04:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:47,463 INFO L225 Difference]: With dead ends: 213 [2018-02-04 04:04:47,463 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 04:04:47,464 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 04:04:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 04:04:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-02-04 04:04:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 04:04:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-02-04 04:04:47,465 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-02-04 04:04:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:47,465 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-02-04 04:04:47,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 04:04:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-02-04 04:04:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 04:04:47,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:47,466 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:47,466 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:47,466 INFO L82 PathProgramCache]: Analyzing trace with hash 721649116, now seen corresponding path program 40 times [2018-02-04 04:04:47,466 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:47,466 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:47,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:47,467 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:47,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:47,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:47,932 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 04:04:47,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:47,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:47,933 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:47,940 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:47,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:47,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:47,968 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 04:04:47,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:47,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-02-04 04:04:47,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 04:04:47,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 04:04:47,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:04:47,969 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 44 states. [2018-02-04 04:04:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:48,994 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-02-04 04:04:48,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 04:04:48,994 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-02-04 04:04:48,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:48,995 INFO L225 Difference]: With dead ends: 218 [2018-02-04 04:04:48,995 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 04:04:48,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 04:04:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 04:04:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-04 04:04:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 04:04:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-02-04 04:04:48,998 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 207 [2018-02-04 04:04:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:48,998 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-02-04 04:04:48,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 04:04:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-02-04 04:04:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 04:04:48,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:48,999 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:48,999 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:48,999 INFO L82 PathProgramCache]: Analyzing trace with hash 111908631, now seen corresponding path program 41 times [2018-02-04 04:04:48,999 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:49,000 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:49,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:49,000 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:49,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:49,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:49,506 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 04:04:49,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:49,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:49,506 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:49,522 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 04:04:49,522 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:49,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:50,126 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 04:04:50,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:50,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-02-04 04:04:50,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-02-04 04:04:50,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-02-04 04:04:50,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1847, Invalid=5293, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 04:04:50,128 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 85 states. [2018-02-04 04:04:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:52,393 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-02-04 04:04:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 04:04:52,393 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 212 [2018-02-04 04:04:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:52,393 INFO L225 Difference]: With dead ends: 223 [2018-02-04 04:04:52,393 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 04:04:52,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5507 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2950, Invalid=12800, Unknown=0, NotChecked=0, Total=15750 [2018-02-04 04:04:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 04:04:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-02-04 04:04:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 04:04:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-02-04 04:04:52,396 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-02-04 04:04:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:52,396 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-02-04 04:04:52,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-02-04 04:04:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-02-04 04:04:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 04:04:52,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:52,397 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:52,397 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1104743100, now seen corresponding path program 42 times [2018-02-04 04:04:52,397 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:52,397 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:52,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:52,397 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:52,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:52,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:52,912 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 04:04:52,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:52,912 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:52,913 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:52,925 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 04:04:52,926 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:52,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:53,039 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 04:04:53,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:53,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 48 [2018-02-04 04:04:53,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 04:04:53,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 04:04:53,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=1388, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:04:53,040 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 49 states. [2018-02-04 04:04:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:53,761 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-02-04 04:04:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 04:04:53,761 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-02-04 04:04:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:53,762 INFO L225 Difference]: With dead ends: 228 [2018-02-04 04:04:53,762 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 04:04:53,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2936, Invalid=5254, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 04:04:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 04:04:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-02-04 04:04:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 04:04:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-02-04 04:04:53,766 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 217 [2018-02-04 04:04:53,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:53,766 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-02-04 04:04:53,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 04:04:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-02-04 04:04:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-04 04:04:53,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:53,767 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:53,768 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:53,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1370166839, now seen corresponding path program 43 times [2018-02-04 04:04:53,768 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:53,768 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:53,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:53,768 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:53,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:53,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:54,283 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 04:04:54,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:54,283 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:54,284 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:54,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:54,317 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 04:04:54,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:54,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-02-04 04:04:54,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 04:04:54,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 04:04:54,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:04:54,318 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 47 states. [2018-02-04 04:04:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:55,019 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-02-04 04:04:55,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 04:04:55,019 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-02-04 04:04:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:55,020 INFO L225 Difference]: With dead ends: 233 [2018-02-04 04:04:55,020 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 04:04:55,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 04:04:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 04:04:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-02-04 04:04:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 04:04:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-02-04 04:04:55,023 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-02-04 04:04:55,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:55,023 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-02-04 04:04:55,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 04:04:55,023 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-02-04 04:04:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 04:04:55,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:55,024 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:55,024 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:55,025 INFO L82 PathProgramCache]: Analyzing trace with hash -330563684, now seen corresponding path program 44 times [2018-02-04 04:04:55,025 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:55,025 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:55,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:55,025 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:55,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:55,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:55,553 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 04:04:55,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:55,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:55,554 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:55,561 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:55,562 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:55,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:55,757 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 04:04:55,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:55,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-02-04 04:04:55,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 04:04:55,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 04:04:55,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 04:04:55,758 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 55 states. [2018-02-04 04:04:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:56,863 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-02-04 04:04:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 04:04:56,863 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2018-02-04 04:04:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:56,864 INFO L225 Difference]: With dead ends: 238 [2018-02-04 04:04:56,864 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 04:04:56,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3077, Invalid=6625, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 04:04:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 04:04:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-04 04:04:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 04:04:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-02-04 04:04:56,866 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 227 [2018-02-04 04:04:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:56,866 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-02-04 04:04:56,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 04:04:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-02-04 04:04:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 04:04:56,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:56,867 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:56,867 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:56,867 INFO L82 PathProgramCache]: Analyzing trace with hash 992882007, now seen corresponding path program 45 times [2018-02-04 04:04:56,868 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:56,868 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:56,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:56,868 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:56,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:56,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:57,448 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 04:04:57,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:57,448 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:57,449 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:57,462 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 04:04:57,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:57,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:57,515 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 04:04:57,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:57,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-02-04 04:04:57,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 04:04:57,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 04:04:57,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:04:57,517 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 49 states. [2018-02-04 04:04:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:58,281 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-02-04 04:04:58,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 04:04:58,281 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-02-04 04:04:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:58,282 INFO L225 Difference]: With dead ends: 243 [2018-02-04 04:04:58,282 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 04:04:58,282 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 04:04:58,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 04:04:58,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-02-04 04:04:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 04:04:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-02-04 04:04:58,284 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-02-04 04:04:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:58,284 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-02-04 04:04:58,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 04:04:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-02-04 04:04:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 04:04:58,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:58,285 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:58,285 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash -222667652, now seen corresponding path program 46 times [2018-02-04 04:04:58,286 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:58,286 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:58,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:58,286 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:58,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:58,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:58,904 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 04:04:58,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:58,942 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:58,942 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:58,950 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:58,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:58,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:58,981 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 04:04:58,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:58,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-02-04 04:04:58,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 04:04:58,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 04:04:58,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 04:04:58,982 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 50 states. [2018-02-04 04:04:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:59,917 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-02-04 04:04:59,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 04:04:59,917 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-02-04 04:04:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:59,918 INFO L225 Difference]: With dead ends: 248 [2018-02-04 04:04:59,918 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 04:04:59,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 04:04:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 04:04:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-02-04 04:04:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 04:04:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-02-04 04:04:59,921 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 237 [2018-02-04 04:04:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:59,921 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-02-04 04:04:59,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 04:04:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-02-04 04:04:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-04 04:04:59,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:59,922 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:59,922 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:59,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2053710729, now seen corresponding path program 47 times [2018-02-04 04:04:59,922 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:59,922 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:59,923 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:59,923 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:59,923 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:59,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:00,580 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 04:05:00,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:00,581 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:00,581 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:05:00,598 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 04:05:00,598 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:00,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:01,325 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 04:05:01,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:01,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 96 [2018-02-04 04:05:01,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-02-04 04:05:01,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-02-04 04:05:01,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2399, Invalid=6913, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 04:05:01,327 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 97 states. [2018-02-04 04:05:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:04,881 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-02-04 04:05:04,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 04:05:04,882 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 242 [2018-02-04 04:05:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:04,882 INFO L225 Difference]: With dead ends: 253 [2018-02-04 04:05:04,882 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 04:05:04,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7298 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3805, Invalid=16787, Unknown=0, NotChecked=0, Total=20592 [2018-02-04 04:05:04,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 04:05:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-02-04 04:05:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-04 04:05:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-02-04 04:05:04,886 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-02-04 04:05:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:04,886 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-02-04 04:05:04,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-02-04 04:05:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-02-04 04:05:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-04 04:05:04,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:04,887 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:04,887 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1073602212, now seen corresponding path program 48 times [2018-02-04 04:05:04,888 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:04,888 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:04,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:04,888 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:04,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:04,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:05,526 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 04:05:05,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:05,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:05,527 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:05:05,542 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 04:05:05,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:05,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:05,962 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 04:05:05,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:05,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 68 [2018-02-04 04:05:05,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 04:05:05,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 04:05:05,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=3260, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 04:05:05,964 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 69 states. [2018-02-04 04:05:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:07,813 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-02-04 04:05:07,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 04:05:07,813 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-02-04 04:05:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:07,814 INFO L225 Difference]: With dead ends: 258 [2018-02-04 04:05:07,814 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 04:05:07,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3855, Invalid=9717, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 04:05:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 04:05:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-02-04 04:05:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-04 04:05:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-02-04 04:05:07,816 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 247 [2018-02-04 04:05:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:07,816 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-02-04 04:05:07,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 04:05:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-02-04 04:05:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-04 04:05:07,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:07,817 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:07,817 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash -523820137, now seen corresponding path program 49 times [2018-02-04 04:05:07,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:07,817 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:07,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:07,818 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:07,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:07,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:08,498 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 04:05:08,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:08,499 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:08,499 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:05:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:08,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:08,539 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 04:05:08,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:08,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-02-04 04:05:08,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:05:08,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:05:08,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:05:08,541 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 53 states. [2018-02-04 04:05:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:09,446 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-02-04 04:05:09,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 04:05:09,447 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-02-04 04:05:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:09,447 INFO L225 Difference]: With dead ends: 263 [2018-02-04 04:05:09,447 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 04:05:09,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 04:05:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 04:05:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-02-04 04:05:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 04:05:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-02-04 04:05:09,450 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-02-04 04:05:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:09,450 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-02-04 04:05:09,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:05:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-02-04 04:05:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 04:05:09,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:09,451 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:09,451 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:09,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1098993212, now seen corresponding path program 50 times [2018-02-04 04:05:09,451 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:09,451 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:09,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:09,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:05:09,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:09,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:10,147 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 04:05:10,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:10,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:10,148 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:05:10,156 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:05:10,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:10,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:10,260 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 04:05:10,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:10,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-02-04 04:05:10,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 04:05:10,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 04:05:10,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 04:05:10,261 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 58 states. [2018-02-04 04:05:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:11,320 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-02-04 04:05:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 04:05:11,399 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 257 [2018-02-04 04:05:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:11,400 INFO L225 Difference]: With dead ends: 268 [2018-02-04 04:05:11,400 INFO L226 Difference]: Without dead ends: 268 [2018-02-04 04:05:11,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4042, Invalid=7514, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 04:05:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-04 04:05:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-02-04 04:05:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 04:05:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-02-04 04:05:11,402 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 257 [2018-02-04 04:05:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:11,402 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-02-04 04:05:11,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 04:05:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-02-04 04:05:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 04:05:11,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:11,403 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:11,403 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash 169935543, now seen corresponding path program 51 times [2018-02-04 04:05:11,403 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:11,403 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:11,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:11,404 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:11,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:11,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:12,172 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 04:05:12,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:12,173 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:12,173 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:05:12,186 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-04 04:05:12,186 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:12,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:12,224 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 04:05:12,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:12,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-02-04 04:05:12,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 04:05:12,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 04:05:12,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 04:05:12,225 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 55 states. [2018-02-04 04:05:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:13,240 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-02-04 04:05:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 04:05:13,240 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-02-04 04:05:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:13,241 INFO L225 Difference]: With dead ends: 273 [2018-02-04 04:05:13,241 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 04:05:13,241 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 04:05:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 04:05:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-02-04 04:05:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-04 04:05:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-02-04 04:05:13,243 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-02-04 04:05:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:13,243 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-02-04 04:05:13,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 04:05:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-02-04 04:05:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-04 04:05:13,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:13,244 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:13,244 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash -954866916, now seen corresponding path program 52 times [2018-02-04 04:05:13,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:13,244 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:13,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:13,245 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:13,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:13,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:14,048 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 04:05:14,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:14,048 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:14,049 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:05:14,057 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:05:14,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:14,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:14,875 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 04:05:14,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:14,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-02-04 04:05:14,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-02-04 04:05:14,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-02-04 04:05:14,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 04:05:14,876 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 109 states. [2018-02-04 04:05:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:17,444 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-02-04 04:05:17,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 04:05:17,444 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 267 [2018-02-04 04:05:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:17,445 INFO L225 Difference]: With dead ends: 278 [2018-02-04 04:05:17,445 INFO L226 Difference]: Without dead ends: 278 [2018-02-04 04:05:17,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 04:05:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-04 04:05:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-02-04 04:05:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-04 04:05:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-02-04 04:05:17,447 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 267 [2018-02-04 04:05:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:17,447 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-02-04 04:05:17,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-02-04 04:05:17,447 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-02-04 04:05:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-04 04:05:17,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:17,448 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:17,448 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:17,448 INFO L82 PathProgramCache]: Analyzing trace with hash -326731305, now seen corresponding path program 53 times [2018-02-04 04:05:17,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:17,449 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:17,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:17,449 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:17,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:17,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:18,255 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 04:05:18,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:18,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:18,256 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:05:18,273 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-02-04 04:05:18,273 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:18,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:19,161 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 04:05:19,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:19,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-02-04 04:05:19,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-02-04 04:05:19,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-02-04 04:05:19,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3023, Invalid=8749, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 04:05:19,188 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 109 states. [2018-02-04 04:05:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:22,837 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-02-04 04:05:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 04:05:22,837 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 272 [2018-02-04 04:05:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:22,838 INFO L225 Difference]: With dead ends: 283 [2018-02-04 04:05:22,838 INFO L226 Difference]: Without dead ends: 283 [2018-02-04 04:05:22,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9341 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4768, Invalid=21314, Unknown=0, NotChecked=0, Total=26082 [2018-02-04 04:05:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-04 04:05:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-02-04 04:05:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 04:05:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-02-04 04:05:22,841 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-02-04 04:05:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:22,841 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-02-04 04:05:22,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-02-04 04:05:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-02-04 04:05:22,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 04:05:22,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:22,842 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:22,842 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:22,842 INFO L82 PathProgramCache]: Analyzing trace with hash -484581380, now seen corresponding path program 54 times [2018-02-04 04:05:22,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:22,842 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:22,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:22,843 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:22,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:22,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:23,699 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 04:05:23,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:23,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:23,699 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:05:23,724 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-02-04 04:05:23,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:23,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:23,855 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 04:05:23,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:23,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 60 [2018-02-04 04:05:23,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 04:05:23,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 04:05:23,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1558, Invalid=2102, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:05:23,856 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 61 states. [2018-02-04 04:05:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:25,018 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-02-04 04:05:25,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 04:05:25,019 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 277 [2018-02-04 04:05:25,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:25,019 INFO L225 Difference]: With dead ends: 288 [2018-02-04 04:05:25,019 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 04:05:25,020 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 04:05:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 04:05:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-02-04 04:05:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 04:05:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-02-04 04:05:25,021 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 277 [2018-02-04 04:05:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:25,021 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-02-04 04:05:25,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 04:05:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-02-04 04:05:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-02-04 04:05:25,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:25,022 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:25,022 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:25,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1067874057, now seen corresponding path program 55 times [2018-02-04 04:05:25,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:25,023 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:25,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:25,023 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:25,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:25,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:25,839 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 04:05:25,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:25,840 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:25,840 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:05:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:25,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:25,935 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 04:05:25,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:25,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-02-04 04:05:25,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 04:05:25,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 04:05:25,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:05:25,936 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 59 states. [2018-02-04 04:05:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:26,976 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-02-04 04:05:26,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 04:05:26,976 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-02-04 04:05:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:26,977 INFO L225 Difference]: With dead ends: 293 [2018-02-04 04:05:26,977 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 04:05:26,978 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 04:05:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 04:05:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-02-04 04:05:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-04 04:05:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-02-04 04:05:26,980 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-02-04 04:05:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:26,980 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-02-04 04:05:26,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 04:05:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-02-04 04:05:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 04:05:26,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:26,982 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:26,982 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:26,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1249330396, now seen corresponding path program 56 times [2018-02-04 04:05:26,982 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:26,982 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:26,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:26,983 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:05:26,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:26,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:27,882 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 04:05:27,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:27,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:27,882 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:05:27,891 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:05:27,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:27,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:27,938 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 04:05:27,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:27,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-02-04 04:05:27,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 04:05:27,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 04:05:27,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:05:27,940 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 60 states. [2018-02-04 04:05:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:29,706 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-02-04 04:05:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 04:05:29,706 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-02-04 04:05:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:29,707 INFO L225 Difference]: With dead ends: 298 [2018-02-04 04:05:29,707 INFO L226 Difference]: Without dead ends: 298 [2018-02-04 04:05:29,707 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 04:05:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-04 04:05:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-02-04 04:05:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-04 04:05:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-02-04 04:05:29,709 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 287 [2018-02-04 04:05:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:29,709 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-02-04 04:05:29,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 04:05:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-02-04 04:05:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 04:05:29,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:29,710 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:29,710 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:29,710 INFO L82 PathProgramCache]: Analyzing trace with hash 729559063, now seen corresponding path program 57 times [2018-02-04 04:05:29,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:29,710 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:29,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:29,711 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:29,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:29,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:30,624 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 04:05:30,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:30,624 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:30,624 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:05:30,639 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-02-04 04:05:30,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:30,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:31,449 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 04:05:31,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:31,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 118 [2018-02-04 04:05:31,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-02-04 04:05:31,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-02-04 04:05:31,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 04:05:31,451 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 119 states. [2018-02-04 04:05:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:34,153 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-02-04 04:05:34,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 04:05:34,153 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 292 [2018-02-04 04:05:34,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:34,154 INFO L225 Difference]: With dead ends: 303 [2018-02-04 04:05:34,154 INFO L226 Difference]: Without dead ends: 303 [2018-02-04 04:05:34,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6611 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 04:05:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-04 04:05:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-02-04 04:05:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 04:05:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-02-04 04:05:34,157 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 292 [2018-02-04 04:05:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:34,157 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-02-04 04:05:34,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-02-04 04:05:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-02-04 04:05:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 04:05:34,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:34,158 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:34,158 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:34,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1266675268, now seen corresponding path program 58 times [2018-02-04 04:05:34,158 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:34,158 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:34,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:34,159 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:34,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:34,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:35,102 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 04:05:35,103 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:35,103 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:35,103 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:05:35,116 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:05:35,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:35,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:35,257 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 04:05:35,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:35,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 66 [2018-02-04 04:05:35,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 04:05:35,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 04:05:35,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1743, Invalid=2679, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 04:05:35,258 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 67 states. [2018-02-04 04:05:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:36,686 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-02-04 04:05:36,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 04:05:36,686 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 297 [2018-02-04 04:05:36,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:36,687 INFO L225 Difference]: With dead ends: 308 [2018-02-04 04:05:36,687 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 04:05:36,688 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 04:05:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 04:05:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-02-04 04:05:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 04:05:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-02-04 04:05:36,690 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 297 [2018-02-04 04:05:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:36,690 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-02-04 04:05:36,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 04:05:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-02-04 04:05:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-02-04 04:05:36,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:36,691 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:36,691 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:36,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1632661303, now seen corresponding path program 59 times [2018-02-04 04:05:36,691 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:36,691 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:36,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:36,692 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:36,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:36,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:37,736 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 04:05:37,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:37,737 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:37,737 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:05:37,757 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-02-04 04:05:37,757 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:37,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:38,820 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 04:05:38,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:38,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61] total 120 [2018-02-04 04:05:38,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-02-04 04:05:38,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-02-04 04:05:38,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3719, Invalid=10801, Unknown=0, NotChecked=0, Total=14520 [2018-02-04 04:05:38,822 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 121 states. [2018-02-04 04:05:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:43,569 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-02-04 04:05:43,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 04:05:43,569 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 302 [2018-02-04 04:05:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:43,570 INFO L225 Difference]: With dead ends: 313 [2018-02-04 04:05:43,570 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 04:05:43,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11636 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5839, Invalid=26381, Unknown=0, NotChecked=0, Total=32220 [2018-02-04 04:05:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 04:05:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-02-04 04:05:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-02-04 04:05:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-02-04 04:05:43,573 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 302 [2018-02-04 04:05:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:43,573 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-02-04 04:05:43,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-02-04 04:05:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-02-04 04:05:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 04:05:43,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:43,574 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:43,574 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:43,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1156168036, now seen corresponding path program 60 times [2018-02-04 04:05:43,574 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:43,574 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:43,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:43,575 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:43,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:43,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:44,585 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 04:05:44,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:44,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:44,585 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:05:44,606 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-02-04 04:05:44,606 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:44,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:45,652 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 04:05:45,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:45,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62] total 117 [2018-02-04 04:05:45,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-02-04 04:05:45,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-02-04 04:05:45,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3359, Invalid=10447, Unknown=0, NotChecked=0, Total=13806 [2018-02-04 04:05:45,654 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 118 states. [2018-02-04 04:05:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:51,062 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-02-04 04:05:51,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 04:05:51,062 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 307 [2018-02-04 04:05:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:51,063 INFO L225 Difference]: With dead ends: 318 [2018-02-04 04:05:51,063 INFO L226 Difference]: Without dead ends: 318 [2018-02-04 04:05:51,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10275 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5808, Invalid=25698, Unknown=0, NotChecked=0, Total=31506 [2018-02-04 04:05:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-04 04:05:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-02-04 04:05:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-04 04:05:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-02-04 04:05:51,066 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 307 [2018-02-04 04:05:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:51,066 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-02-04 04:05:51,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-02-04 04:05:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-02-04 04:05:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-02-04 04:05:51,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:51,067 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:51,067 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:51,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1119372887, now seen corresponding path program 61 times [2018-02-04 04:05:51,067 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:51,068 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:51,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:51,068 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:51,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:51,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:52,113 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 04:05:52,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:52,114 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:52,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:05:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:52,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:52,171 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 04:05:52,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:52,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-02-04 04:05:52,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 04:05:52,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 04:05:52,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:05:52,172 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 65 states. [2018-02-04 04:05:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:53,464 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-02-04 04:05:53,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 04:05:53,464 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-02-04 04:05:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:53,465 INFO L225 Difference]: With dead ends: 323 [2018-02-04 04:05:53,465 INFO L226 Difference]: Without dead ends: 323 [2018-02-04 04:05:53,466 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 04:05:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-04 04:05:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-02-04 04:05:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-04 04:05:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-02-04 04:05:53,468 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 312 [2018-02-04 04:05:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:53,468 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-02-04 04:05:53,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 04:05:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-02-04 04:05:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-02-04 04:05:53,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:53,469 INFO L351 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:53,469 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:53,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1164450948, now seen corresponding path program 62 times [2018-02-04 04:05:53,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:53,469 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:53,469 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:53,470 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:05:53,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:53,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:54,585 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 04:05:54,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:54,586 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:54,586 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:05:54,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:05:54,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:54,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:54,658 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 04:05:54,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:54,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-02-04 04:05:54,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 04:05:54,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 04:05:54,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 04:05:54,659 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 66 states. [2018-02-04 04:05:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:56,150 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-02-04 04:05:56,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 04:05:56,151 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-02-04 04:05:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:56,152 INFO L225 Difference]: With dead ends: 328 [2018-02-04 04:05:56,152 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 04:05:56,152 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 04:05:56,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 04:05:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-02-04 04:05:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 04:05:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-02-04 04:05:56,154 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 317 [2018-02-04 04:05:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:56,154 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-02-04 04:05:56,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 04:05:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-02-04 04:05:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-02-04 04:05:56,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:56,155 INFO L351 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:56,155 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2115351927, now seen corresponding path program 63 times [2018-02-04 04:05:56,156 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:56,156 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:56,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:56,156 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:56,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:56,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:57,402 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 04:05:57,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:57,403 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:57,403 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:05:57,424 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-02-04 04:05:57,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:57,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:58,491 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 04:05:58,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:58,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 130 [2018-02-04 04:05:58,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-02-04 04:05:58,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-02-04 04:05:58,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 04:05:58,493 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 131 states. [2018-02-04 04:06:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:02,982 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-02-04 04:06:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 04:06:02,983 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 322 [2018-02-04 04:06:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:02,983 INFO L225 Difference]: With dead ends: 333 [2018-02-04 04:06:02,983 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 04:06:02,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8063 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 04:06:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 04:06:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-02-04 04:06:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-04 04:06:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-02-04 04:06:02,985 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 322 [2018-02-04 04:06:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:02,985 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-02-04 04:06:02,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-02-04 04:06:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-02-04 04:06:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 04:06:02,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:02,986 INFO L351 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:02,986 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1310529444, now seen corresponding path program 64 times [2018-02-04 04:06:02,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:02,987 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:02,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:02,987 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:02,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:02,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:04,498 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 04:06:04,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:04,498 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:04,499 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:06:04,509 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:06:04,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:04,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:04,599 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 04:06:04,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:04,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-02-04 04:06:04,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 04:06:04,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 04:06:04,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 04:06:04,600 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 67 states. [2018-02-04 04:06:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:08,632 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-02-04 04:06:08,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 04:06:08,633 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-02-04 04:06:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:08,633 INFO L225 Difference]: With dead ends: 338 [2018-02-04 04:06:08,634 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 04:06:08,634 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 04:06:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 04:06:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-02-04 04:06:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 04:06:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-02-04 04:06:08,636 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 327 [2018-02-04 04:06:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:08,636 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-02-04 04:06:08,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 04:06:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-02-04 04:06:08,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-02-04 04:06:08,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:08,637 INFO L351 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:08,637 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:08,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1354056553, now seen corresponding path program 65 times [2018-02-04 04:06:08,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:08,637 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:08,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:08,637 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:08,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:08,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:09,837 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 04:06:09,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:09,837 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:09,838 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:06:09,863 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-02-04 04:06:09,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:09,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:11,173 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 04:06:11,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:11,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 132 [2018-02-04 04:06:11,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-02-04 04:06:11,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-02-04 04:06:11,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4487, Invalid=13069, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 04:06:11,175 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 133 states. [2018-02-04 04:06:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:16,925 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-02-04 04:06:16,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 04:06:16,925 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 332 [2018-02-04 04:06:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:16,926 INFO L225 Difference]: With dead ends: 343 [2018-02-04 04:06:16,926 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 04:06:16,927 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14183 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7018, Invalid=31988, Unknown=0, NotChecked=0, Total=39006 [2018-02-04 04:06:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 04:06:16,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-02-04 04:06:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 04:06:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-02-04 04:06:16,929 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 332 [2018-02-04 04:06:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:16,929 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-02-04 04:06:16,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-02-04 04:06:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-02-04 04:06:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-04 04:06:16,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:16,930 INFO L351 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:16,930 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:16,930 INFO L82 PathProgramCache]: Analyzing trace with hash 576017724, now seen corresponding path program 66 times [2018-02-04 04:06:16,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:16,930 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:16,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:16,931 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:16,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:16,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:18,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:18,132 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:18,133 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:06:18,153 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-02-04 04:06:18,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:18,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:19,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:19,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 68] total 136 [2018-02-04 04:06:19,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-02-04 04:06:19,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-02-04 04:06:19,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4692, Invalid=13940, Unknown=0, NotChecked=0, Total=18632 [2018-02-04 04:06:19,253 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 137 states. [2018-02-04 04:06:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:22,866 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-02-04 04:06:22,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 04:06:22,866 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 337 [2018-02-04 04:06:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:22,867 INFO L225 Difference]: With dead ends: 348 [2018-02-04 04:06:22,867 INFO L226 Difference]: Without dead ends: 348 [2018-02-04 04:06:22,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8775 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4692, Invalid=13940, Unknown=0, NotChecked=0, Total=18632 [2018-02-04 04:06:22,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-04 04:06:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-02-04 04:06:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-04 04:06:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-02-04 04:06:22,870 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 337 [2018-02-04 04:06:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:22,870 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-02-04 04:06:22,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-02-04 04:06:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-02-04 04:06:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-02-04 04:06:22,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:22,871 INFO L351 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:22,871 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:22,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2142854071, now seen corresponding path program 67 times [2018-02-04 04:06:22,871 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:22,871 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:22,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:22,872 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:22,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:22,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:24,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:24,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:24,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:06:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:24,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:24,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:24,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-02-04 04:06:24,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 04:06:24,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 04:06:24,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 04:06:24,219 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 71 states. [2018-02-04 04:06:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:25,686 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-02-04 04:06:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 04:06:25,686 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-02-04 04:06:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:25,687 INFO L225 Difference]: With dead ends: 353 [2018-02-04 04:06:25,688 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 04:06:25,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-02-04 04:06:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 04:06:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-02-04 04:06:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-04 04:06:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-02-04 04:06:25,691 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 342 [2018-02-04 04:06:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:25,691 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-02-04 04:06:25,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 04:06:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-02-04 04:06:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-02-04 04:06:25,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:25,692 INFO L351 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:25,692 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:25,692 INFO L82 PathProgramCache]: Analyzing trace with hash -271767012, now seen corresponding path program 68 times [2018-02-04 04:06:25,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:25,692 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:25,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:25,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:06:25,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:25,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:26,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:26,965 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:26,965 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:06:26,976 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:06:26,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:26,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:27,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:27,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-02-04 04:06:27,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 04:06:27,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 04:06:27,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 04:06:27,037 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 72 states. [2018-02-04 04:06:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:28,875 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-02-04 04:06:28,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 04:06:28,876 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 347 [2018-02-04 04:06:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:28,877 INFO L225 Difference]: With dead ends: 358 [2018-02-04 04:06:28,877 INFO L226 Difference]: Without dead ends: 358 [2018-02-04 04:06:28,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6843, Invalid=12617, Unknown=0, NotChecked=0, Total=19460 [2018-02-04 04:06:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-04 04:06:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2018-02-04 04:06:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 04:06:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-02-04 04:06:28,879 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 347 [2018-02-04 04:06:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:28,880 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-02-04 04:06:28,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 04:06:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-02-04 04:06:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-02-04 04:06:28,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:28,881 INFO L351 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:28,881 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash -968650025, now seen corresponding path program 69 times [2018-02-04 04:06:28,881 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:28,881 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:28,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:28,881 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:28,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:28,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:30,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:30,205 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:30,205 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:06:30,225 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-02-04 04:06:30,226 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:30,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:30,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:30,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-02-04 04:06:30,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 04:06:30,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 04:06:30,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 04:06:30,306 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 73 states. [2018-02-04 04:06:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:31,842 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-02-04 04:06:31,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 04:06:31,842 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-02-04 04:06:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:31,843 INFO L225 Difference]: With dead ends: 363 [2018-02-04 04:06:31,843 INFO L226 Difference]: Without dead ends: 363 [2018-02-04 04:06:31,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7458, Invalid=12564, Unknown=0, NotChecked=0, Total=20022 [2018-02-04 04:06:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-04 04:06:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-02-04 04:06:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-04 04:06:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-02-04 04:06:31,846 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 352 [2018-02-04 04:06:31,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:31,846 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-02-04 04:06:31,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 04:06:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-02-04 04:06:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-02-04 04:06:31,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:31,847 INFO L351 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:31,847 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1084778236, now seen corresponding path program 70 times [2018-02-04 04:06:31,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:31,848 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:31,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:31,848 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:31,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:31,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:33,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:33,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:33,212 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:06:33,224 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:06:33,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:33,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:33,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:33,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-02-04 04:06:33,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 04:06:33,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 04:06:33,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 04:06:33,287 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 74 states. [2018-02-04 04:06:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:34,998 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-02-04 04:06:34,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 04:06:34,998 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 357 [2018-02-04 04:06:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:34,999 INFO L225 Difference]: With dead ends: 368 [2018-02-04 04:06:34,999 INFO L226 Difference]: Without dead ends: 368 [2018-02-04 04:06:35,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-02-04 04:06:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-02-04 04:06:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-02-04 04:06:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 04:06:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-02-04 04:06:35,002 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 357 [2018-02-04 04:06:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:35,002 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-02-04 04:06:35,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 04:06:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-02-04 04:06:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-02-04 04:06:35,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:35,003 INFO L351 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:35,003 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1488231945, now seen corresponding path program 71 times [2018-02-04 04:06:35,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:35,003 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:35,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:35,003 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:35,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:35,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:36,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:36,412 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:36,412 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:06:36,445 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-02-04 04:06:36,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:36,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:37,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:37,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 73] total 144 [2018-02-04 04:06:37,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-02-04 04:06:37,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-02-04 04:06:37,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5327, Invalid=15553, Unknown=0, NotChecked=0, Total=20880 [2018-02-04 04:06:37,951 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 145 states. [2018-02-04 04:06:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:42,993 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-02-04 04:06:42,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 04:06:42,994 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 362 [2018-02-04 04:06:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:42,994 INFO L225 Difference]: With dead ends: 373 [2018-02-04 04:06:42,994 INFO L226 Difference]: Without dead ends: 373 [2018-02-04 04:06:42,996 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16982 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=8305, Invalid=38135, Unknown=0, NotChecked=0, Total=46440 [2018-02-04 04:06:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-04 04:06:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-02-04 04:06:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-04 04:06:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-02-04 04:06:42,997 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 362 [2018-02-04 04:06:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:42,998 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-02-04 04:06:42,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-02-04 04:06:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-02-04 04:06:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-02-04 04:06:42,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:42,999 INFO L351 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:42,999 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:42,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1573194716, now seen corresponding path program 72 times [2018-02-04 04:06:42,999 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:42,999 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:42,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:42,999 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:42,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:43,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:44,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:44,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:44,397 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:44,398 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:06:44,423 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-02-04 04:06:44,423 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:44,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:44,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:44,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 84 [2018-02-04 04:06:44,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-02-04 04:06:44,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-02-04 04:06:44,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2776, Invalid=4364, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 04:06:44,766 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 85 states. [2018-02-04 04:06:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:47,329 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-02-04 04:06:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 04:06:47,329 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 367 [2018-02-04 04:06:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:47,330 INFO L225 Difference]: With dead ends: 378 [2018-02-04 04:06:47,330 INFO L226 Difference]: Without dead ends: 378 [2018-02-04 04:06:47,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3307 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=8291, Invalid=16201, Unknown=0, NotChecked=0, Total=24492 [2018-02-04 04:06:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-04 04:06:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-02-04 04:06:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-04 04:06:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-02-04 04:06:47,333 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 367 [2018-02-04 04:06:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:47,333 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-02-04 04:06:47,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-02-04 04:06:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-02-04 04:06:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-02-04 04:06:47,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:47,334 INFO L351 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:47,334 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1263351529, now seen corresponding path program 73 times [2018-02-04 04:06:47,335 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:47,335 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:47,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:47,335 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:47,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:47,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:48,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:48,834 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:48,835 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:06:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:48,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:48,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:48,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-02-04 04:06:48,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 04:06:48,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 04:06:48,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 04:06:48,910 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 77 states. [2018-02-04 04:06:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:50,610 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-02-04 04:06:50,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 04:06:50,610 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-02-04 04:06:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:50,611 INFO L225 Difference]: With dead ends: 383 [2018-02-04 04:06:50,611 INFO L226 Difference]: Without dead ends: 383 [2018-02-04 04:06:50,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=8328, Invalid=14022, Unknown=0, NotChecked=0, Total=22350 [2018-02-04 04:06:50,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-04 04:06:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-02-04 04:06:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-04 04:06:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-02-04 04:06:50,614 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 372 [2018-02-04 04:06:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:50,614 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-02-04 04:06:50,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 04:06:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-02-04 04:06:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-02-04 04:06:50,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:50,615 INFO L351 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:50,615 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:50,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1837033284, now seen corresponding path program 74 times [2018-02-04 04:06:50,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:50,615 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:50,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:50,616 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:06:50,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:50,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:52,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:52,131 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:52,131 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:06:52,143 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:06:52,143 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:52,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:52,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:52,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-02-04 04:06:52,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 04:06:52,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 04:06:52,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 04:06:52,218 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 78 states. [2018-02-04 04:06:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:54,126 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-02-04 04:06:54,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 04:06:54,126 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-02-04 04:06:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:54,127 INFO L225 Difference]: With dead ends: 388 [2018-02-04 04:06:54,127 INFO L226 Difference]: Without dead ends: 388 [2018-02-04 04:06:54,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-02-04 04:06:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-04 04:06:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-02-04 04:06:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-04 04:06:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-02-04 04:06:54,130 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 377 [2018-02-04 04:06:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:54,130 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-02-04 04:06:54,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 04:06:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-02-04 04:06:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-02-04 04:06:54,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:54,131 INFO L351 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:54,131 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash 232507447, now seen corresponding path program 75 times [2018-02-04 04:06:54,131 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:54,131 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:54,132 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:54,132 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:54,132 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:54,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:55,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:55,713 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:55,713 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:06:55,738 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-02-04 04:06:55,738 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:55,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:55,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:55,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-02-04 04:06:55,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-02-04 04:06:55,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-02-04 04:06:55,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 04:06:55,811 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 79 states. [2018-02-04 04:06:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:57,520 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-02-04 04:06:57,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 04:06:57,520 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-02-04 04:06:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:57,521 INFO L225 Difference]: With dead ends: 393 [2018-02-04 04:06:57,521 INFO L226 Difference]: Without dead ends: 393 [2018-02-04 04:06:57,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=8781, Invalid=14781, Unknown=0, NotChecked=0, Total=23562 [2018-02-04 04:06:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-02-04 04:06:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-02-04 04:06:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-04 04:06:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-02-04 04:06:57,524 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 382 [2018-02-04 04:06:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:57,524 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-02-04 04:06:57,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-02-04 04:06:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-02-04 04:06:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-02-04 04:06:57,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:57,526 INFO L351 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:57,526 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 213552540, now seen corresponding path program 76 times [2018-02-04 04:06:57,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:57,526 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:57,526 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:57,526 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:57,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:57,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:59,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:59,126 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:59,126 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:06:59,139 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:06:59,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:59,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:59,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:59,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-02-04 04:06:59,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-02-04 04:06:59,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-02-04 04:06:59,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 04:06:59,214 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 80 states. [2018-02-04 04:07:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:01,461 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-02-04 04:07:01,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 04:07:01,461 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 387 [2018-02-04 04:07:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:01,462 INFO L225 Difference]: With dead ends: 398 [2018-02-04 04:07:01,462 INFO L226 Difference]: Without dead ends: 398 [2018-02-04 04:07:01,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-02-04 04:07:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-04 04:07:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-02-04 04:07:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-04 04:07:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-02-04 04:07:01,466 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 387 [2018-02-04 04:07:01,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:01,466 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-02-04 04:07:01,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-02-04 04:07:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-02-04 04:07:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-02-04 04:07:01,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:01,467 INFO L351 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:01,467 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:01,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2141740887, now seen corresponding path program 77 times [2018-02-04 04:07:01,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:01,467 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:01,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:01,468 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:01,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:01,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:03,310 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:03,310 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:03,310 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:07:03,346 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-02-04 04:07:03,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:03,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:05,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:05,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 79] total 156 [2018-02-04 04:07:05,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-02-04 04:07:05,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-02-04 04:07:05,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6239, Invalid=18253, Unknown=0, NotChecked=0, Total=24492 [2018-02-04 04:07:05,179 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 157 states. [2018-02-04 04:07:12,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:12,183 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-02-04 04:07:12,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 04:07:12,183 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 392 [2018-02-04 04:07:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:12,184 INFO L225 Difference]: With dead ends: 403 [2018-02-04 04:07:12,184 INFO L226 Difference]: Without dead ends: 403 [2018-02-04 04:07:12,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20033 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=9700, Invalid=44822, Unknown=0, NotChecked=0, Total=54522 [2018-02-04 04:07:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-04 04:07:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-02-04 04:07:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 04:07:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-02-04 04:07:12,189 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 392 [2018-02-04 04:07:12,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:12,189 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-02-04 04:07:12,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-02-04 04:07:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-02-04 04:07:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-02-04 04:07:12,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:12,190 INFO L351 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:12,190 INFO L371 AbstractCegarLoop]: === Iteration 83 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:12,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1127257476, now seen corresponding path program 78 times [2018-02-04 04:07:12,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:12,190 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:12,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:12,191 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:12,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:12,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 04:07:12,498 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 04:07:12,501 INFO L168 Benchmark]: Toolchain (without parser) took 176776.55 ms. Allocated memory was 405.3 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 363.4 MB in the beginning and 1.1 GB in the end (delta: -746.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-02-04 04:07:12,501 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:07:12,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.66 ms. Allocated memory is still 405.3 MB. Free memory was 363.4 MB in the beginning and 355.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:12,502 INFO L168 Benchmark]: Boogie Preprocessor took 24.38 ms. Allocated memory is still 405.3 MB. Free memory was 355.4 MB in the beginning and 354.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:12,502 INFO L168 Benchmark]: RCFGBuilder took 139.10 ms. Allocated memory is still 405.3 MB. Free memory was 354.1 MB in the beginning and 341.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:12,502 INFO L168 Benchmark]: TraceAbstraction took 176467.80 ms. Allocated memory was 405.3 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 341.4 MB in the beginning and 1.1 GB in the end (delta: -768.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-02-04 04:07:12,503 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.12 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 142.66 ms. Allocated memory is still 405.3 MB. Free memory was 363.4 MB in the beginning and 355.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.38 ms. Allocated memory is still 405.3 MB. Free memory was 355.4 MB in the beginning and 354.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 139.10 ms. Allocated memory is still 405.3 MB. Free memory was 354.1 MB in the beginning and 341.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 176467.80 ms. Allocated memory was 405.3 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 341.4 MB in the beginning and 1.1 GB in the end (delta: -768.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-07-12-510.csv Completed graceful shutdown