java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 21:01:28,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:01:28,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:01:28,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:01:28,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:01:28,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:01:28,124 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:01:28,125 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:01:28,127 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:01:28,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:01:28,128 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:01:28,128 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:01:28,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:01:28,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:01:28,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:01:28,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:01:28,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:01:28,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:01:28,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:01:28,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:01:28,139 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:01:28,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:01:28,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:01:28,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:01:28,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:01:28,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:01:28,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:01:28,142 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:01:28,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:01:28,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:01:28,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:01:28,143 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-02 21:01:28,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:01:28,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:01:28,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:01:28,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:01:28,153 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:01:28,153 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:01:28,153 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:01:28,154 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:01:28,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:01:28,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:01:28,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:01:28,154 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:01:28,154 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:01:28,154 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:01:28,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:01:28,154 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:01:28,154 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:01:28,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:01:28,155 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:01:28,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:01:28,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:01:28,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:01:28,155 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:01:28,155 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:01:28,155 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:01:28,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:01:28,192 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:01:28,195 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:01:28,196 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:01:28,197 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:01:28,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-02-02 21:01:28,289 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:01:28,291 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:01:28,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:01:28,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:01:28,298 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:01:28,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:01:28" (1/1) ... [2018-02-02 21:01:28,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32349321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28, skipping insertion in model container [2018-02-02 21:01:28,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:01:28" (1/1) ... [2018-02-02 21:01:28,316 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:01:28,327 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:01:28,404 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:01:28,412 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:01:28,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28 WrapperNode [2018-02-02 21:01:28,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:01:28,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:01:28,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:01:28,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:01:28,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28" (1/1) ... [2018-02-02 21:01:28,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28" (1/1) ... [2018-02-02 21:01:28,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28" (1/1) ... [2018-02-02 21:01:28,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28" (1/1) ... [2018-02-02 21:01:28,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28" (1/1) ... [2018-02-02 21:01:28,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28" (1/1) ... [2018-02-02 21:01:28,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28" (1/1) ... [2018-02-02 21:01:28,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:01:28,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:01:28,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:01:28,435 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:01:28,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28" (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-02 21:01:28,473 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:01:28,473 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:01:28,473 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 21:01:28,473 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:01:28,473 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 21:01:28,473 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 21:01:28,473 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:01:28,473 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:01:28,474 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:01:28,562 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:01:28,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:01:28 BoogieIcfgContainer [2018-02-02 21:01:28,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:01:28,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:01:28,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:01:28,564 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:01:28,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:01:28" (1/3) ... [2018-02-02 21:01:28,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6092e445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:01:28, skipping insertion in model container [2018-02-02 21:01:28,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:01:28" (2/3) ... [2018-02-02 21:01:28,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6092e445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:01:28, skipping insertion in model container [2018-02-02 21:01:28,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:01:28" (3/3) ... [2018-02-02 21:01:28,567 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-02-02 21:01:28,572 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:01:28,577 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 21:01:28,598 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:01:28,598 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:01:28,598 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:01:28,599 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:01:28,599 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:01:28,599 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:01:28,599 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:01:28,599 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:01:28,599 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:01:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-02 21:01:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 21:01:28,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:28,612 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:28,613 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:28,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1734695582, now seen corresponding path program 1 times [2018-02-02 21:01:28,616 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:28,617 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:28,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:28,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:28,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:28,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:28,718 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-02 21:01:28,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:01:28,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:01:28,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:01:28,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:01:28,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:01:28,737 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-02-02 21:01:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:28,799 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-02 21:01:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:01:28,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 21:01:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:28,805 INFO L225 Difference]: With dead ends: 50 [2018-02-02 21:01:28,806 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 21:01:28,807 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-02 21:01:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 21:01:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-02-02 21:01:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 21:01:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-02-02 21:01:28,834 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 7 [2018-02-02 21:01:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:28,834 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-02-02 21:01:28,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:01:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-02-02 21:01:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 21:01:28,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:28,835 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:28,835 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash 337601429, now seen corresponding path program 1 times [2018-02-02 21:01:28,835 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:28,835 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:28,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:28,836 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:28,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:28,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:28,933 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-02 21:01:28,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:28,933 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:28,934 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:28,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:28,959 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-02 21:01:28,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:28,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-02 21:01:28,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:01:28,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:01:28,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:01:28,961 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 4 states. [2018-02-02 21:01:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:29,019 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-02 21:01:29,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 21:01:29,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 21:01:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:29,021 INFO L225 Difference]: With dead ends: 54 [2018-02-02 21:01:29,021 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 21:01:29,021 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-02 21:01:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 21:01:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-02-02 21:01:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 21:01:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 21:01:29,027 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2018-02-02 21:01:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:29,027 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 21:01:29,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:01:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 21:01:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:01:29,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:29,028 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:29,028 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1746445058, now seen corresponding path program 2 times [2018-02-02 21:01:29,028 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:29,029 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:29,029 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:29,029 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:29,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:29,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:29,079 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-02 21:01:29,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:29,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:29,080 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:01:29,090 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:01:29,090 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:29,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:29,103 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-02 21:01:29,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:29,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-02 21:01:29,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:01:29,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:01:29,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:01:29,104 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-02-02 21:01:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:29,231 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-02 21:01:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:01:29,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 21:01:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:29,233 INFO L225 Difference]: With dead ends: 67 [2018-02-02 21:01:29,233 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 21:01:29,234 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-02 21:01:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 21:01:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-02 21:01:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 21:01:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-02 21:01:29,240 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 17 [2018-02-02 21:01:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:29,241 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-02 21:01:29,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:01:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-02 21:01:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 21:01:29,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:29,242 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:29,242 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash -228598475, now seen corresponding path program 3 times [2018-02-02 21:01:29,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:29,242 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:29,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:29,243 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:29,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:29,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:29,295 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-02 21:01:29,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:29,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:29,296 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:01:29,302 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-02 21:01:29,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:29,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:29,309 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-02 21:01:29,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:29,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-02 21:01:29,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:01:29,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:01:29,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:01:29,310 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 7 states. [2018-02-02 21:01:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:29,422 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-02-02 21:01:29,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:01:29,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 21:01:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:29,423 INFO L225 Difference]: With dead ends: 80 [2018-02-02 21:01:29,423 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 21:01:29,423 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-02 21:01:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 21:01:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-02-02 21:01:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 21:01:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-02-02 21:01:29,431 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 22 [2018-02-02 21:01:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:29,432 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-02-02 21:01:29,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:01:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-02-02 21:01:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 21:01:29,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:29,433 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:29,433 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash 756148062, now seen corresponding path program 4 times [2018-02-02 21:01:29,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:29,433 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:29,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:29,434 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:29,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:29,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:29,521 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-02 21:01:29,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:29,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:29,523 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:01:29,533 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:01:29,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:29,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:29,544 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-02 21:01:29,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:29,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-02 21:01:29,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:01:29,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:01:29,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:01:29,546 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 7 states. [2018-02-02 21:01:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:29,687 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-02-02 21:01:29,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:01:29,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 21:01:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:29,689 INFO L225 Difference]: With dead ends: 93 [2018-02-02 21:01:29,689 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 21:01:29,689 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-02 21:01:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 21:01:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-02-02 21:01:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 21:01:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-02 21:01:29,695 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 27 [2018-02-02 21:01:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:29,696 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-02 21:01:29,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:01:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-02 21:01:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 21:01:29,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:29,697 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:29,697 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:29,697 INFO L82 PathProgramCache]: Analyzing trace with hash 671928021, now seen corresponding path program 5 times [2018-02-02 21:01:29,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:29,697 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:29,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:29,698 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:29,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:29,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:29,758 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-02 21:01:29,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:29,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:29,758 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:01:29,771 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-02 21:01:29,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:29,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:29,819 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-02 21:01:29,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:29,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-02-02 21:01:29,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 21:01:29,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 21:01:29,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:01:29,820 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 14 states. [2018-02-02 21:01:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:30,029 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-02-02 21:01:30,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:01:30,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-02-02 21:01:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:30,030 INFO L225 Difference]: With dead ends: 106 [2018-02-02 21:01:30,030 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 21:01:30,030 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-02 21:01:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 21:01:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-02-02 21:01:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 21:01:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-02-02 21:01:30,034 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 32 [2018-02-02 21:01:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:30,034 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-02-02 21:01:30,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 21:01:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-02-02 21:01:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 21:01:30,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:30,035 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:30,036 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:30,036 INFO L82 PathProgramCache]: Analyzing trace with hash -203753026, now seen corresponding path program 6 times [2018-02-02 21:01:30,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:30,036 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:30,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:30,037 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:30,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:30,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:30,108 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-02 21:01:30,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:30,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:30,109 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:01:30,119 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-02 21:01:30,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:30,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:30,147 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-02 21:01:30,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:30,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-02-02 21:01:30,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 21:01:30,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 21:01:30,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:01:30,148 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 13 states. [2018-02-02 21:01:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:30,293 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-02-02 21:01:30,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:01:30,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-02 21:01:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:30,294 INFO L225 Difference]: With dead ends: 119 [2018-02-02 21:01:30,294 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 21:01:30,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:01:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 21:01:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-02-02 21:01:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 21:01:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-02-02 21:01:30,299 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 37 [2018-02-02 21:01:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:30,299 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-02-02 21:01:30,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 21:01:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-02-02 21:01:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:01:30,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:30,300 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:30,300 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1846527883, now seen corresponding path program 7 times [2018-02-02 21:01:30,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:30,300 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:30,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:30,301 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:30,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:30,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:30,366 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-02 21:01:30,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:30,366 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:30,367 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:30,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:30,383 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-02 21:01:30,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:30,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-02 21:01:30,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:01:30,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:01:30,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:01:30,385 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 11 states. [2018-02-02 21:01:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:30,544 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-02-02 21:01:30,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:01:30,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-02 21:01:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:30,545 INFO L225 Difference]: With dead ends: 132 [2018-02-02 21:01:30,546 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 21:01:30,546 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-02 21:01:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 21:01:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-02-02 21:01:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 21:01:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-02-02 21:01:30,551 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 42 [2018-02-02 21:01:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:30,552 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-02-02 21:01:30,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:01:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-02-02 21:01:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 21:01:30,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:30,553 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:30,553 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:30,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2109248542, now seen corresponding path program 8 times [2018-02-02 21:01:30,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:30,554 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:30,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:30,554 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:30,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:30,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:30,647 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-02 21:01:30,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:30,647 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:30,648 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:01:30,656 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:01:30,656 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:30,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:30,666 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-02 21:01:30,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:30,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-02 21:01:30,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:01:30,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:01:30,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:01:30,667 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 11 states. [2018-02-02 21:01:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:31,027 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2018-02-02 21:01:31,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:01:31,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 21:01:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:31,028 INFO L225 Difference]: With dead ends: 145 [2018-02-02 21:01:31,029 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 21:01:31,029 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-02 21:01:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 21:01:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2018-02-02 21:01:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 21:01:31,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-02-02 21:01:31,034 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 47 [2018-02-02 21:01:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:31,035 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-02-02 21:01:31,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:01:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-02-02 21:01:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 21:01:31,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:31,036 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:31,036 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash 408164885, now seen corresponding path program 9 times [2018-02-02 21:01:31,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:31,037 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:31,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:31,038 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:31,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:31,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:31,136 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-02 21:01:31,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:31,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:31,137 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:01:31,146 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-02 21:01:31,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:31,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:31,223 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-02 21:01:31,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:31,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-02 21:01:31,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 21:01:31,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 21:01:31,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:01:31,225 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 23 states. [2018-02-02 21:01:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:31,681 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-02-02 21:01:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:01:31,682 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-02 21:01:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:31,683 INFO L225 Difference]: With dead ends: 158 [2018-02-02 21:01:31,687 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 21:01:31,687 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-02 21:01:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 21:01:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2018-02-02 21:01:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 21:01:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2018-02-02 21:01:31,692 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 52 [2018-02-02 21:01:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:31,692 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2018-02-02 21:01:31,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 21:01:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2018-02-02 21:01:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 21:01:31,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:31,694 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:31,694 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:31,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2136951170, now seen corresponding path program 10 times [2018-02-02 21:01:31,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:31,694 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:31,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:31,695 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:31,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:31,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:31,794 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-02 21:01:31,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:31,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:31,795 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:01:31,806 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:01:31,811 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:31,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:31,825 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-02 21:01:31,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:31,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-02-02 21:01:31,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 21:01:31,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 21:01:31,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:01:31,826 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand 14 states. [2018-02-02 21:01:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:32,068 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-02-02 21:01:32,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 21:01:32,068 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-02-02 21:01:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:32,069 INFO L225 Difference]: With dead ends: 171 [2018-02-02 21:01:32,069 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 21:01:32,070 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-02 21:01:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 21:01:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-02-02 21:01:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 21:01:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-02-02 21:01:32,077 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 57 [2018-02-02 21:01:32,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:32,077 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-02-02 21:01:32,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 21:01:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-02-02 21:01:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 21:01:32,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:32,078 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:32,078 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:32,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1325560757, now seen corresponding path program 11 times [2018-02-02 21:01:32,078 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:32,078 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:32,079 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:32,079 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:32,079 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:32,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:32,152 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-02 21:01:32,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:32,152 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:32,152 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:01:32,164 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-02 21:01:32,164 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:32,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:32,295 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-02 21:01:32,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:32,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-02-02 21:01:32,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 21:01:32,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 21:01:32,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-02-02 21:01:32,296 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 26 states. [2018-02-02 21:01:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:32,984 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-02-02 21:01:32,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:01:32,985 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-02-02 21:01:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:32,985 INFO L225 Difference]: With dead ends: 184 [2018-02-02 21:01:32,986 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 21:01:32,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:01:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 21:01:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-02-02 21:01:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 21:01:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2018-02-02 21:01:32,989 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 62 [2018-02-02 21:01:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:32,989 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2018-02-02 21:01:32,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 21:01:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2018-02-02 21:01:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 21:01:32,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:32,990 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:32,990 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:32,991 INFO L82 PathProgramCache]: Analyzing trace with hash 923361502, now seen corresponding path program 12 times [2018-02-02 21:01:32,991 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:32,991 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:32,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:32,992 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:32,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:32,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:33,102 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-02 21:01:33,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:33,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:33,102 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:01:33,110 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-02 21:01:33,110 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:33,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:33,206 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-02 21:01:33,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:33,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-02-02 21:01:33,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 21:01:33,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 21:01:33,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:01:33,208 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand 29 states. [2018-02-02 21:01:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:33,576 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-02-02 21:01:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 21:01:33,577 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-02-02 21:01:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:33,577 INFO L225 Difference]: With dead ends: 197 [2018-02-02 21:01:33,577 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 21:01:33,578 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-02 21:01:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 21:01:33,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-02-02 21:01:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 21:01:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-02-02 21:01:33,581 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 67 [2018-02-02 21:01:33,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:33,581 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-02-02 21:01:33,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 21:01:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-02-02 21:01:33,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 21:01:33,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:33,582 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:33,582 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:33,583 INFO L82 PathProgramCache]: Analyzing trace with hash 356861269, now seen corresponding path program 13 times [2018-02-02 21:01:33,583 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:33,583 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:33,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:33,583 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:33,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:33,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:33,693 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-02 21:01:33,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:33,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:33,694 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:33,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:33,712 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-02 21:01:33,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:33,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-02-02 21:01:33,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:01:33,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:01:33,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:01:33,714 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 17 states. [2018-02-02 21:01:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:33,941 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2018-02-02 21:01:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 21:01:33,941 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-02 21:01:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:33,942 INFO L225 Difference]: With dead ends: 210 [2018-02-02 21:01:33,942 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 21:01:33,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-02 21:01:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 21:01:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2018-02-02 21:01:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 21:01:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2018-02-02 21:01:33,945 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 72 [2018-02-02 21:01:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:33,945 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2018-02-02 21:01:33,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:01:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-02-02 21:01:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 21:01:33,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:33,945 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:33,945 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1075276994, now seen corresponding path program 14 times [2018-02-02 21:01:33,946 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:33,946 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:33,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:33,946 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:33,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:33,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:34,074 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-02 21:01:34,074 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:34,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:34,075 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:01:34,080 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:01:34,080 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:34,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:34,094 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-02 21:01:34,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:34,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-02-02 21:01:34,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:01:34,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:01:34,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:01:34,096 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand 18 states. [2018-02-02 21:01:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:34,465 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-02-02 21:01:34,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 21:01:34,466 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-02 21:01:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:34,466 INFO L225 Difference]: With dead ends: 223 [2018-02-02 21:01:34,466 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 21:01:34,467 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-02-02 21:01:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 21:01:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2018-02-02 21:01:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 21:01:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-02-02 21:01:34,471 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 77 [2018-02-02 21:01:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:34,471 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-02-02 21:01:34,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:01:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-02-02 21:01:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 21:01:34,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:34,472 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:34,472 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash 904302325, now seen corresponding path program 15 times [2018-02-02 21:01:34,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:34,473 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:34,473 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:34,474 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:34,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:34,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:34,606 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-02 21:01:34,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:34,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:34,607 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:01:34,616 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-02 21:01:34,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:34,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:34,752 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-02 21:01:34,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:34,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-02-02 21:01:34,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:01:34,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:01:34,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:01:34,754 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 35 states. [2018-02-02 21:01:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:35,720 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-02-02 21:01:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 21:01:35,721 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-02-02 21:01:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:35,722 INFO L225 Difference]: With dead ends: 236 [2018-02-02 21:01:35,722 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 21:01:35,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:01:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 21:01:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-02-02 21:01:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 21:01:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 250 transitions. [2018-02-02 21:01:35,727 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 250 transitions. Word has length 82 [2018-02-02 21:01:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:35,728 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 250 transitions. [2018-02-02 21:01:35,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:01:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 250 transitions. [2018-02-02 21:01:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 21:01:35,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:35,728 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:35,729 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:35,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2125745566, now seen corresponding path program 16 times [2018-02-02 21:01:35,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:35,729 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:35,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:35,729 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:35,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:35,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:35,899 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-02 21:01:35,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:35,899 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:35,900 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:01:35,909 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:01:35,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:35,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:35,934 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-02 21:01:35,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:35,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-02-02 21:01:35,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 21:01:35,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 21:01:35,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:01:35,935 INFO L87 Difference]: Start difference. First operand 218 states and 250 transitions. Second operand 19 states. [2018-02-02 21:01:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:36,928 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2018-02-02 21:01:36,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 21:01:36,928 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-02 21:01:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:36,929 INFO L225 Difference]: With dead ends: 249 [2018-02-02 21:01:36,929 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 21:01:36,929 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-02 21:01:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 21:01:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 230. [2018-02-02 21:01:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 21:01:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-02-02 21:01:36,931 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 87 [2018-02-02 21:01:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:36,932 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-02-02 21:01:36,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 21:01:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-02-02 21:01:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 21:01:36,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:36,932 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:36,932 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:36,932 INFO L82 PathProgramCache]: Analyzing trace with hash 120606869, now seen corresponding path program 17 times [2018-02-02 21:01:36,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:36,933 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:36,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:36,933 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:36,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:36,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:37,039 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-02 21:01:37,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:37,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:37,040 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:01:37,049 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-02 21:01:37,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:37,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:37,281 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-02 21:01:37,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:37,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-02-02 21:01:37,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 21:01:37,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 21:01:37,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 21:01:37,282 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 38 states. [2018-02-02 21:01:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:38,198 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2018-02-02 21:01:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 21:01:38,198 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 92 [2018-02-02 21:01:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:38,199 INFO L225 Difference]: With dead ends: 262 [2018-02-02 21:01:38,199 INFO L226 Difference]: Without dead ends: 262 [2018-02-02 21:01:38,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 21:01:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-02 21:01:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2018-02-02 21:01:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 21:01:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-02-02 21:01:38,203 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 92 [2018-02-02 21:01:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:38,203 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-02-02 21:01:38,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 21:01:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-02-02 21:01:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 21:01:38,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:38,204 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:38,204 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2070056958, now seen corresponding path program 18 times [2018-02-02 21:01:38,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:38,204 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:38,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:38,204 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:38,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:38,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:38,365 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-02 21:01:38,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:38,365 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:38,366 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:01:38,376 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-02 21:01:38,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:38,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:38,519 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-02 21:01:38,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:38,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-02-02 21:01:38,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 21:01:38,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 21:01:38,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:01:38,520 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 41 states. [2018-02-02 21:01:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:39,909 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2018-02-02 21:01:39,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 21:01:39,909 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 97 [2018-02-02 21:01:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:39,910 INFO L225 Difference]: With dead ends: 275 [2018-02-02 21:01:39,910 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 21:01:39,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:01:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 21:01:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2018-02-02 21:01:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 21:01:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 292 transitions. [2018-02-02 21:01:39,913 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 292 transitions. Word has length 97 [2018-02-02 21:01:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:39,913 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 292 transitions. [2018-02-02 21:01:39,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 21:01:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 292 transitions. [2018-02-02 21:01:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 21:01:39,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:39,914 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:39,914 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:39,914 INFO L82 PathProgramCache]: Analyzing trace with hash 183274037, now seen corresponding path program 19 times [2018-02-02 21:01:39,914 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:39,914 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:39,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:39,915 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:39,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:39,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:40,110 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-02 21:01:40,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:40,110 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:40,111 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:40,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:40,138 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-02 21:01:40,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:40,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-02-02 21:01:40,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 21:01:40,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 21:01:40,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:01:40,140 INFO L87 Difference]: Start difference. First operand 254 states and 292 transitions. Second operand 23 states. [2018-02-02 21:01:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:40,728 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2018-02-02 21:01:40,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 21:01:40,728 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-02-02 21:01:40,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:40,729 INFO L225 Difference]: With dead ends: 288 [2018-02-02 21:01:40,729 INFO L226 Difference]: Without dead ends: 288 [2018-02-02 21:01:40,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 21:01:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-02 21:01:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2018-02-02 21:01:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-02 21:01:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-02-02 21:01:40,733 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 102 [2018-02-02 21:01:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:40,733 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-02-02 21:01:40,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 21:01:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-02-02 21:01:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 21:01:40,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:40,734 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:40,734 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:40,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1033282978, now seen corresponding path program 20 times [2018-02-02 21:01:40,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:40,734 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:40,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:40,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:40,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:40,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:40,951 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-02 21:01:40,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:40,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:40,952 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:01:40,958 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:01:40,958 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:40,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:40,976 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-02 21:01:40,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:40,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-02-02 21:01:40,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 21:01:40,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 21:01:40,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-02 21:01:40,977 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 24 states. [2018-02-02 21:01:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:41,544 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2018-02-02 21:01:41,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 21:01:41,544 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-02-02 21:01:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:41,545 INFO L225 Difference]: With dead ends: 301 [2018-02-02 21:01:41,545 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 21:01:41,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 21:01:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 21:01:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 278. [2018-02-02 21:01:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-02 21:01:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 320 transitions. [2018-02-02 21:01:41,550 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 320 transitions. Word has length 107 [2018-02-02 21:01:41,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:41,551 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 320 transitions. [2018-02-02 21:01:41,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 21:01:41,551 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 320 transitions. [2018-02-02 21:01:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 21:01:41,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:41,552 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:41,552 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:41,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1905968171, now seen corresponding path program 21 times [2018-02-02 21:01:41,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:41,552 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:41,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:41,553 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:41,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:41,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:41,789 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-02 21:01:41,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:41,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:41,790 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:01:41,803 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-02 21:01:41,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:41,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:41,826 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-02 21:01:41,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:41,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-02-02 21:01:41,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 21:01:41,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 21:01:41,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-02 21:01:41,828 INFO L87 Difference]: Start difference. First operand 278 states and 320 transitions. Second operand 25 states. [2018-02-02 21:01:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:42,456 INFO L93 Difference]: Finished difference Result 314 states and 359 transitions. [2018-02-02 21:01:42,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 21:01:42,459 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-02 21:01:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:42,460 INFO L225 Difference]: With dead ends: 314 [2018-02-02 21:01:42,460 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 21:01:42,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 21:01:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 21:01:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 290. [2018-02-02 21:01:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 21:01:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2018-02-02 21:01:42,467 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 112 [2018-02-02 21:01:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:42,468 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2018-02-02 21:01:42,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 21:01:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2018-02-02 21:01:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 21:01:42,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:42,469 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:42,469 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:42,469 INFO L82 PathProgramCache]: Analyzing trace with hash -994136898, now seen corresponding path program 22 times [2018-02-02 21:01:42,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:42,469 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:42,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:42,470 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:42,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:42,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:42,710 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-02 21:01:42,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:42,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:42,711 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:01:42,721 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:01:42,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:42,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:42,752 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-02 21:01:42,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:42,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-02-02 21:01:42,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 21:01:42,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 21:01:42,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-02 21:01:42,754 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand 26 states. [2018-02-02 21:01:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:43,494 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2018-02-02 21:01:43,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 21:01:43,494 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-02 21:01:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:43,495 INFO L225 Difference]: With dead ends: 327 [2018-02-02 21:01:43,495 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 21:01:43,496 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-02 21:01:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 21:01:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2018-02-02 21:01:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-02 21:01:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 348 transitions. [2018-02-02 21:01:43,499 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 348 transitions. Word has length 117 [2018-02-02 21:01:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:43,499 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 348 transitions. [2018-02-02 21:01:43,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 21:01:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 348 transitions. [2018-02-02 21:01:43,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 21:01:43,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:43,500 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:43,500 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:43,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1248093557, now seen corresponding path program 23 times [2018-02-02 21:01:43,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:43,500 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:43,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:43,501 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:43,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:43,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:43,870 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-02 21:01:43,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:43,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:43,871 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:01:43,886 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-02 21:01:43,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:43,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:44,199 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-02 21:01:44,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:44,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2018-02-02 21:01:44,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 21:01:44,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 21:01:44,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 21:01:44,201 INFO L87 Difference]: Start difference. First operand 302 states and 348 transitions. Second operand 50 states. [2018-02-02 21:01:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:46,502 INFO L93 Difference]: Finished difference Result 340 states and 389 transitions. [2018-02-02 21:01:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 21:01:46,502 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 122 [2018-02-02 21:01:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:46,503 INFO L225 Difference]: With dead ends: 340 [2018-02-02 21:01:46,503 INFO L226 Difference]: Without dead ends: 340 [2018-02-02 21:01:46,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 21:01:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-02 21:01:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 314. [2018-02-02 21:01:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-02 21:01:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-02-02 21:01:46,508 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 122 [2018-02-02 21:01:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:46,508 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-02-02 21:01:46,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 21:01:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-02-02 21:01:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-02 21:01:46,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:46,509 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:46,509 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:46,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1210546402, now seen corresponding path program 24 times [2018-02-02 21:01:46,510 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:46,510 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:46,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:46,511 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:46,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:46,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:46,715 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-02 21:01:46,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:46,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:46,715 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:01:46,724 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-02 21:01:46,725 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:46,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:46,885 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-02 21:01:46,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:46,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 36 [2018-02-02 21:01:46,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:01:46,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:01:46,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:01:46,886 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 37 states. [2018-02-02 21:01:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:47,793 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-02-02 21:01:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 21:01:47,793 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-02-02 21:01:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:47,794 INFO L225 Difference]: With dead ends: 353 [2018-02-02 21:01:47,794 INFO L226 Difference]: Without dead ends: 353 [2018-02-02 21:01:47,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1067, Invalid=2593, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 21:01:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-02 21:01:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 326. [2018-02-02 21:01:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-02 21:01:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 376 transitions. [2018-02-02 21:01:47,798 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 376 transitions. Word has length 127 [2018-02-02 21:01:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:47,798 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 376 transitions. [2018-02-02 21:01:47,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:01:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 376 transitions. [2018-02-02 21:01:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 21:01:47,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:47,798 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:47,799 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:47,799 INFO L82 PathProgramCache]: Analyzing trace with hash 53741333, now seen corresponding path program 25 times [2018-02-02 21:01:47,799 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:47,799 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:47,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:47,799 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:47,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:47,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:48,026 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-02 21:01:48,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:48,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:48,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:48,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:48,065 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-02 21:01:48,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:48,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-02-02 21:01:48,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 21:01:48,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 21:01:48,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:01:48,066 INFO L87 Difference]: Start difference. First operand 326 states and 376 transitions. Second operand 29 states. [2018-02-02 21:01:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:48,715 INFO L93 Difference]: Finished difference Result 366 states and 419 transitions. [2018-02-02 21:01:48,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 21:01:48,717 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-02-02 21:01:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:48,718 INFO L225 Difference]: With dead ends: 366 [2018-02-02 21:01:48,718 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 21:01:48,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 21:01:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 21:01:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2018-02-02 21:01:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 21:01:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 390 transitions. [2018-02-02 21:01:48,722 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 390 transitions. Word has length 132 [2018-02-02 21:01:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:48,722 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 390 transitions. [2018-02-02 21:01:48,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 21:01:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 390 transitions. [2018-02-02 21:01:48,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-02 21:01:48,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:48,724 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:48,724 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:48,724 INFO L82 PathProgramCache]: Analyzing trace with hash -173217410, now seen corresponding path program 26 times [2018-02-02 21:01:48,724 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:48,724 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:48,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:48,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:48,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:48,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:49,100 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-02 21:01:49,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:49,100 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:49,101 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:01:49,106 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:01:49,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:49,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:49,123 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-02 21:01:49,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:49,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-02-02 21:01:49,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 21:01:49,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 21:01:49,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-02 21:01:49,124 INFO L87 Difference]: Start difference. First operand 338 states and 390 transitions. Second operand 30 states. [2018-02-02 21:01:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:49,893 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-02-02 21:01:49,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 21:01:49,893 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-02-02 21:01:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:49,894 INFO L225 Difference]: With dead ends: 379 [2018-02-02 21:01:49,894 INFO L226 Difference]: Without dead ends: 379 [2018-02-02 21:01:49,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 21:01:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-02 21:01:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 350. [2018-02-02 21:01:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 21:01:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 404 transitions. [2018-02-02 21:01:49,900 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 404 transitions. Word has length 137 [2018-02-02 21:01:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:49,900 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 404 transitions. [2018-02-02 21:01:49,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 21:01:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 404 transitions. [2018-02-02 21:01:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 21:01:49,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:49,901 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:49,901 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash 681451701, now seen corresponding path program 27 times [2018-02-02 21:01:49,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:49,902 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:49,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:49,902 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:49,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:49,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:50,324 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-02 21:01:50,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:50,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:50,325 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:01:50,334 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-02 21:01:50,334 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:50,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:50,354 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-02 21:01:50,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:50,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-02-02 21:01:50,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 21:01:50,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 21:01:50,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-02 21:01:50,355 INFO L87 Difference]: Start difference. First operand 350 states and 404 transitions. Second operand 31 states. [2018-02-02 21:01:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:51,106 INFO L93 Difference]: Finished difference Result 392 states and 449 transitions. [2018-02-02 21:01:51,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 21:01:51,106 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-02-02 21:01:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:51,107 INFO L225 Difference]: With dead ends: 392 [2018-02-02 21:01:51,107 INFO L226 Difference]: Without dead ends: 392 [2018-02-02 21:01:51,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 21:01:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-02 21:01:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2018-02-02 21:01:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-02 21:01:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 418 transitions. [2018-02-02 21:01:51,112 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 418 transitions. Word has length 142 [2018-02-02 21:01:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:51,112 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 418 transitions. [2018-02-02 21:01:51,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 21:01:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 418 transitions. [2018-02-02 21:01:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 21:01:51,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:51,114 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:51,114 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1555157982, now seen corresponding path program 28 times [2018-02-02 21:01:51,114 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:51,114 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:51,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:51,115 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:51,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:51,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:51,380 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-02 21:01:51,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:51,380 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:51,381 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:01:51,386 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:01:51,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:51,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:51,686 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-02 21:01:51,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:51,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2018-02-02 21:01:51,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-02 21:01:51,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-02 21:01:51,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 21:01:51,688 INFO L87 Difference]: Start difference. First operand 362 states and 418 transitions. Second operand 61 states. [2018-02-02 21:01:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:53,940 INFO L93 Difference]: Finished difference Result 405 states and 464 transitions. [2018-02-02 21:01:53,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 21:01:53,940 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 147 [2018-02-02 21:01:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:53,941 INFO L225 Difference]: With dead ends: 405 [2018-02-02 21:01:53,941 INFO L226 Difference]: Without dead ends: 405 [2018-02-02 21:01:53,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 21:01:53,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-02 21:01:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 374. [2018-02-02 21:01:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-02 21:01:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 432 transitions. [2018-02-02 21:01:53,946 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 432 transitions. Word has length 147 [2018-02-02 21:01:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:53,947 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 432 transitions. [2018-02-02 21:01:53,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-02 21:01:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 432 transitions. [2018-02-02 21:01:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-02 21:01:53,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:53,948 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:53,948 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:53,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1978446421, now seen corresponding path program 29 times [2018-02-02 21:01:53,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:53,948 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:53,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:53,949 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:53,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:53,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:54,299 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-02 21:01:54,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:54,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:54,300 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:01:54,311 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-02 21:01:54,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:54,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:54,664 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-02 21:01:54,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:54,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2018-02-02 21:01:54,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-02 21:01:54,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-02 21:01:54,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 21:01:54,665 INFO L87 Difference]: Start difference. First operand 374 states and 432 transitions. Second operand 62 states. [2018-02-02 21:01:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:57,492 INFO L93 Difference]: Finished difference Result 418 states and 479 transitions. [2018-02-02 21:01:57,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 21:01:57,492 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2018-02-02 21:01:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:57,493 INFO L225 Difference]: With dead ends: 418 [2018-02-02 21:01:57,493 INFO L226 Difference]: Without dead ends: 418 [2018-02-02 21:01:57,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 21:01:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-02 21:01:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 386. [2018-02-02 21:01:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-02 21:01:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 446 transitions. [2018-02-02 21:01:57,498 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 446 transitions. Word has length 152 [2018-02-02 21:01:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:57,498 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 446 transitions. [2018-02-02 21:01:57,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-02 21:01:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 446 transitions. [2018-02-02 21:01:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 21:01:57,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:57,499 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:57,500 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:57,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1344453058, now seen corresponding path program 30 times [2018-02-02 21:01:57,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:57,500 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:57,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:57,500 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:57,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:57,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:57,919 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-02 21:01:57,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:57,919 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:57,920 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:01:57,942 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-02 21:01:57,942 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:57,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:58,018 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-02 21:01:58,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:58,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-02-02 21:01:58,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:01:58,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:01:58,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=818, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:01:58,019 INFO L87 Difference]: Start difference. First operand 386 states and 446 transitions. Second operand 37 states. [2018-02-02 21:01:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:58,858 INFO L93 Difference]: Finished difference Result 431 states and 494 transitions. [2018-02-02 21:01:58,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 21:01:58,935 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-02-02 21:01:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:58,937 INFO L225 Difference]: With dead ends: 431 [2018-02-02 21:01:58,937 INFO L226 Difference]: Without dead ends: 431 [2018-02-02 21:01:58,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1562, Invalid=2860, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 21:01:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-02 21:01:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 398. [2018-02-02 21:01:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-02 21:01:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 460 transitions. [2018-02-02 21:01:58,943 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 460 transitions. Word has length 157 [2018-02-02 21:01:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:58,943 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 460 transitions. [2018-02-02 21:01:58,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:01:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 460 transitions. [2018-02-02 21:01:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 21:01:58,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:58,944 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:58,944 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1846952971, now seen corresponding path program 31 times [2018-02-02 21:01:58,945 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:58,945 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:58,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:58,945 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:58,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:58,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:59,259 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-02 21:01:59,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:59,260 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:59,260 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:59,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:59,289 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-02 21:01:59,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:59,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-02 21:01:59,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:01:59,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:01:59,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:01:59,290 INFO L87 Difference]: Start difference. First operand 398 states and 460 transitions. Second operand 35 states. [2018-02-02 21:02:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:00,182 INFO L93 Difference]: Finished difference Result 444 states and 509 transitions. [2018-02-02 21:02:00,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 21:02:00,182 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-02-02 21:02:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:00,183 INFO L225 Difference]: With dead ends: 444 [2018-02-02 21:02:00,183 INFO L226 Difference]: Without dead ends: 444 [2018-02-02 21:02:00,183 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-02 21:02:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-02 21:02:00,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2018-02-02 21:02:00,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 21:02:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 474 transitions. [2018-02-02 21:02:00,187 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 474 transitions. Word has length 162 [2018-02-02 21:02:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:00,187 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 474 transitions. [2018-02-02 21:02:00,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:02:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 474 transitions. [2018-02-02 21:02:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-02 21:02:00,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:00,188 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:00,188 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash -156942178, now seen corresponding path program 32 times [2018-02-02 21:02:00,189 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:00,189 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:00,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:00,189 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:00,190 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:00,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:00,780 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-02 21:02:00,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:00,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:00,780 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:02:00,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:02:00,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:00,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:00,836 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-02 21:02:00,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:00,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-02 21:02:00,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:02:00,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:02:00,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:02:00,837 INFO L87 Difference]: Start difference. First operand 410 states and 474 transitions. Second operand 35 states. [2018-02-02 21:02:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:04,741 INFO L93 Difference]: Finished difference Result 457 states and 524 transitions. [2018-02-02 21:02:04,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 21:02:04,741 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-02 21:02:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:04,742 INFO L225 Difference]: With dead ends: 457 [2018-02-02 21:02:04,742 INFO L226 Difference]: Without dead ends: 457 [2018-02-02 21:02:04,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:02:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-02 21:02:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-02-02 21:02:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 21:02:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 488 transitions. [2018-02-02 21:02:04,746 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 488 transitions. Word has length 167 [2018-02-02 21:02:04,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:04,747 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 488 transitions. [2018-02-02 21:02:04,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:02:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 488 transitions. [2018-02-02 21:02:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 21:02:04,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:04,747 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:04,748 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:04,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1361101419, now seen corresponding path program 33 times [2018-02-02 21:02:04,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:04,748 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:04,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:04,748 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:04,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:04,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:05,280 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-02 21:02:05,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:05,281 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:05,281 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:02:05,296 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-02 21:02:05,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:05,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:05,331 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-02 21:02:05,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:05,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-02-02 21:02:05,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:02:05,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:02:05,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:02:05,333 INFO L87 Difference]: Start difference. First operand 422 states and 488 transitions. Second operand 37 states. [2018-02-02 21:02:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:06,348 INFO L93 Difference]: Finished difference Result 470 states and 539 transitions. [2018-02-02 21:02:06,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 21:02:06,348 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-02-02 21:02:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:06,349 INFO L225 Difference]: With dead ends: 470 [2018-02-02 21:02:06,349 INFO L226 Difference]: Without dead ends: 470 [2018-02-02 21:02:06,350 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-02 21:02:06,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-02 21:02:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2018-02-02 21:02:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 21:02:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-02-02 21:02:06,353 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 172 [2018-02-02 21:02:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:06,354 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 502 transitions. [2018-02-02 21:02:06,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:02:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 502 transitions. [2018-02-02 21:02:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-02 21:02:06,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:06,355 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:06,355 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:06,355 INFO L82 PathProgramCache]: Analyzing trace with hash -587218178, now seen corresponding path program 34 times [2018-02-02 21:02:06,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:06,356 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:06,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:06,356 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:06,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:06,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:06,742 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-02 21:02:06,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:06,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:06,742 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:02:06,749 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:02:06,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:06,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:06,788 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-02 21:02:06,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:06,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-02-02 21:02:06,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 21:02:06,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 21:02:06,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 21:02:06,789 INFO L87 Difference]: Start difference. First operand 434 states and 502 transitions. Second operand 38 states. [2018-02-02 21:02:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:07,743 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2018-02-02 21:02:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 21:02:07,743 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-02-02 21:02:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:07,744 INFO L225 Difference]: With dead ends: 483 [2018-02-02 21:02:07,744 INFO L226 Difference]: Without dead ends: 483 [2018-02-02 21:02:07,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 21:02:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-02 21:02:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 446. [2018-02-02 21:02:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-02 21:02:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 516 transitions. [2018-02-02 21:02:07,748 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 516 transitions. Word has length 177 [2018-02-02 21:02:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:07,748 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 516 transitions. [2018-02-02 21:02:07,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 21:02:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 516 transitions. [2018-02-02 21:02:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-02 21:02:07,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:07,749 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:07,749 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash 714553141, now seen corresponding path program 35 times [2018-02-02 21:02:07,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:07,749 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:07,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:07,749 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:07,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:07,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:08,255 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-02 21:02:08,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:08,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:08,256 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:02:08,274 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-02 21:02:08,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:08,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:09,000 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-02 21:02:09,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:09,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 73 [2018-02-02 21:02:09,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-02 21:02:09,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-02 21:02:09,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 21:02:09,002 INFO L87 Difference]: Start difference. First operand 446 states and 516 transitions. Second operand 74 states. [2018-02-02 21:02:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:14,406 INFO L93 Difference]: Finished difference Result 496 states and 569 transitions. [2018-02-02 21:02:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 21:02:14,406 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 182 [2018-02-02 21:02:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:14,407 INFO L225 Difference]: With dead ends: 496 [2018-02-02 21:02:14,407 INFO L226 Difference]: Without dead ends: 496 [2018-02-02 21:02:14,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-02-02 21:02:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-02-02 21:02:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 458. [2018-02-02 21:02:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-02 21:02:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 530 transitions. [2018-02-02 21:02:14,413 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 530 transitions. Word has length 182 [2018-02-02 21:02:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:14,413 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 530 transitions. [2018-02-02 21:02:14,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-02 21:02:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 530 transitions. [2018-02-02 21:02:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 21:02:14,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:14,414 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:14,414 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:14,415 INFO L82 PathProgramCache]: Analyzing trace with hash 325242206, now seen corresponding path program 36 times [2018-02-02 21:02:14,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:14,415 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:14,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:14,415 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:14,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:14,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:14,885 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-02 21:02:14,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:14,885 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:14,886 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:02:14,900 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-02 21:02:14,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:14,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:15,033 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-02 21:02:15,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:15,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-02-02 21:02:15,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 21:02:15,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 21:02:15,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1244, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 21:02:15,034 INFO L87 Difference]: Start difference. First operand 458 states and 530 transitions. Second operand 45 states. [2018-02-02 21:02:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:16,329 INFO L93 Difference]: Finished difference Result 509 states and 584 transitions. [2018-02-02 21:02:16,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 21:02:16,329 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-02-02 21:02:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:16,330 INFO L225 Difference]: With dead ends: 509 [2018-02-02 21:02:16,330 INFO L226 Difference]: Without dead ends: 509 [2018-02-02 21:02:16,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2205, Invalid=4275, Unknown=0, NotChecked=0, Total=6480 [2018-02-02 21:02:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-02 21:02:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 470. [2018-02-02 21:02:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-02-02 21:02:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 544 transitions. [2018-02-02 21:02:16,336 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 544 transitions. Word has length 187 [2018-02-02 21:02:16,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:16,336 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 544 transitions. [2018-02-02 21:02:16,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 21:02:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 544 transitions. [2018-02-02 21:02:16,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-02 21:02:16,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:16,337 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:16,337 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:16,338 INFO L82 PathProgramCache]: Analyzing trace with hash 777758933, now seen corresponding path program 37 times [2018-02-02 21:02:16,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:16,338 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:16,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:16,338 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:16,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:16,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:16,763 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-02 21:02:16,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:16,764 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:16,764 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:16,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:16,795 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-02 21:02:16,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:16,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-02-02 21:02:16,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 21:02:16,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 21:02:16,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:02:16,796 INFO L87 Difference]: Start difference. First operand 470 states and 544 transitions. Second operand 41 states. [2018-02-02 21:02:17,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:17,826 INFO L93 Difference]: Finished difference Result 522 states and 599 transitions. [2018-02-02 21:02:17,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 21:02:17,826 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-02-02 21:02:17,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:17,827 INFO L225 Difference]: With dead ends: 522 [2018-02-02 21:02:17,827 INFO L226 Difference]: Without dead ends: 522 [2018-02-02 21:02:17,827 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-02 21:02:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-02-02 21:02:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 482. [2018-02-02 21:02:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-02-02 21:02:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 558 transitions. [2018-02-02 21:02:17,831 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 558 transitions. Word has length 192 [2018-02-02 21:02:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:17,831 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 558 transitions. [2018-02-02 21:02:17,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 21:02:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 558 transitions. [2018-02-02 21:02:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-02 21:02:17,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:17,833 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:17,833 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1362862146, now seen corresponding path program 38 times [2018-02-02 21:02:17,833 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:17,833 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:17,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:17,834 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:17,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:17,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:18,274 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-02 21:02:18,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:18,275 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:18,275 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:02:18,282 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:02:18,282 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:18,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:18,310 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-02 21:02:18,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:18,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-02-02 21:02:18,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 21:02:18,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 21:02:18,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 21:02:18,311 INFO L87 Difference]: Start difference. First operand 482 states and 558 transitions. Second operand 42 states. [2018-02-02 21:02:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:19,567 INFO L93 Difference]: Finished difference Result 535 states and 614 transitions. [2018-02-02 21:02:19,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 21:02:19,567 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-02-02 21:02:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:19,568 INFO L225 Difference]: With dead ends: 535 [2018-02-02 21:02:19,568 INFO L226 Difference]: Without dead ends: 535 [2018-02-02 21:02:19,568 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-02 21:02:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-02 21:02:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 494. [2018-02-02 21:02:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-02 21:02:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 572 transitions. [2018-02-02 21:02:19,574 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 572 transitions. Word has length 197 [2018-02-02 21:02:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:19,574 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 572 transitions. [2018-02-02 21:02:19,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 21:02:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 572 transitions. [2018-02-02 21:02:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 21:02:19,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:19,575 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:19,575 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1324782197, now seen corresponding path program 39 times [2018-02-02 21:02:19,576 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:19,576 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:19,576 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:19,576 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:19,576 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:19,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:20,039 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-02 21:02:20,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:20,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:20,040 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:02:20,049 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-02 21:02:20,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:20,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:20,075 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-02 21:02:20,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:20,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-02-02 21:02:20,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 21:02:20,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 21:02:20,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 21:02:20,076 INFO L87 Difference]: Start difference. First operand 494 states and 572 transitions. Second operand 43 states. [2018-02-02 21:02:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:21,433 INFO L93 Difference]: Finished difference Result 548 states and 629 transitions. [2018-02-02 21:02:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 21:02:21,434 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-02-02 21:02:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:21,435 INFO L225 Difference]: With dead ends: 548 [2018-02-02 21:02:21,435 INFO L226 Difference]: Without dead ends: 548 [2018-02-02 21:02:21,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 21:02:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-02-02 21:02:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 506. [2018-02-02 21:02:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-02-02 21:02:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 586 transitions. [2018-02-02 21:02:21,439 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 586 transitions. Word has length 202 [2018-02-02 21:02:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:21,439 INFO L432 AbstractCegarLoop]: Abstraction has 506 states and 586 transitions. [2018-02-02 21:02:21,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 21:02:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 586 transitions. [2018-02-02 21:02:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 21:02:21,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:21,440 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:21,440 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:21,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2003142114, now seen corresponding path program 40 times [2018-02-02 21:02:21,441 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:21,441 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:21,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:21,441 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:21,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:21,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:21,927 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-02 21:02:21,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:21,927 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:21,927 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:02:21,934 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:02:21,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:21,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:21,964 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-02 21:02:21,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:21,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-02-02 21:02:21,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 21:02:21,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 21:02:21,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 21:02:21,965 INFO L87 Difference]: Start difference. First operand 506 states and 586 transitions. Second operand 44 states. [2018-02-02 21:02:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:23,758 INFO L93 Difference]: Finished difference Result 561 states and 644 transitions. [2018-02-02 21:02:23,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 21:02:23,758 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-02-02 21:02:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:23,759 INFO L225 Difference]: With dead ends: 561 [2018-02-02 21:02:23,759 INFO L226 Difference]: Without dead ends: 561 [2018-02-02 21:02:23,759 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-02 21:02:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-02 21:02:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 518. [2018-02-02 21:02:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-02-02 21:02:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 600 transitions. [2018-02-02 21:02:23,763 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 600 transitions. Word has length 207 [2018-02-02 21:02:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:23,764 INFO L432 AbstractCegarLoop]: Abstraction has 518 states and 600 transitions. [2018-02-02 21:02:23,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 21:02:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 600 transitions. [2018-02-02 21:02:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-02 21:02:23,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:23,765 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:23,765 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash 749859861, now seen corresponding path program 41 times [2018-02-02 21:02:23,765 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:23,765 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:23,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:23,766 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:23,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:23,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:24,257 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-02 21:02:24,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:24,257 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:24,257 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:02:24,270 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-02 21:02:24,270 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:24,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:24,899 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-02 21:02:24,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:24,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 85 [2018-02-02 21:02:24,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-02-02 21:02:24,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-02-02 21:02:24,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-02-02 21:02:24,901 INFO L87 Difference]: Start difference. First operand 518 states and 600 transitions. Second operand 86 states. [2018-02-02 21:02:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:30,432 INFO L93 Difference]: Finished difference Result 574 states and 659 transitions. [2018-02-02 21:02:30,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 21:02:30,433 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 212 [2018-02-02 21:02:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:30,434 INFO L225 Difference]: With dead ends: 574 [2018-02-02 21:02:30,434 INFO L226 Difference]: Without dead ends: 574 [2018-02-02 21:02:30,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-02-02 21:02:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-02 21:02:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 530. [2018-02-02 21:02:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-02 21:02:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 614 transitions. [2018-02-02 21:02:30,437 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 614 transitions. Word has length 212 [2018-02-02 21:02:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:30,437 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 614 transitions. [2018-02-02 21:02:30,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-02-02 21:02:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 614 transitions. [2018-02-02 21:02:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-02 21:02:30,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:30,438 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:30,438 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1629807490, now seen corresponding path program 42 times [2018-02-02 21:02:30,438 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:30,438 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:30,439 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:30,439 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:30,439 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:30,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:30,946 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-02 21:02:30,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:30,946 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:30,947 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:02:30,960 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-02 21:02:30,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:30,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:31,089 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-02 21:02:31,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:31,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 48 [2018-02-02 21:02:31,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 21:02:31,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 21:02:31,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=1388, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 21:02:31,090 INFO L87 Difference]: Start difference. First operand 530 states and 614 transitions. Second operand 49 states. [2018-02-02 21:02:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:32,641 INFO L93 Difference]: Finished difference Result 587 states and 674 transitions. [2018-02-02 21:02:32,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 21:02:32,641 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-02-02 21:02:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:32,643 INFO L225 Difference]: With dead ends: 587 [2018-02-02 21:02:32,643 INFO L226 Difference]: Without dead ends: 587 [2018-02-02 21:02:32,643 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2936, Invalid=5254, Unknown=0, NotChecked=0, Total=8190 [2018-02-02 21:02:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-02 21:02:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 542. [2018-02-02 21:02:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-02-02 21:02:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 628 transitions. [2018-02-02 21:02:32,646 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 628 transitions. Word has length 217 [2018-02-02 21:02:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:32,646 INFO L432 AbstractCegarLoop]: Abstraction has 542 states and 628 transitions. [2018-02-02 21:02:32,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 21:02:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 628 transitions. [2018-02-02 21:02:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-02 21:02:32,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:32,647 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:32,647 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 324521397, now seen corresponding path program 43 times [2018-02-02 21:02:32,647 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:32,647 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:32,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:32,648 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:32,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:32,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:33,236 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-02 21:02:33,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:33,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:33,237 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:33,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:33,270 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-02 21:02:33,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:33,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-02-02 21:02:33,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 21:02:33,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 21:02:33,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 21:02:33,271 INFO L87 Difference]: Start difference. First operand 542 states and 628 transitions. Second operand 47 states. [2018-02-02 21:02:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:34,595 INFO L93 Difference]: Finished difference Result 600 states and 689 transitions. [2018-02-02 21:02:34,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 21:02:34,595 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-02-02 21:02:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:34,596 INFO L225 Difference]: With dead ends: 600 [2018-02-02 21:02:34,596 INFO L226 Difference]: Without dead ends: 600 [2018-02-02 21:02:34,597 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-02 21:02:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-02-02 21:02:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 554. [2018-02-02 21:02:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-02-02 21:02:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 642 transitions. [2018-02-02 21:02:34,600 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 642 transitions. Word has length 222 [2018-02-02 21:02:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:34,601 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 642 transitions. [2018-02-02 21:02:34,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 21:02:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 642 transitions. [2018-02-02 21:02:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-02 21:02:34,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:34,602 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:34,602 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1945913054, now seen corresponding path program 44 times [2018-02-02 21:02:34,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:34,602 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:34,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:34,602 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:34,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:34,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:35,211 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-02 21:02:35,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:35,211 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:35,212 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:02:35,218 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:02:35,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:35,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:35,354 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-02 21:02:35,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:35,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-02-02 21:02:35,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 21:02:35,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 21:02:35,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 21:02:35,355 INFO L87 Difference]: Start difference. First operand 554 states and 642 transitions. Second operand 55 states. [2018-02-02 21:02:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:37,280 INFO L93 Difference]: Finished difference Result 613 states and 704 transitions. [2018-02-02 21:02:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 21:02:37,280 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2018-02-02 21:02:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:37,281 INFO L225 Difference]: With dead ends: 613 [2018-02-02 21:02:37,282 INFO L226 Difference]: Without dead ends: 613 [2018-02-02 21:02:37,282 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-02 21:02:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-02-02 21:02:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 566. [2018-02-02 21:02:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-02-02 21:02:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 656 transitions. [2018-02-02 21:02:37,287 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 656 transitions. Word has length 227 [2018-02-02 21:02:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:37,287 INFO L432 AbstractCegarLoop]: Abstraction has 566 states and 656 transitions. [2018-02-02 21:02:37,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 21:02:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 656 transitions. [2018-02-02 21:02:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-02 21:02:37,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:37,288 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:37,288 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:37,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1707991211, now seen corresponding path program 45 times [2018-02-02 21:02:37,288 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:37,288 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:37,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:37,289 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:37,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:37,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:37,923 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-02 21:02:37,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:37,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:37,924 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:02:37,937 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-02 21:02:37,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:37,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:37,978 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-02 21:02:37,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:37,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-02-02 21:02:37,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 21:02:37,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 21:02:37,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 21:02:37,979 INFO L87 Difference]: Start difference. First operand 566 states and 656 transitions. Second operand 49 states. [2018-02-02 21:02:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:39,348 INFO L93 Difference]: Finished difference Result 626 states and 719 transitions. [2018-02-02 21:02:39,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 21:02:39,348 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-02-02 21:02:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:39,349 INFO L225 Difference]: With dead ends: 626 [2018-02-02 21:02:39,349 INFO L226 Difference]: Without dead ends: 626 [2018-02-02 21:02:39,350 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-02-02 21:02:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-02-02 21:02:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 578. [2018-02-02 21:02:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-02 21:02:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 670 transitions. [2018-02-02 21:02:39,354 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 670 transitions. Word has length 232 [2018-02-02 21:02:39,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:39,354 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 670 transitions. [2018-02-02 21:02:39,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 21:02:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 670 transitions. [2018-02-02 21:02:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-02 21:02:39,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:39,355 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:39,355 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:39,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1861482814, now seen corresponding path program 46 times [2018-02-02 21:02:39,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:39,355 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:39,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:39,355 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:39,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:39,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:39,966 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-02 21:02:39,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:39,966 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:39,966 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:02:39,974 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:02:39,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:39,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:40,028 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-02 21:02:40,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:40,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-02-02 21:02:40,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 21:02:40,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 21:02:40,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 21:02:40,030 INFO L87 Difference]: Start difference. First operand 578 states and 670 transitions. Second operand 50 states. [2018-02-02 21:02:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:41,619 INFO L93 Difference]: Finished difference Result 639 states and 734 transitions. [2018-02-02 21:02:41,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 21:02:41,619 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-02-02 21:02:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:41,620 INFO L225 Difference]: With dead ends: 639 [2018-02-02 21:02:41,620 INFO L226 Difference]: Without dead ends: 639 [2018-02-02 21:02:41,621 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-02 21:02:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-02-02 21:02:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 590. [2018-02-02 21:02:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-02-02 21:02:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 684 transitions. [2018-02-02 21:02:41,624 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 684 transitions. Word has length 237 [2018-02-02 21:02:41,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:41,624 INFO L432 AbstractCegarLoop]: Abstraction has 590 states and 684 transitions. [2018-02-02 21:02:41,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 21:02:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 684 transitions. [2018-02-02 21:02:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-02 21:02:41,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:41,625 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:41,625 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:02:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1141565685, now seen corresponding path program 47 times [2018-02-02 21:02:41,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:41,626 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:41,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:41,626 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:02:41,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:41,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:42,295 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-02 21:02:42,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:42,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:42,296 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:02:42,311 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-02 21:02:42,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:02:42,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:43,038 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-02 21:02:43,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:43,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 97 [2018-02-02 21:02:43,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-02-02 21:02:43,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-02-02 21:02:43,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-02-02 21:02:43,040 INFO L87 Difference]: Start difference. First operand 590 states and 684 transitions. Second operand 98 states. Received shutdown request... [2018-02-02 21:02:46,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 21:02:46,649 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 21:02:46,655 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 21:02:46,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:02:46 BoogieIcfgContainer [2018-02-02 21:02:46,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 21:02:46,656 INFO L168 Benchmark]: Toolchain (without parser) took 78365.97 ms. Allocated memory was 404.8 MB in the beginning and 1.2 GB in the end (delta: 815.8 MB). Free memory was 360.0 MB in the beginning and 1.1 GB in the end (delta: -702.4 MB). Peak memory consumption was 113.4 MB. Max. memory is 5.3 GB. [2018-02-02 21:02:46,657 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:02:46,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 123.30 ms. Allocated memory is still 404.8 MB. Free memory was 360.0 MB in the beginning and 351.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-02 21:02:46,658 INFO L168 Benchmark]: Boogie Preprocessor took 19.41 ms. Allocated memory is still 404.8 MB. Free memory was 351.9 MB in the beginning and 350.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:02:46,658 INFO L168 Benchmark]: RCFGBuilder took 127.41 ms. Allocated memory is still 404.8 MB. Free memory was 350.6 MB in the beginning and 337.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 21:02:46,658 INFO L168 Benchmark]: TraceAbstraction took 78092.58 ms. Allocated memory was 404.8 MB in the beginning and 1.2 GB in the end (delta: 815.8 MB). Free memory was 337.4 MB in the beginning and 1.1 GB in the end (delta: -725.0 MB). Peak memory consumption was 90.8 MB. Max. memory is 5.3 GB. [2018-02-02 21:02:46,659 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.14 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 123.30 ms. Allocated memory is still 404.8 MB. Free memory was 360.0 MB in the beginning and 351.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.41 ms. Allocated memory is still 404.8 MB. Free memory was 351.9 MB in the beginning and 350.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 127.41 ms. Allocated memory is still 404.8 MB. Free memory was 350.6 MB in the beginning and 337.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 78092.58 ms. Allocated memory was 404.8 MB in the beginning and 1.2 GB in the end (delta: 815.8 MB). Free memory was 337.4 MB in the beginning and 1.1 GB in the end (delta: -725.0 MB). Peak memory consumption was 90.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (590states) and interpolant automaton (currently 50 states, 98 states before enhancement), while ReachableStatesComputation was computing reachable states (376 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (590states) and interpolant automaton (currently 50 states, 98 states before enhancement), while ReachableStatesComputation was computing reachable states (376 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (590states) and interpolant automaton (currently 50 states, 98 states before enhancement), while ReachableStatesComputation was computing reachable states (376 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (590states) and interpolant automaton (currently 50 states, 98 states before enhancement), while ReachableStatesComputation was computing reachable states (376 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (590states) and interpolant automaton (currently 50 states, 98 states before enhancement), while ReachableStatesComputation was computing reachable states (376 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (590states) and interpolant automaton (currently 50 states, 98 states before enhancement), while ReachableStatesComputation was computing reachable states (376 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. TIMEOUT Result, 78.0s OverallTime, 48 OverallIterations, 48 TraceHistogramMax, 57.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3639 SDtfs, 33988 SDslu, 42015 SDs, 0 SdLazy, 150387 SolverSat, 12687 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7970 GetRequests, 5639 SyntacticMatches, 6 SemanticMatches, 2325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32539 ImplicationChecksByTransitivity, 25.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 47 MinimizatonAttempts, 1222 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 11945 NumberOfCodeBlocks, 11945 NumberOfCodeBlocksAsserted, 679 NumberOfCheckSat, 11850 ConstructedInterpolants, 0 QuantifiedInterpolants, 7067060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13066 ConjunctsInSsa, 1672 ConjunctsInUnsatCore, 95 InterpolantComputations, 1 PerfectInterpolantSequences, 0/177472 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_21-02-46-668.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_21-02-46-668.csv Completed graceful shutdown