java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_nondet.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:04:52,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:04:52,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:04:52,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:04:52,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:04:52,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:04:52,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:04:52,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:04:52,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:04:52,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:04:52,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:04:52,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:04:52,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:04:52,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:04:52,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:04:52,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:04:52,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:04:52,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:04:52,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:04:52,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:04:52,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:04:52,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:04:52,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:04:52,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:04:52,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:04:52,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:04:52,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:04:52,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:04:52,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:04:52,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:04:52,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:04:52,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:04:52,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:04:52,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:04:52,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:04:52,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:04:52,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:04:52,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:04:52,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:04:52,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:04:52,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:04:52,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 12:04:52,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:04:52,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:04:52,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 12:04:52,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 12:04:52,074 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 12:04:52,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:04:52,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:04:52,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 12:04:52,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:04:52,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:04:52,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:04:52,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:04:52,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:04:52,075 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:04:52,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:04:52,076 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 12:04:52,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:04:52,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:04:52,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:04:52,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 12:04:52,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 12:04:52,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:04:52,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:04:52,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:04:52,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 12:04:52,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 12:04:52,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:04:52,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:04:52,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 12:04:52,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:04:52,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:04:52,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:04:52,127 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:04:52,128 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:04:52,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_nondet.i [2019-09-05 12:04:52,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba079c50/aedabc70fe544e9caa016fb2a6282d7f/FLAG9db94a6c5 [2019-09-05 12:04:52,667 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:04:52,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_nondet.i [2019-09-05 12:04:52,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba079c50/aedabc70fe544e9caa016fb2a6282d7f/FLAG9db94a6c5 [2019-09-05 12:04:53,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba079c50/aedabc70fe544e9caa016fb2a6282d7f [2019-09-05 12:04:53,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:04:53,125 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:04:53,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:04:53,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:04:53,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:04:53,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:04:53" (1/1) ... [2019-09-05 12:04:53,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b72dff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53, skipping insertion in model container [2019-09-05 12:04:53,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:04:53" (1/1) ... [2019-09-05 12:04:53,139 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:04:53,154 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:04:53,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:04:53,336 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:04:53,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:04:53,362 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:04:53,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53 WrapperNode [2019-09-05 12:04:53,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:04:53,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:04:53,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:04:53,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:04:53,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53" (1/1) ... [2019-09-05 12:04:53,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53" (1/1) ... [2019-09-05 12:04:53,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53" (1/1) ... [2019-09-05 12:04:53,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53" (1/1) ... [2019-09-05 12:04:53,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53" (1/1) ... [2019-09-05 12:04:53,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53" (1/1) ... [2019-09-05 12:04:53,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53" (1/1) ... [2019-09-05 12:04:53,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:04:53,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:04:53,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:04:53,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:04:53,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-05 12:04:53,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:04:53,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:04:53,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:04:53,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:04:53,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:04:53,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 12:04:53,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:04:53,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 12:04:53,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:04:53,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:04:53,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:04:53,689 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:04:53,689 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 12:04:53,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:04:53 BoogieIcfgContainer [2019-09-05 12:04:53,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:04:53,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:04:53,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:04:53,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:04:53,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:04:53" (1/3) ... [2019-09-05 12:04:53,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f5e707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:04:53, skipping insertion in model container [2019-09-05 12:04:53,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:04:53" (2/3) ... [2019-09-05 12:04:53,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f5e707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:04:53, skipping insertion in model container [2019-09-05 12:04:53,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:04:53" (3/3) ... [2019-09-05 12:04:53,701 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i [2019-09-05 12:04:53,723 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:04:53,738 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:04:53,762 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:04:53,808 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 12:04:53,809 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:04:53,810 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 12:04:53,810 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:04:53,810 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:04:53,810 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:04:53,810 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:04:53,810 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:04:53,811 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:04:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-05 12:04:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:04:53,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:53,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:53,841 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1137787585, now seen corresponding path program 1 times [2019-09-05 12:04:53,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:53,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:53,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:53,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:53,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:53,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:04:53,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:04:53,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:04:53,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:04:53,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:04:53,968 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-05 12:04:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:53,988 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-09-05 12:04:53,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:04:53,990 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 12:04:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:53,997 INFO L225 Difference]: With dead ends: 31 [2019-09-05 12:04:53,998 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 12:04:54,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:04:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 12:04:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 12:04:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 12:04:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-05 12:04:54,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-05 12:04:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:54,035 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-05 12:04:54,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:04:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-05 12:04:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:04:54,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:54,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:54,037 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:54,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1130399417, now seen corresponding path program 1 times [2019-09-05 12:04:54,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:54,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:54,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:54,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:04:54,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:04:54,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:04:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:04:54,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:04:54,082 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-05 12:04:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:54,109 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-05 12:04:54,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:04:54,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 12:04:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:54,111 INFO L225 Difference]: With dead ends: 19 [2019-09-05 12:04:54,112 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 12:04:54,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:04:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 12:04:54,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-05 12:04:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 12:04:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-05 12:04:54,118 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-05 12:04:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:54,118 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-05 12:04:54,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:04:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-05 12:04:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 12:04:54,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:54,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:54,120 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:54,120 INFO L82 PathProgramCache]: Analyzing trace with hash 820627669, now seen corresponding path program 1 times [2019-09-05 12:04:54,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:54,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:54,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:54,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:54,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:54,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:54,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 12:04:54,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:54,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-05 12:04:54,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:04:54,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:04:54,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:04:54,246 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-05 12:04:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:54,274 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-05 12:04:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:04:54,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 12:04:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:54,276 INFO L225 Difference]: With dead ends: 20 [2019-09-05 12:04:54,276 INFO L226 Difference]: Without dead ends: 15 [2019-09-05 12:04:54,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:04:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-05 12:04:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-05 12:04:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 12:04:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-05 12:04:54,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-05 12:04:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:54,281 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-05 12:04:54,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:04:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-05 12:04:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:04:54,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:54,283 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:54,283 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash -517278735, now seen corresponding path program 2 times [2019-09-05 12:04:54,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:54,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:54,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:54,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:54,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:54,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:54,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 12:04:54,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:54,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:54,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-09-05 12:04:54,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:04:54,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:04:54,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:04:54,458 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2019-09-05 12:04:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:54,513 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-05 12:04:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:04:54,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-09-05 12:04:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:54,515 INFO L225 Difference]: With dead ends: 23 [2019-09-05 12:04:54,515 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 12:04:54,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:04:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 12:04:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-05 12:04:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 12:04:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-05 12:04:54,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-05 12:04:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:54,520 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-05 12:04:54,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:04:54,521 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-05 12:04:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 12:04:54,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:54,522 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:54,522 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash -2050111475, now seen corresponding path program 3 times [2019-09-05 12:04:54,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:54,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:54,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:54,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:54,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:54,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 12:04:54,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:54,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 12:04:54,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:54,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:54,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-09-05 12:04:54,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 12:04:54,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 12:04:54,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:04:54,724 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-05 12:04:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:54,777 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-05 12:04:54,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:04:54,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-05 12:04:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:54,779 INFO L225 Difference]: With dead ends: 25 [2019-09-05 12:04:54,779 INFO L226 Difference]: Without dead ends: 20 [2019-09-05 12:04:54,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:04:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-05 12:04:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-05 12:04:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 12:04:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-05 12:04:54,785 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-05 12:04:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:54,786 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-05 12:04:54,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 12:04:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-05 12:04:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 12:04:54,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:54,787 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:54,787 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:54,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:54,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1928592087, now seen corresponding path program 4 times [2019-09-05 12:04:54,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:54,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:54,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:54,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:54,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:54,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:54,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:54,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 12:04:54,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:54,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:54,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-05 12:04:54,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 12:04:54,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 12:04:54,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:04:54,987 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2019-09-05 12:04:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:55,040 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-05 12:04:55,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:04:55,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-09-05 12:04:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:55,041 INFO L225 Difference]: With dead ends: 27 [2019-09-05 12:04:55,041 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 12:04:55,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:04:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 12:04:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-05 12:04:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 12:04:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-05 12:04:55,046 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-05 12:04:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:55,047 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-05 12:04:55,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 12:04:55,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-05 12:04:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 12:04:55,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:55,048 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:55,048 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:55,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1112577211, now seen corresponding path program 5 times [2019-09-05 12:04:55,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:55,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:55,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:55,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:55,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:55,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:55,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:55,163 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:55,181 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-05 12:04:55,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:55,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 12:04:55,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:55,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:55,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:55,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-09-05 12:04:55,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:04:55,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:04:55,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:04:55,225 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-09-05 12:04:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:55,276 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-05 12:04:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 12:04:55,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-05 12:04:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:55,277 INFO L225 Difference]: With dead ends: 29 [2019-09-05 12:04:55,278 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 12:04:55,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:04:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 12:04:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-05 12:04:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 12:04:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-05 12:04:55,290 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-05 12:04:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:55,290 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-05 12:04:55,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:04:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-05 12:04:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 12:04:55,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:55,296 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:55,296 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:55,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1393670753, now seen corresponding path program 6 times [2019-09-05 12:04:55,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:55,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:55,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:55,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:55,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:55,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:04:55,429 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:55,448 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 12:04:55,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:55,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:04:55,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:55,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:55,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:55,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-09-05 12:04:55,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 12:04:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 12:04:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:04:55,490 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2019-09-05 12:04:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:55,555 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-05 12:04:55,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 12:04:55,557 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-09-05 12:04:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:55,558 INFO L225 Difference]: With dead ends: 31 [2019-09-05 12:04:55,558 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 12:04:55,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:04:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 12:04:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-05 12:04:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 12:04:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-05 12:04:55,569 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-05 12:04:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:55,569 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-05 12:04:55,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 12:04:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-05 12:04:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 12:04:55,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:55,571 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:55,571 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:55,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:55,571 INFO L82 PathProgramCache]: Analyzing trace with hash 421311101, now seen corresponding path program 7 times [2019-09-05 12:04:55,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:55,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:55,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:55,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:55,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:55,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:55,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:55,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:55,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 12:04:55,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:55,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:55,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:55,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-09-05 12:04:55,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:04:55,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:04:55,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:04:55,800 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-09-05 12:04:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:55,841 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-05 12:04:55,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 12:04:55,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-09-05 12:04:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:55,842 INFO L225 Difference]: With dead ends: 33 [2019-09-05 12:04:55,842 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 12:04:55,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:04:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 12:04:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-05 12:04:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 12:04:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-05 12:04:55,848 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-05 12:04:55,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:55,848 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-05 12:04:55,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:04:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-05 12:04:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 12:04:55,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:55,849 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:55,849 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:55,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2008411239, now seen corresponding path program 8 times [2019-09-05 12:04:55,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:55,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:55,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:55,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:55,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:55,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:55,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:04:55,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:56,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:56,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:56,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 12:04:56,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:56,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:56,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:56,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-09-05 12:04:56,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 12:04:56,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 12:04:56,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:04:56,063 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-09-05 12:04:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:56,109 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-05 12:04:56,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 12:04:56,109 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-09-05 12:04:56,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:56,110 INFO L225 Difference]: With dead ends: 35 [2019-09-05 12:04:56,110 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 12:04:56,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-05 12:04:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 12:04:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-05 12:04:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 12:04:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-05 12:04:56,116 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-05 12:04:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:56,117 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-05 12:04:56,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 12:04:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-05 12:04:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 12:04:56,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:56,118 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:56,118 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:56,119 INFO L82 PathProgramCache]: Analyzing trace with hash -509370955, now seen corresponding path program 9 times [2019-09-05 12:04:56,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:56,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:56,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:56,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:56,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:56,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:56,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:56,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:56,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 12:04:56,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:56,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 12:04:56,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:56,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:56,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:56,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2019-09-05 12:04:56,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:04:56,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:04:56,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-05 12:04:56,364 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-09-05 12:04:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:56,427 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-05 12:04:56,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 12:04:56,428 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-09-05 12:04:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:56,429 INFO L225 Difference]: With dead ends: 37 [2019-09-05 12:04:56,429 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 12:04:56,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:04:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 12:04:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-05 12:04:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 12:04:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-05 12:04:56,439 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-05 12:04:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:56,441 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-05 12:04:56,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:04:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-05 12:04:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 12:04:56,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:56,444 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:56,445 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:56,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1254297809, now seen corresponding path program 10 times [2019-09-05 12:04:56,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:56,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:56,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:56,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:56,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:56,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:56,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:04:56,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:56,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:56,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:56,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:04:56,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:56,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:56,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:56,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-09-05 12:04:56,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 12:04:56,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 12:04:56,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:04:56,696 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2019-09-05 12:04:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:56,739 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-05 12:04:56,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 12:04:56,740 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-09-05 12:04:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:56,741 INFO L225 Difference]: With dead ends: 39 [2019-09-05 12:04:56,741 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 12:04:56,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-05 12:04:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 12:04:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-05 12:04:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 12:04:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-05 12:04:56,748 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-05 12:04:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:56,748 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-05 12:04:56,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 12:04:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-05 12:04:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 12:04:56,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:56,750 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:56,750 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash -372101907, now seen corresponding path program 11 times [2019-09-05 12:04:56,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:56,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:56,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:56,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:56,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:04:56,913 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:56,944 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-05 12:04:56,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:56,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 12:04:56,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:56,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:56,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:56,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2019-09-05 12:04:56,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 12:04:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 12:04:56,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-05 12:04:56,984 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-09-05 12:04:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:57,033 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-05 12:04:57,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 12:04:57,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-09-05 12:04:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:57,034 INFO L225 Difference]: With dead ends: 41 [2019-09-05 12:04:57,034 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 12:04:57,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:04:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 12:04:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-05 12:04:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 12:04:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-05 12:04:57,040 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-05 12:04:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:57,040 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-05 12:04:57,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 12:04:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-05 12:04:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 12:04:57,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:57,041 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:57,042 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:57,042 INFO L82 PathProgramCache]: Analyzing trace with hash 25866761, now seen corresponding path program 12 times [2019-09-05 12:04:57,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:57,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:57,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:57,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:57,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:57,218 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:57,258 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 12:04:57,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:57,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 12:04:57,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:57,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:57,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:57,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-09-05 12:04:57,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 12:04:57,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 12:04:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:04:57,316 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2019-09-05 12:04:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:57,377 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-05 12:04:57,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:04:57,377 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-09-05 12:04:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:57,378 INFO L225 Difference]: With dead ends: 43 [2019-09-05 12:04:57,378 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 12:04:57,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:04:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 12:04:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-05 12:04:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 12:04:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-05 12:04:57,383 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-05 12:04:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:57,384 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-05 12:04:57,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 12:04:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-05 12:04:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 12:04:57,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:57,385 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:57,385 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:57,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 221667365, now seen corresponding path program 13 times [2019-09-05 12:04:57,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:57,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:57,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:57,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:57,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:57,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:57,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 12:04:57,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:57,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:57,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:57,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2019-09-05 12:04:57,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 12:04:57,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 12:04:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:04:57,624 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-09-05 12:04:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:57,680 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-05 12:04:57,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 12:04:57,681 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-09-05 12:04:57,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:57,681 INFO L225 Difference]: With dead ends: 45 [2019-09-05 12:04:57,682 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 12:04:57,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:04:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 12:04:57,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-05 12:04:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 12:04:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-05 12:04:57,688 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-05 12:04:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:57,688 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-05 12:04:57,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 12:04:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-05 12:04:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 12:04:57,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:57,689 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:57,689 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:57,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:57,690 INFO L82 PathProgramCache]: Analyzing trace with hash -592513215, now seen corresponding path program 14 times [2019-09-05 12:04:57,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:57,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:57,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:57,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:57,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:57,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:57,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:57,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:57,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:57,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:57,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 12:04:57,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:57,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:57,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:57,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-09-05 12:04:57,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:04:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:04:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:04:57,950 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2019-09-05 12:04:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:58,000 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-05 12:04:58,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 12:04:58,000 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-09-05 12:04:58,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:58,001 INFO L225 Difference]: With dead ends: 47 [2019-09-05 12:04:58,001 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 12:04:58,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2019-09-05 12:04:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 12:04:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-05 12:04:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 12:04:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-05 12:04:58,007 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-05 12:04:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:58,007 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-05 12:04:58,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:04:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-05 12:04:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 12:04:58,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:58,008 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:58,008 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:58,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:58,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1336002723, now seen corresponding path program 15 times [2019-09-05 12:04:58,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:58,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:58,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:58,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:58,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:58,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:58,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 12:04:58,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:58,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 12:04:58,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:58,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:58,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:58,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2019-09-05 12:04:58,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 12:04:58,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 12:04:58,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-05 12:04:58,294 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-09-05 12:04:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:58,341 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-05 12:04:58,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 12:04:58,341 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-09-05 12:04:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:58,342 INFO L225 Difference]: With dead ends: 49 [2019-09-05 12:04:58,342 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 12:04:58,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:04:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 12:04:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-05 12:04:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 12:04:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-05 12:04:58,347 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-05 12:04:58,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:58,348 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-05 12:04:58,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 12:04:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-05 12:04:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 12:04:58,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:58,349 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:58,349 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:58,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:58,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1430118521, now seen corresponding path program 16 times [2019-09-05 12:04:58,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:58,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:58,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:58,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:58,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:58,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:58,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:04:58,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:58,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:58,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:58,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:04:58,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:58,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:58,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:58,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-09-05 12:04:58,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 12:04:58,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 12:04:58,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:04:58,653 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2019-09-05 12:04:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:58,708 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-05 12:04:58,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 12:04:58,708 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-09-05 12:04:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:58,709 INFO L225 Difference]: With dead ends: 51 [2019-09-05 12:04:58,709 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 12:04:58,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-05 12:04:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 12:04:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-05 12:04:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 12:04:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-05 12:04:58,714 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-05 12:04:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:58,715 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-05 12:04:58,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 12:04:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-05 12:04:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 12:04:58,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:58,716 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:58,716 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:58,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1087877781, now seen corresponding path program 17 times [2019-09-05 12:04:58,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:58,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:58,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:58,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:58,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:58,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:58,966 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:59,004 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-05 12:04:59,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:59,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 12:04:59,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:59,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:59,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:59,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2019-09-05 12:04:59,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:04:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:04:59,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-05 12:04:59,051 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-09-05 12:04:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:59,118 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-05 12:04:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 12:04:59,118 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-09-05 12:04:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:59,119 INFO L225 Difference]: With dead ends: 53 [2019-09-05 12:04:59,119 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 12:04:59,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:04:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 12:04:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-05 12:04:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 12:04:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-05 12:04:59,125 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-05 12:04:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:59,126 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-05 12:04:59,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:04:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-05 12:04:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 12:04:59,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:59,127 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:59,127 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:59,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1387958863, now seen corresponding path program 18 times [2019-09-05 12:04:59,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:59,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:59,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:59,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:59,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:59,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:59,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:59,403 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:59,454 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 12:04:59,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:59,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:04:59,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:04:59,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:59,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-09-05 12:04:59,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 12:04:59,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 12:04:59,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:04:59,505 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2019-09-05 12:04:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:59,563 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-05 12:04:59,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 12:04:59,568 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-09-05 12:04:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:59,569 INFO L225 Difference]: With dead ends: 55 [2019-09-05 12:04:59,569 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 12:04:59,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:04:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 12:04:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-05 12:04:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 12:04:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-05 12:04:59,574 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-05 12:04:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:59,574 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-05 12:04:59,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 12:04:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-05 12:04:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 12:04:59,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:59,575 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:59,575 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1255091763, now seen corresponding path program 19 times [2019-09-05 12:04:59,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:59,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:59,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:59,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:59,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:04:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:59,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 12:04:59,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:59,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:59,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:59,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2019-09-05 12:04:59,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 12:04:59,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 12:04:59,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:04:59,988 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-09-05 12:05:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:00,045 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-05 12:05:00,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 12:05:00,045 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-09-05 12:05:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:00,046 INFO L225 Difference]: With dead ends: 57 [2019-09-05 12:05:00,046 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 12:05:00,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:05:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 12:05:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-05 12:05:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 12:05:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-05 12:05:00,051 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-05 12:05:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:00,051 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-05 12:05:00,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 12:05:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-05 12:05:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 12:05:00,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:00,052 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:00,052 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1876139753, now seen corresponding path program 20 times [2019-09-05 12:05:00,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:00,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:00,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:00,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:00,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:00,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:00,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:00,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:00,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 12:05:00,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:00,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:00,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:00,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-09-05 12:05:00,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 12:05:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 12:05:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:05:00,435 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2019-09-05 12:05:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:00,507 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-05 12:05:00,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 12:05:00,510 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-09-05 12:05:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:00,511 INFO L225 Difference]: With dead ends: 59 [2019-09-05 12:05:00,511 INFO L226 Difference]: Without dead ends: 54 [2019-09-05 12:05:00,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:05:00,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-05 12:05:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-05 12:05:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-05 12:05:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-05 12:05:00,516 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-05 12:05:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:00,516 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-05 12:05:00,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 12:05:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-05 12:05:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 12:05:00,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:00,516 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:00,517 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:00,517 INFO L82 PathProgramCache]: Analyzing trace with hash 217552133, now seen corresponding path program 21 times [2019-09-05 12:05:00,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:00,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:00,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:00,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:00,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:00,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:00,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:00,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:00,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-05 12:05:00,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:00,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 12:05:00,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:00,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:00,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:00,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2019-09-05 12:05:00,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 12:05:00,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 12:05:00,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:05:00,958 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-09-05 12:05:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:01,026 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-05 12:05:01,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 12:05:01,026 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-09-05 12:05:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:01,028 INFO L225 Difference]: With dead ends: 61 [2019-09-05 12:05:01,028 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 12:05:01,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:05:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 12:05:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-05 12:05:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 12:05:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-05 12:05:01,033 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-05 12:05:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:01,033 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-05 12:05:01,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 12:05:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-05 12:05:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 12:05:01,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:01,034 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:01,034 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash -252283871, now seen corresponding path program 22 times [2019-09-05 12:05:01,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:01,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:01,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:01,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:01,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:01,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:01,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:01,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:01,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:01,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:01,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:05:01,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:01,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:01,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:01,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-09-05 12:05:01,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 12:05:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 12:05:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:05:01,462 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2019-09-05 12:05:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:01,523 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-05 12:05:01,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 12:05:01,523 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-09-05 12:05:01,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:01,524 INFO L225 Difference]: With dead ends: 63 [2019-09-05 12:05:01,524 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 12:05:01,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2019-09-05 12:05:01,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 12:05:01,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-05 12:05:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 12:05:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-05 12:05:01,534 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-05 12:05:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:01,534 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-05 12:05:01,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 12:05:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-05 12:05:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 12:05:01,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:01,535 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:01,535 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:01,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash -793117635, now seen corresponding path program 23 times [2019-09-05 12:05:01,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:01,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:01,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:01,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:01,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:01,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:01,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:01,862 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:01,918 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-05 12:05:01,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:01,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 12:05:01,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:01,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:05:01,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:01,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2019-09-05 12:05:01,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 12:05:01,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 12:05:01,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2019-09-05 12:05:01,992 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-09-05 12:05:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:02,064 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-05 12:05:02,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 12:05:02,065 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-09-05 12:05:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:02,066 INFO L225 Difference]: With dead ends: 65 [2019-09-05 12:05:02,066 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 12:05:02,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:05:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 12:05:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-05 12:05:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 12:05:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-05 12:05:02,070 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-05 12:05:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:02,071 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-05 12:05:02,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 12:05:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-05 12:05:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 12:05:02,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:02,072 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:02,072 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:02,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash -843322023, now seen corresponding path program 24 times [2019-09-05 12:05:02,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:02,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:02,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:02,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:02,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:02,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:02,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:05:02,458 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:02,511 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-05 12:05:02,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:02,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 12:05:02,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:02,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:02,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:02,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-09-05 12:05:02,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 12:05:02,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 12:05:02,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:05:02,573 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2019-09-05 12:05:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:02,650 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-05 12:05:02,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 12:05:02,651 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-09-05 12:05:02,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:02,652 INFO L225 Difference]: With dead ends: 67 [2019-09-05 12:05:02,652 INFO L226 Difference]: Without dead ends: 62 [2019-09-05 12:05:02,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:05:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-05 12:05:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-05 12:05:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-05 12:05:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-05 12:05:02,658 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-05 12:05:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:02,658 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-05 12:05:02,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 12:05:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-05 12:05:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-05 12:05:02,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:02,659 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:02,659 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:02,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:02,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1845098635, now seen corresponding path program 25 times [2019-09-05 12:05:02,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:02,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:02,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:02,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:02,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:03,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:03,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:03,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:03,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 12:05:03,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:03,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:05:03,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:03,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2019-09-05 12:05:03,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 12:05:03,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 12:05:03,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:05:03,266 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-09-05 12:05:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:03,335 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-09-05 12:05:03,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 12:05:03,336 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-09-05 12:05:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:03,337 INFO L225 Difference]: With dead ends: 69 [2019-09-05 12:05:03,337 INFO L226 Difference]: Without dead ends: 64 [2019-09-05 12:05:03,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:05:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-05 12:05:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-05 12:05:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-05 12:05:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-05 12:05:03,343 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-05 12:05:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:03,344 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-05 12:05:03,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 12:05:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-05 12:05:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 12:05:03,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:03,345 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:03,345 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:03,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:03,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1815218833, now seen corresponding path program 26 times [2019-09-05 12:05:03,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:03,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:03,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:03,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:03,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:03,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:03,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:03,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:03,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:03,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:03,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 12:05:03,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:03,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:03,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:03,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-09-05 12:05:03,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 12:05:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 12:05:03,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=640, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:05:03,840 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2019-09-05 12:05:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:03,899 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-09-05 12:05:03,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 12:05:03,899 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-09-05 12:05:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:03,900 INFO L225 Difference]: With dead ends: 71 [2019-09-05 12:05:03,900 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 12:05:03,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=422, Invalid=700, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:05:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 12:05:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-05 12:05:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 12:05:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-05 12:05:03,904 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-05 12:05:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:03,905 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-05 12:05:03,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 12:05:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-05 12:05:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 12:05:03,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:03,906 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:03,906 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:03,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:03,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1802090157, now seen corresponding path program 27 times [2019-09-05 12:05:03,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:03,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:03,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:04,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:04,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:04,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:04,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-05 12:05:04,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:04,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 12:05:04,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:04,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:04,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:04,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 34 [2019-09-05 12:05:04,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 12:05:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 12:05:04,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:05:04,505 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-09-05 12:05:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:04,587 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-09-05 12:05:04,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 12:05:04,587 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-09-05 12:05:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:04,588 INFO L225 Difference]: With dead ends: 73 [2019-09-05 12:05:04,588 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 12:05:04,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:05:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 12:05:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-05 12:05:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 12:05:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-05 12:05:04,592 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-05 12:05:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:04,593 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-05 12:05:04,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 12:05:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-05 12:05:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 12:05:04,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:04,594 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:04,594 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:04,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2070334409, now seen corresponding path program 28 times [2019-09-05 12:05:04,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:04,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:04,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:04,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:04,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:05,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:05,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:05,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:05,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:05,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:05,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 12:05:05,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:05,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:05,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:05,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-09-05 12:05:05,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 12:05:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 12:05:05,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:05:05,217 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2019-09-05 12:05:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:05,292 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-09-05 12:05:05,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 12:05:05,293 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-09-05 12:05:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:05,294 INFO L225 Difference]: With dead ends: 75 [2019-09-05 12:05:05,294 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 12:05:05,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 12:05:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 12:05:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-05 12:05:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 12:05:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-05 12:05:05,299 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-05 12:05:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:05,300 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-05 12:05:05,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 12:05:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-05 12:05:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 12:05:05,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:05,301 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:05,302 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:05,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2139944475, now seen corresponding path program 29 times [2019-09-05 12:05:05,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:05,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:05,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:05,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:05,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:05,790 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:05,861 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-05 12:05:05,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:05,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 12:05:05,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:05,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:05:05,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:05,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 36 [2019-09-05 12:05:05,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 12:05:05,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 12:05:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 12:05:05,922 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-09-05 12:05:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:05,997 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-09-05 12:05:05,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 12:05:05,997 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-09-05 12:05:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:05,998 INFO L225 Difference]: With dead ends: 77 [2019-09-05 12:05:05,998 INFO L226 Difference]: Without dead ends: 72 [2019-09-05 12:05:06,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:05:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-05 12:05:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-05 12:05:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-05 12:05:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-05 12:05:06,003 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-05 12:05:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:06,004 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-05 12:05:06,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 12:05:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-05 12:05:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 12:05:06,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:06,005 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:06,005 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1936208129, now seen corresponding path program 30 times [2019-09-05 12:05:06,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:06,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:06,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:06,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:06,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:06,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:06,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:06,456 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:06,547 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-05 12:05:06,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:06,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 12:05:06,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:06,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:06,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:06,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-09-05 12:05:06,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 12:05:06,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 12:05:06,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:05:06,616 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2019-09-05 12:05:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:06,694 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-09-05 12:05:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 12:05:06,695 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-09-05 12:05:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:06,696 INFO L225 Difference]: With dead ends: 79 [2019-09-05 12:05:06,696 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 12:05:06,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:05:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 12:05:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-05 12:05:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-05 12:05:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-05 12:05:06,701 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-05 12:05:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:06,702 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-05 12:05:06,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 12:05:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-05 12:05:06,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 12:05:06,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:06,703 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:06,703 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:06,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:06,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2108686621, now seen corresponding path program 31 times [2019-09-05 12:05:06,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:06,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:06,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:06,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:06,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:07,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:07,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:07,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:07,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 12:05:07,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:07,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:07,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:07,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2019-09-05 12:05:07,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 12:05:07,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 12:05:07,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:05:07,293 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-09-05 12:05:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:07,368 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-09-05 12:05:07,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 12:05:07,368 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-09-05 12:05:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:07,369 INFO L225 Difference]: With dead ends: 81 [2019-09-05 12:05:07,369 INFO L226 Difference]: Without dead ends: 76 [2019-09-05 12:05:07,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:05:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-05 12:05:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-05 12:05:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 12:05:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-05 12:05:07,373 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-05 12:05:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:07,373 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-05 12:05:07,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 12:05:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-05 12:05:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-05 12:05:07,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:07,374 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:07,375 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:07,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash 356792889, now seen corresponding path program 32 times [2019-09-05 12:05:07,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:07,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:07,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:07,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:07,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:07,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:07,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:07,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:07,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 12:05:07,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:07,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:08,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:08,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-09-05 12:05:08,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 12:05:08,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 12:05:08,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=877, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:05:08,021 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2019-09-05 12:05:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:08,128 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-09-05 12:05:08,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 12:05:08,128 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-09-05 12:05:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:08,129 INFO L225 Difference]: With dead ends: 83 [2019-09-05 12:05:08,130 INFO L226 Difference]: Without dead ends: 78 [2019-09-05 12:05:08,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=611, Invalid=949, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:05:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-05 12:05:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-05 12:05:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-05 12:05:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-05 12:05:08,134 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-05 12:05:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:08,134 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-05 12:05:08,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 12:05:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-05 12:05:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-05 12:05:08,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:08,135 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:08,135 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash 414096469, now seen corresponding path program 33 times [2019-09-05 12:05:08,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:08,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:08,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:08,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:08,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:08,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:08,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-05 12:05:08,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:08,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-05 12:05:08,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:08,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:08,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:08,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 40 [2019-09-05 12:05:08,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 12:05:08,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 12:05:08,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:05:08,813 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-09-05 12:05:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:08,897 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-09-05 12:05:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 12:05:08,898 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-09-05 12:05:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:08,899 INFO L225 Difference]: With dead ends: 85 [2019-09-05 12:05:08,899 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 12:05:08,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:05:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 12:05:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-05 12:05:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 12:05:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-05 12:05:08,904 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-05 12:05:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:08,905 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-05 12:05:08,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 12:05:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-05 12:05:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 12:05:08,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:08,906 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:08,906 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:08,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:08,907 INFO L82 PathProgramCache]: Analyzing trace with hash -351737999, now seen corresponding path program 34 times [2019-09-05 12:05:08,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:08,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:08,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:08,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:08,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:09,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:09,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:09,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:09,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:09,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:09,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 12:05:09,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:09,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:09,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:09,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-09-05 12:05:09,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 12:05:09,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 12:05:09,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=964, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:05:09,802 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2019-09-05 12:05:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:09,891 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-09-05 12:05:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 12:05:09,892 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2019-09-05 12:05:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:09,893 INFO L225 Difference]: With dead ends: 87 [2019-09-05 12:05:09,893 INFO L226 Difference]: Without dead ends: 82 [2019-09-05 12:05:09,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=682, Invalid=1040, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 12:05:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-05 12:05:09,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-05 12:05:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-05 12:05:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-05 12:05:09,897 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-05 12:05:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:09,897 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-05 12:05:09,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 12:05:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-05 12:05:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 12:05:09,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:09,898 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:09,899 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:09,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1879254131, now seen corresponding path program 35 times [2019-09-05 12:05:09,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:09,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:09,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:09,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:09,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:10,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:10,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:10,557 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:10,638 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-05 12:05:10,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:10,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 12:05:10,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:10,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:10,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:10,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 42 [2019-09-05 12:05:10,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 12:05:10,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 12:05:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 12:05:10,695 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-09-05 12:05:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:10,784 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-09-05 12:05:10,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 12:05:10,784 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-09-05 12:05:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:10,785 INFO L225 Difference]: With dead ends: 89 [2019-09-05 12:05:10,786 INFO L226 Difference]: Without dead ends: 84 [2019-09-05 12:05:10,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:05:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-05 12:05:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-05 12:05:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-05 12:05:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-05 12:05:10,792 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-09-05 12:05:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:10,792 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-05 12:05:10,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 12:05:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-05 12:05:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-05 12:05:10,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:10,793 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:10,793 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:10,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:10,794 INFO L82 PathProgramCache]: Analyzing trace with hash -943441751, now seen corresponding path program 36 times [2019-09-05 12:05:10,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:10,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:10,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:10,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:10,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:11,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:11,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:11,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:11,557 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-05 12:05:11,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:11,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 12:05:11,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:11,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:11,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:11,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-09-05 12:05:11,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 12:05:11,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 12:05:11,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:05:11,633 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2019-09-05 12:05:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:11,738 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-09-05 12:05:11,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 12:05:11,739 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2019-09-05 12:05:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:11,740 INFO L225 Difference]: With dead ends: 91 [2019-09-05 12:05:11,740 INFO L226 Difference]: Without dead ends: 86 [2019-09-05 12:05:11,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:05:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-05 12:05:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-05 12:05:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-05 12:05:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-05 12:05:11,745 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-09-05 12:05:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:11,745 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-05 12:05:11,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 12:05:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-05 12:05:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-05 12:05:11,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:11,746 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:11,747 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash 724090565, now seen corresponding path program 37 times [2019-09-05 12:05:11,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:11,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:11,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:12,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:12,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:12,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:12,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 12:05:12,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:12,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:12,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:12,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 44 [2019-09-05 12:05:12,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 12:05:12,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 12:05:12,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:05:12,627 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-09-05 12:05:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:12,726 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-09-05 12:05:12,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 12:05:12,726 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-09-05 12:05:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:12,727 INFO L225 Difference]: With dead ends: 93 [2019-09-05 12:05:12,727 INFO L226 Difference]: Without dead ends: 88 [2019-09-05 12:05:12,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:05:12,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-05 12:05:12,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-05 12:05:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-05 12:05:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-05 12:05:12,731 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-09-05 12:05:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:12,731 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-05 12:05:12,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 12:05:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-05 12:05:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-05 12:05:12,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:12,732 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:12,733 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:12,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:12,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1199844833, now seen corresponding path program 38 times [2019-09-05 12:05:12,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:12,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:12,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:12,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:12,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:13,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:13,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:13,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:13,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:13,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:13,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 12:05:13,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:13,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:05:13,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:13,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-09-05 12:05:13,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 12:05:13,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 12:05:13,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:05:13,553 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2019-09-05 12:05:13,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:13,635 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-09-05 12:05:13,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 12:05:13,635 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2019-09-05 12:05:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:13,636 INFO L225 Difference]: With dead ends: 95 [2019-09-05 12:05:13,636 INFO L226 Difference]: Without dead ends: 90 [2019-09-05 12:05:13,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 12:05:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-05 12:05:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-05 12:05:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-05 12:05:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-05 12:05:13,641 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-09-05 12:05:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:13,641 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-05 12:05:13,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 12:05:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-05 12:05:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-05 12:05:13,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:13,642 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:13,643 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1161804291, now seen corresponding path program 39 times [2019-09-05 12:05:13,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:13,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:13,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:13,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:13,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:14,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:14,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:14,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:14,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-05 12:05:14,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:14,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 12:05:14,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:14,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:14,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:14,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 46 [2019-09-05 12:05:14,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 12:05:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 12:05:14,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 12:05:14,553 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-09-05 12:05:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:14,637 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-09-05 12:05:14,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 12:05:14,637 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-09-05 12:05:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:14,638 INFO L225 Difference]: With dead ends: 97 [2019-09-05 12:05:14,639 INFO L226 Difference]: Without dead ends: 92 [2019-09-05 12:05:14,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:05:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-05 12:05:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-05 12:05:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-05 12:05:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-05 12:05:14,643 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-09-05 12:05:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:14,643 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-05 12:05:14,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 12:05:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-05 12:05:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-05 12:05:14,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:14,644 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:14,645 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1331087129, now seen corresponding path program 40 times [2019-09-05 12:05:14,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:14,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:14,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:14,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:14,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:15,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:15,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:15,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:15,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:15,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:15,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 12:05:15,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:15,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:15,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-09-05 12:05:15,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 12:05:15,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 12:05:15,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:05:15,794 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2019-09-05 12:05:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:15,878 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-09-05 12:05:15,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 12:05:15,878 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2019-09-05 12:05:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:15,879 INFO L225 Difference]: With dead ends: 99 [2019-09-05 12:05:15,879 INFO L226 Difference]: Without dead ends: 94 [2019-09-05 12:05:15,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=919, Invalid=1337, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 12:05:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-05 12:05:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-05 12:05:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-05 12:05:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-05 12:05:15,882 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-09-05 12:05:15,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:15,883 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-05 12:05:15,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 12:05:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-05 12:05:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-05 12:05:15,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:15,884 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:15,884 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:15,884 INFO L82 PathProgramCache]: Analyzing trace with hash 407990581, now seen corresponding path program 41 times [2019-09-05 12:05:15,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:15,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:15,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:16,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:16,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:16,628 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:16,723 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-05 12:05:16,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:16,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 12:05:16,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:16,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:05:16,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:16,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 48 [2019-09-05 12:05:16,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-05 12:05:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-05 12:05:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 12:05:16,799 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-09-05 12:05:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:16,877 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-09-05 12:05:16,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 12:05:16,877 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-09-05 12:05:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:16,878 INFO L225 Difference]: With dead ends: 101 [2019-09-05 12:05:16,879 INFO L226 Difference]: Without dead ends: 96 [2019-09-05 12:05:16,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=962, Invalid=1390, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:05:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-05 12:05:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-05 12:05:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 12:05:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-05 12:05:16,886 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-09-05 12:05:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:16,886 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-05 12:05:16,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-05 12:05:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-05 12:05:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-05 12:05:16,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:16,887 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:16,888 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:16,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1924529071, now seen corresponding path program 42 times [2019-09-05 12:05:16,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:16,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:16,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:16,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:16,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:18,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:18,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:05:18,075 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:18,177 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-05 12:05:18,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:18,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 12:05:18,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:18,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:18,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:18,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-09-05 12:05:18,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 12:05:18,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 12:05:18,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:05:18,238 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2019-09-05 12:05:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:18,344 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-09-05 12:05:18,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 12:05:18,345 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2019-09-05 12:05:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:18,345 INFO L225 Difference]: With dead ends: 103 [2019-09-05 12:05:18,345 INFO L226 Difference]: Without dead ends: 98 [2019-09-05 12:05:18,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:05:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-05 12:05:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-05 12:05:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-05 12:05:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-05 12:05:18,350 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-09-05 12:05:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:18,351 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-05 12:05:18,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 12:05:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-05 12:05:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-05 12:05:18,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:18,352 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:18,352 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1502986131, now seen corresponding path program 43 times [2019-09-05 12:05:18,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:18,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:18,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:19,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:19,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:19,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:19,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 12:05:19,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:19,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:19,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:19,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 50 [2019-09-05 12:05:19,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 12:05:19,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 12:05:19,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:05:19,407 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-09-05 12:05:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:19,517 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-09-05 12:05:19,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 12:05:19,518 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-09-05 12:05:19,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:19,519 INFO L225 Difference]: With dead ends: 105 [2019-09-05 12:05:19,519 INFO L226 Difference]: Without dead ends: 100 [2019-09-05 12:05:19,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 12:05:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-05 12:05:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-05 12:05:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-05 12:05:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-05 12:05:19,525 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-09-05 12:05:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:19,525 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-05 12:05:19,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 12:05:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-05 12:05:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-05 12:05:19,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:19,526 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:19,526 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:19,526 INFO L82 PathProgramCache]: Analyzing trace with hash -127146615, now seen corresponding path program 44 times [2019-09-05 12:05:19,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:19,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:19,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:19,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:19,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:21,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:21,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:21,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:21,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:21,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:21,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 12:05:21,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:21,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:21,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:21,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-09-05 12:05:21,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 12:05:21,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 12:05:21,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 12:05:21,155 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2019-09-05 12:05:21,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:21,318 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-09-05 12:05:21,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 12:05:21,318 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2019-09-05 12:05:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:21,320 INFO L225 Difference]: With dead ends: 107 [2019-09-05 12:05:21,320 INFO L226 Difference]: Without dead ends: 102 [2019-09-05 12:05:21,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1097, Invalid=1555, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:05:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-05 12:05:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-05 12:05:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-05 12:05:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-05 12:05:21,327 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-09-05 12:05:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:21,328 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-05 12:05:21,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 12:05:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-05 12:05:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-05 12:05:21,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:21,329 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:21,330 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:21,330 INFO L82 PathProgramCache]: Analyzing trace with hash -795298907, now seen corresponding path program 45 times [2019-09-05 12:05:21,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:21,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:21,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:21,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:21,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:22,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:22,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:22,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:22,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-05 12:05:22,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:22,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-05 12:05:22,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:22,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:22,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:22,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 52 [2019-09-05 12:05:22,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 12:05:22,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 12:05:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:05:22,549 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-09-05 12:05:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:22,691 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-09-05 12:05:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-05 12:05:22,692 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-09-05 12:05:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:22,693 INFO L225 Difference]: With dead ends: 109 [2019-09-05 12:05:22,693 INFO L226 Difference]: Without dead ends: 104 [2019-09-05 12:05:22,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1144, Invalid=1612, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:05:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-05 12:05:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-05 12:05:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-05 12:05:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-05 12:05:22,697 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-09-05 12:05:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:22,697 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-05 12:05:22,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 12:05:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-05 12:05:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-05 12:05:22,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:22,698 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:22,698 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:22,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1355442881, now seen corresponding path program 46 times [2019-09-05 12:05:22,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:22,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:22,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:22,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:22,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:23,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:23,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:23,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:24,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:24,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:24,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 12:05:24,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:24,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:24,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:24,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-09-05 12:05:24,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 12:05:24,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 12:05:24,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1570, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:05:24,114 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2019-09-05 12:05:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:24,237 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-09-05 12:05:24,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 12:05:24,237 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2019-09-05 12:05:24,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:24,239 INFO L225 Difference]: With dead ends: 111 [2019-09-05 12:05:24,239 INFO L226 Difference]: Without dead ends: 106 [2019-09-05 12:05:24,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1192, Invalid=1670, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 12:05:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-05 12:05:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-05 12:05:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-05 12:05:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-05 12:05:24,255 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-09-05 12:05:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:24,256 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-05 12:05:24,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 12:05:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-05 12:05:24,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-05 12:05:24,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:24,257 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:24,257 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:24,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1955935523, now seen corresponding path program 47 times [2019-09-05 12:05:24,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:24,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:24,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:24,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:24,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:25,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:25,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:25,307 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:25,410 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-05 12:05:25,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:25,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 12:05:25,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:25,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:25,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:25,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 54 [2019-09-05 12:05:25,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-05 12:05:25,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-05 12:05:25,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 12:05:25,507 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-09-05 12:05:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:25,606 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-09-05 12:05:25,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 12:05:25,607 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-09-05 12:05:25,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:25,608 INFO L225 Difference]: With dead ends: 113 [2019-09-05 12:05:25,608 INFO L226 Difference]: Without dead ends: 108 [2019-09-05 12:05:25,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:05:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-05 12:05:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-05 12:05:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-05 12:05:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-05 12:05:25,613 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-09-05 12:05:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:25,614 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-05 12:05:25,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-05 12:05:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-05 12:05:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-05 12:05:25,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:25,615 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:25,615 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:25,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1619815431, now seen corresponding path program 48 times [2019-09-05 12:05:25,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:25,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:25,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:26,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:26,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:26,599 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:26,707 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-05 12:05:26,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:26,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 12:05:26,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:26,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:26,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:26,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 55 [2019-09-05 12:05:26,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 12:05:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 12:05:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:05:26,772 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 55 states. [2019-09-05 12:05:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:26,906 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-09-05 12:05:26,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 12:05:26,906 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2019-09-05 12:05:26,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:26,908 INFO L225 Difference]: With dead ends: 115 [2019-09-05 12:05:26,908 INFO L226 Difference]: Without dead ends: 110 [2019-09-05 12:05:26,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 12:05:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-05 12:05:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-05 12:05:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-05 12:05:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-05 12:05:26,913 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-09-05 12:05:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:26,913 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-05 12:05:26,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 12:05:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-05 12:05:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-05 12:05:26,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:26,914 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:26,914 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash -730954219, now seen corresponding path program 49 times [2019-09-05 12:05:26,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:26,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:26,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:28,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:28,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:28,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:28,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 12:05:28,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:28,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:28,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:28,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 56 [2019-09-05 12:05:28,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-05 12:05:28,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-05 12:05:28,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 12:05:28,221 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-09-05 12:05:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:28,326 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-09-05 12:05:28,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 12:05:28,327 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-09-05 12:05:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:28,328 INFO L225 Difference]: With dead ends: 117 [2019-09-05 12:05:28,328 INFO L226 Difference]: Without dead ends: 112 [2019-09-05 12:05:28,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:05:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-05 12:05:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-05 12:05:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-05 12:05:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-05 12:05:28,334 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-09-05 12:05:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:28,334 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-05 12:05:28,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-05 12:05:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-05 12:05:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 12:05:28,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:28,337 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:28,337 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1233821391, now seen corresponding path program 50 times [2019-09-05 12:05:28,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:28,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:28,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:29,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:29,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:29,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:29,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:29,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:29,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 12:05:29,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:29,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:30,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:30,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-09-05 12:05:30,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 12:05:30,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 12:05:30,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=1804, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:05:30,079 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 57 states. [2019-09-05 12:05:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:30,281 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-09-05 12:05:30,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 12:05:30,282 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2019-09-05 12:05:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:30,283 INFO L225 Difference]: With dead ends: 119 [2019-09-05 12:05:30,283 INFO L226 Difference]: Without dead ends: 114 [2019-09-05 12:05:30,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1394, Invalid=1912, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 12:05:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-05 12:05:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-05 12:05:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-05 12:05:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-05 12:05:30,288 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-09-05 12:05:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:30,289 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-05 12:05:30,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-05 12:05:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-05 12:05:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-05 12:05:30,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:30,290 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:30,290 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash 842130765, now seen corresponding path program 51 times [2019-09-05 12:05:30,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:30,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:30,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:30,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:30,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:31,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:31,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:31,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-05 12:05:31,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:31,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-05 12:05:31,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:31,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:31,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:31,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 58 [2019-09-05 12:05:31,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-05 12:05:31,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-05 12:05:31,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 12:05:31,600 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-09-05 12:05:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:31,742 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-09-05 12:05:31,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-05 12:05:31,742 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-09-05 12:05:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:31,743 INFO L225 Difference]: With dead ends: 121 [2019-09-05 12:05:31,743 INFO L226 Difference]: Without dead ends: 116 [2019-09-05 12:05:31,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:05:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-05 12:05:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-05 12:05:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-05 12:05:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-05 12:05:31,747 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-09-05 12:05:31,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:31,747 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-05 12:05:31,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-05 12:05:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-05 12:05:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-05 12:05:31,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:31,748 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:31,748 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:31,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1327639959, now seen corresponding path program 52 times [2019-09-05 12:05:31,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:31,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:31,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:31,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:32,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:32,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:05:32,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:32,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:32,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:32,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 12:05:32,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:32,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:33,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:33,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-09-05 12:05:33,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-05 12:05:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-05 12:05:33,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:05:33,058 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 59 states. [2019-09-05 12:05:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:33,189 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-09-05 12:05:33,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 12:05:33,190 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2019-09-05 12:05:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:33,191 INFO L225 Difference]: With dead ends: 123 [2019-09-05 12:05:33,191 INFO L226 Difference]: Without dead ends: 118 [2019-09-05 12:05:33,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1501, Invalid=2039, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 12:05:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-05 12:05:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-05 12:05:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-05 12:05:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-05 12:05:33,196 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-09-05 12:05:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:33,196 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-05 12:05:33,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-05 12:05:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-05 12:05:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-05 12:05:33,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:33,197 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:33,197 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:33,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:33,197 INFO L82 PathProgramCache]: Analyzing trace with hash 876800133, now seen corresponding path program 53 times [2019-09-05 12:05:33,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:33,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:33,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:33,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:33,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:34,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:34,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:34,358 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:34,480 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-05 12:05:34,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:34,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-05 12:05:34,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:34,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:34,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:34,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 60 [2019-09-05 12:05:34,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-05 12:05:34,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-05 12:05:34,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 12:05:34,595 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-09-05 12:05:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:34,734 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-09-05 12:05:34,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-05 12:05:34,734 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-09-05 12:05:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:34,735 INFO L225 Difference]: With dead ends: 125 [2019-09-05 12:05:34,735 INFO L226 Difference]: Without dead ends: 120 [2019-09-05 12:05:34,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:05:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-05 12:05:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-05 12:05:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-05 12:05:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-05 12:05:34,739 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-09-05 12:05:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:34,739 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-05 12:05:34,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-05 12:05:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-05 12:05:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-05 12:05:34,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:34,740 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:34,740 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:34,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1924851617, now seen corresponding path program 54 times [2019-09-05 12:05:34,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:34,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:34,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:35,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:35,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:35,943 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:36,076 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-05 12:05:36,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:36,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 12:05:36,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:36,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:36,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:36,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 61 [2019-09-05 12:05:36,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-05 12:05:36,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-05 12:05:36,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:05:36,198 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 61 states. [2019-09-05 12:05:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:36,340 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-09-05 12:05:36,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 12:05:36,341 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2019-09-05 12:05:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:36,342 INFO L225 Difference]: With dead ends: 127 [2019-09-05 12:05:36,342 INFO L226 Difference]: Without dead ends: 122 [2019-09-05 12:05:36,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1612, Invalid=2170, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 12:05:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-05 12:05:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-05 12:05:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-05 12:05:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-05 12:05:36,347 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-09-05 12:05:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:36,347 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-05 12:05:36,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-05 12:05:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-05 12:05:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-05 12:05:36,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:36,348 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:36,348 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:36,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash -214986819, now seen corresponding path program 55 times [2019-09-05 12:05:36,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:36,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:36,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:36,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:36,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:37,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:37,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:37,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:37,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 12:05:37,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:37,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:37,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:37,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 62 [2019-09-05 12:05:37,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-05 12:05:37,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-05 12:05:37,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 12:05:37,792 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-09-05 12:05:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:37,933 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-09-05 12:05:37,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-05 12:05:37,933 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-09-05 12:05:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:37,934 INFO L225 Difference]: With dead ends: 129 [2019-09-05 12:05:37,934 INFO L226 Difference]: Without dead ends: 124 [2019-09-05 12:05:37,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:05:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-05 12:05:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-05 12:05:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-05 12:05:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-09-05 12:05:37,941 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-09-05 12:05:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:37,941 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-09-05 12:05:37,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-05 12:05:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-09-05 12:05:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-05 12:05:37,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:37,942 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:37,943 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash 689610969, now seen corresponding path program 56 times [2019-09-05 12:05:37,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:37,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:37,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:39,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:39,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:39,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:39,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:39,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:39,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 12:05:39,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:39,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:39,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:39,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 63 [2019-09-05 12:05:39,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 12:05:39,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 12:05:39,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=2185, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:05:39,377 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 63 states. [2019-09-05 12:05:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:39,521 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-09-05 12:05:39,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-05 12:05:39,521 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2019-09-05 12:05:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:39,522 INFO L225 Difference]: With dead ends: 131 [2019-09-05 12:05:39,522 INFO L226 Difference]: Without dead ends: 126 [2019-09-05 12:05:39,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1727, Invalid=2305, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 12:05:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-05 12:05:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-05 12:05:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-05 12:05:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-09-05 12:05:39,526 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-09-05 12:05:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:39,526 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-09-05 12:05:39,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 12:05:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-09-05 12:05:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-05 12:05:39,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:39,527 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:39,528 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:39,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1870275851, now seen corresponding path program 57 times [2019-09-05 12:05:39,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:39,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:39,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:39,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:39,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:40,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:40,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:40,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:41,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-05 12:05:41,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:41,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-05 12:05:41,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:41,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:41,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:41,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 64 [2019-09-05 12:05:41,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-05 12:05:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-05 12:05:41,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 12:05:41,225 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-09-05 12:05:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:41,350 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-09-05 12:05:41,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-05 12:05:41,351 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-09-05 12:05:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:41,352 INFO L225 Difference]: With dead ends: 133 [2019-09-05 12:05:41,352 INFO L226 Difference]: Without dead ends: 128 [2019-09-05 12:05:41,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1786, Invalid=2374, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:05:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-05 12:05:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-05 12:05:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-05 12:05:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-09-05 12:05:41,356 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-09-05 12:05:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:41,357 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-09-05 12:05:41,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-05 12:05:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-09-05 12:05:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-05 12:05:41,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:41,357 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:41,358 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:41,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:41,358 INFO L82 PathProgramCache]: Analyzing trace with hash -905249263, now seen corresponding path program 58 times [2019-09-05 12:05:41,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:41,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:41,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:41,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:41,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:42,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:42,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:42,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:42,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:42,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:42,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 12:05:42,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:42,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:42,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:42,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 65 [2019-09-05 12:05:42,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-05 12:05:42,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-05 12:05:42,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=2320, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:05:42,967 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 65 states. [2019-09-05 12:05:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:43,107 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-09-05 12:05:43,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-05 12:05:43,108 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2019-09-05 12:05:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:43,109 INFO L225 Difference]: With dead ends: 135 [2019-09-05 12:05:43,109 INFO L226 Difference]: Without dead ends: 130 [2019-09-05 12:05:43,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1846, Invalid=2444, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 12:05:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-05 12:05:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-05 12:05:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-05 12:05:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-09-05 12:05:43,114 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-09-05 12:05:43,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:43,114 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-09-05 12:05:43,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-05 12:05:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-09-05 12:05:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-05 12:05:43,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:43,116 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:43,116 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:43,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:43,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1227634131, now seen corresponding path program 59 times [2019-09-05 12:05:43,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:43,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:43,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:45,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:45,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:45,088 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:45,236 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-05 12:05:45,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:45,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-05 12:05:45,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:45,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:45,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:45,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 66 [2019-09-05 12:05:45,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-05 12:05:45,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-05 12:05:45,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 12:05:45,338 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-09-05 12:05:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:45,532 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-09-05 12:05:45,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-05 12:05:45,533 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-09-05 12:05:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:45,534 INFO L225 Difference]: With dead ends: 137 [2019-09-05 12:05:45,535 INFO L226 Difference]: Without dead ends: 132 [2019-09-05 12:05:45,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:05:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-05 12:05:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-05 12:05:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-05 12:05:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-09-05 12:05:45,551 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-09-05 12:05:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:45,551 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-09-05 12:05:45,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-05 12:05:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-09-05 12:05:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-05 12:05:45,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:45,554 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:45,555 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:45,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:45,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1801846967, now seen corresponding path program 60 times [2019-09-05 12:05:45,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:45,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:45,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:45,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:45,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:47,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:47,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:47,148 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:47,297 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-05 12:05:47,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:47,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-05 12:05:47,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:47,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:47,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:47,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 67 [2019-09-05 12:05:47,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-05 12:05:47,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-05 12:05:47,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=2459, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:05:47,402 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 67 states. [2019-09-05 12:05:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:47,558 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-09-05 12:05:47,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-05 12:05:47,558 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2019-09-05 12:05:47,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:47,559 INFO L225 Difference]: With dead ends: 139 [2019-09-05 12:05:47,559 INFO L226 Difference]: Without dead ends: 134 [2019-09-05 12:05:47,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1969, Invalid=2587, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 12:05:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-05 12:05:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-09-05 12:05:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-05 12:05:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-09-05 12:05:47,564 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-09-05 12:05:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:47,565 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-09-05 12:05:47,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-05 12:05:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-09-05 12:05:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-05 12:05:47,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:47,566 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:47,566 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:47,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash 430398821, now seen corresponding path program 61 times [2019-09-05 12:05:47,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:47,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:47,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:47,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:47,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:49,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:49,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:49,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:49,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-05 12:05:49,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:49,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:49,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:49,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 68 [2019-09-05 12:05:49,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-05 12:05:49,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-05 12:05:49,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 12:05:49,578 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-09-05 12:05:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:49,736 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-09-05 12:05:49,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-05 12:05:49,737 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-09-05 12:05:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:49,737 INFO L225 Difference]: With dead ends: 141 [2019-09-05 12:05:49,737 INFO L226 Difference]: Without dead ends: 136 [2019-09-05 12:05:49,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:05:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-05 12:05:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-05 12:05:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-05 12:05:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-09-05 12:05:49,742 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-09-05 12:05:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:49,742 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-09-05 12:05:49,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-05 12:05:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-09-05 12:05:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-05 12:05:49,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:49,743 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:49,744 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1865046911, now seen corresponding path program 62 times [2019-09-05 12:05:49,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:49,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:49,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:49,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:49,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:51,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:51,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:51,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:51,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:51,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:51,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-05 12:05:51,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:51,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:51,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:51,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 69 [2019-09-05 12:05:51,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-05 12:05:51,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-05 12:05:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2090, Invalid=2602, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:05:51,422 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 69 states. [2019-09-05 12:05:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:51,610 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-09-05 12:05:51,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-05 12:05:51,611 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2019-09-05 12:05:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:51,611 INFO L225 Difference]: With dead ends: 143 [2019-09-05 12:05:51,612 INFO L226 Difference]: Without dead ends: 138 [2019-09-05 12:05:51,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2096, Invalid=2734, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 12:05:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-05 12:05:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-05 12:05:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-05 12:05:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-09-05 12:05:51,615 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-09-05 12:05:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:51,616 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-09-05 12:05:51,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-05 12:05:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-09-05 12:05:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-05 12:05:51,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:51,617 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:51,617 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:51,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:51,617 INFO L82 PathProgramCache]: Analyzing trace with hash -175205219, now seen corresponding path program 63 times [2019-09-05 12:05:51,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:51,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:51,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:51,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:51,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:53,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:53,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:53,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:53,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-05 12:05:53,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:53,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-05 12:05:53,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:53,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:53,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:53,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 70 [2019-09-05 12:05:53,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-05 12:05:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-05 12:05:53,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 12:05:53,401 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-09-05 12:05:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:53,567 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-09-05 12:05:53,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-05 12:05:53,567 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-09-05 12:05:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:53,568 INFO L225 Difference]: With dead ends: 145 [2019-09-05 12:05:53,569 INFO L226 Difference]: Without dead ends: 140 [2019-09-05 12:05:53,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2161, Invalid=2809, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 12:05:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-05 12:05:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-05 12:05:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-05 12:05:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-09-05 12:05:53,573 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-09-05 12:05:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:53,573 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-09-05 12:05:53,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-05 12:05:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-09-05 12:05:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-05 12:05:53,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:53,574 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:53,575 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:53,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:53,575 INFO L82 PathProgramCache]: Analyzing trace with hash 265022905, now seen corresponding path program 64 times [2019-09-05 12:05:53,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:53,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:53,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:53,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:53,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:55,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:55,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:05:55,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:55,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:55,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:55,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 12:05:55,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:55,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:55,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:55,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 71 [2019-09-05 12:05:55,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-05 12:05:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-05 12:05:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2221, Invalid=2749, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 12:05:55,344 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 71 states. [2019-09-05 12:05:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:55,527 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-09-05 12:05:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-05 12:05:55,527 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2019-09-05 12:05:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:55,528 INFO L225 Difference]: With dead ends: 147 [2019-09-05 12:05:55,528 INFO L226 Difference]: Without dead ends: 142 [2019-09-05 12:05:55,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2227, Invalid=2885, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 12:05:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-05 12:05:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-09-05 12:05:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-05 12:05:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-09-05 12:05:55,532 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-09-05 12:05:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:55,532 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-09-05 12:05:55,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-05 12:05:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-09-05 12:05:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-05 12:05:55,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:55,533 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:55,533 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1877512235, now seen corresponding path program 65 times [2019-09-05 12:05:55,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:55,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:57,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:57,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:57,159 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:57,315 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-09-05 12:05:57,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:57,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-05 12:05:57,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:57,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:57,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:57,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 72 [2019-09-05 12:05:57,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-05 12:05:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-05 12:05:57,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2288, Invalid=2824, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 12:05:57,454 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-09-05 12:05:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:57,638 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-09-05 12:05:57,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-05 12:05:57,638 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-09-05 12:05:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:57,639 INFO L225 Difference]: With dead ends: 149 [2019-09-05 12:05:57,639 INFO L226 Difference]: Without dead ends: 144 [2019-09-05 12:05:57,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2294, Invalid=2962, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 12:05:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-05 12:05:57,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-05 12:05:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-05 12:05:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-09-05 12:05:57,643 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-09-05 12:05:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:57,644 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-09-05 12:05:57,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-05 12:05:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-09-05 12:05:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-05 12:05:57,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:57,645 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:57,645 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:57,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:57,646 INFO L82 PathProgramCache]: Analyzing trace with hash 730520305, now seen corresponding path program 66 times [2019-09-05 12:05:57,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:57,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:57,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:57,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:57,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:59,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:59,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:59,339 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:59,503 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-05 12:05:59,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:59,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-05 12:05:59,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:59,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:59,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:59,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 73 [2019-09-05 12:05:59,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-05 12:05:59,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-05 12:05:59,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2356, Invalid=2900, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 12:05:59,590 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 73 states. [2019-09-05 12:05:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:59,730 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-09-05 12:05:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-05 12:05:59,730 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2019-09-05 12:05:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:59,731 INFO L225 Difference]: With dead ends: 151 [2019-09-05 12:05:59,731 INFO L226 Difference]: Without dead ends: 146 [2019-09-05 12:05:59,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2362, Invalid=3040, Unknown=0, NotChecked=0, Total=5402 [2019-09-05 12:05:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-05 12:05:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-09-05 12:05:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-05 12:05:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-09-05 12:05:59,736 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-09-05 12:05:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:59,736 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-09-05 12:05:59,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-05 12:05:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-09-05 12:05:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-05 12:05:59,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:59,737 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:59,737 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:59,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1211109619, now seen corresponding path program 67 times [2019-09-05 12:05:59,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:59,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:59,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:59,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:59,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:01,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:01,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:01,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:01,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 12:06:01,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:01,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:01,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:01,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 74 [2019-09-05 12:06:01,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-05 12:06:01,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-05 12:06:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-09-05 12:06:01,634 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-09-05 12:06:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:01,806 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-09-05 12:06:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-05 12:06:01,807 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-09-05 12:06:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:01,808 INFO L225 Difference]: With dead ends: 153 [2019-09-05 12:06:01,808 INFO L226 Difference]: Without dead ends: 148 [2019-09-05 12:06:01,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2431, Invalid=3119, Unknown=0, NotChecked=0, Total=5550 [2019-09-05 12:06:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-05 12:06:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-09-05 12:06:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-05 12:06:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-09-05 12:06:01,813 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-09-05 12:06:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:01,813 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-09-05 12:06:01,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-05 12:06:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-09-05 12:06:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-05 12:06:01,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:01,814 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:01,814 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:01,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1193307177, now seen corresponding path program 68 times [2019-09-05 12:06:01,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:01,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:01,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:03,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:03,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:03,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:06:03,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:06:03,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:03,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-05 12:06:03,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:03,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:03,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:03,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 75 [2019-09-05 12:06:03,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-05 12:06:03,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-05 12:06:03,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2495, Invalid=3055, Unknown=0, NotChecked=0, Total=5550 [2019-09-05 12:06:03,769 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 75 states. [2019-09-05 12:06:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:03,975 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-09-05 12:06:03,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-05 12:06:03,975 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2019-09-05 12:06:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:03,977 INFO L225 Difference]: With dead ends: 155 [2019-09-05 12:06:03,977 INFO L226 Difference]: Without dead ends: 150 [2019-09-05 12:06:03,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2501, Invalid=3199, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 12:06:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-05 12:06:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-05 12:06:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-05 12:06:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-09-05 12:06:03,981 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2019-09-05 12:06:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:03,982 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-09-05 12:06:03,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-05 12:06:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-09-05 12:06:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-05 12:06:03,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:03,983 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:03,983 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1145442885, now seen corresponding path program 69 times [2019-09-05 12:06:03,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:03,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:03,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:03,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:03,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:05,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:05,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:05,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:06:05,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-05 12:06:05,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:05,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-05 12:06:05,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:05,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:06,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:06,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 76 [2019-09-05 12:06:06,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-05 12:06:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-05 12:06:06,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2566, Invalid=3134, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 12:06:06,049 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-09-05 12:06:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:06,251 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-09-05 12:06:06,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-05 12:06:06,251 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-09-05 12:06:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:06,252 INFO L225 Difference]: With dead ends: 157 [2019-09-05 12:06:06,252 INFO L226 Difference]: Without dead ends: 152 [2019-09-05 12:06:06,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2572, Invalid=3280, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 12:06:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-05 12:06:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-05 12:06:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-05 12:06:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-09-05 12:06:06,257 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2019-09-05 12:06:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:06,257 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-09-05 12:06:06,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-05 12:06:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-09-05 12:06:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-05 12:06:06,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:06,258 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:06,258 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:06,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:06,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1902468767, now seen corresponding path program 70 times [2019-09-05 12:06:06,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:06,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:06,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:06,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:06,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:08,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:08,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:08,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:06:08,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:06:08,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:08,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 12:06:08,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:08,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:08,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:08,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 77 [2019-09-05 12:06:08,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-05 12:06:08,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-05 12:06:08,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2638, Invalid=3214, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 12:06:08,614 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 77 states. [2019-09-05 12:06:08,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:08,795 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-09-05 12:06:08,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-05 12:06:08,796 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2019-09-05 12:06:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:08,797 INFO L225 Difference]: With dead ends: 159 [2019-09-05 12:06:08,797 INFO L226 Difference]: Without dead ends: 154 [2019-09-05 12:06:08,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2644, Invalid=3362, Unknown=0, NotChecked=0, Total=6006 [2019-09-05 12:06:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-05 12:06:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-05 12:06:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-05 12:06:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-09-05 12:06:08,801 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2019-09-05 12:06:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:08,802 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-09-05 12:06:08,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-05 12:06:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-09-05 12:06:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-05 12:06:08,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:08,803 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:08,803 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1777870467, now seen corresponding path program 71 times [2019-09-05 12:06:08,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:08,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:08,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:08,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:10,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:10,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:10,738 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:06:10,923 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-09-05 12:06:10,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:10,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-05 12:06:10,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:10,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:11,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:11,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 78 [2019-09-05 12:06:11,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-05 12:06:11,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-05 12:06:11,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=3295, Unknown=0, NotChecked=0, Total=6006 [2019-09-05 12:06:11,014 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-09-05 12:06:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:11,215 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-09-05 12:06:11,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-05 12:06:11,216 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-09-05 12:06:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:11,217 INFO L225 Difference]: With dead ends: 161 [2019-09-05 12:06:11,217 INFO L226 Difference]: Without dead ends: 156 [2019-09-05 12:06:11,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2717, Invalid=3445, Unknown=0, NotChecked=0, Total=6162 [2019-09-05 12:06:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-05 12:06:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-05 12:06:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-05 12:06:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-09-05 12:06:11,221 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2019-09-05 12:06:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:11,221 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-09-05 12:06:11,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-05 12:06:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-09-05 12:06:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-05 12:06:11,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:11,222 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:11,222 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:11,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1996978841, now seen corresponding path program 72 times [2019-09-05 12:06:11,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:11,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:11,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:11,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:11,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:13,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:13,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:13,144 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:06:13,335 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-05 12:06:13,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:13,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-05 12:06:13,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:13,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:13,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:13,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 79 [2019-09-05 12:06:13,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-05 12:06:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-05 12:06:13,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2785, Invalid=3377, Unknown=0, NotChecked=0, Total=6162 [2019-09-05 12:06:13,427 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 79 states. [2019-09-05 12:06:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:13,632 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-09-05 12:06:13,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-05 12:06:13,632 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2019-09-05 12:06:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:13,633 INFO L225 Difference]: With dead ends: 163 [2019-09-05 12:06:13,633 INFO L226 Difference]: Without dead ends: 158 [2019-09-05 12:06:13,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2791, Invalid=3529, Unknown=0, NotChecked=0, Total=6320 [2019-09-05 12:06:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-05 12:06:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-05 12:06:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-05 12:06:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-09-05 12:06:13,638 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2019-09-05 12:06:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:13,638 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-09-05 12:06:13,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-05 12:06:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-09-05 12:06:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-05 12:06:13,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:13,639 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:13,639 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:13,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:13,639 INFO L82 PathProgramCache]: Analyzing trace with hash 379798709, now seen corresponding path program 73 times [2019-09-05 12:06:13,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:13,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:13,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:13,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:13,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:15,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:15,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:15,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:15,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-05 12:06:15,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:15,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:15,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:15,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 80 [2019-09-05 12:06:15,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-05 12:06:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-05 12:06:15,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2860, Invalid=3460, Unknown=0, NotChecked=0, Total=6320 [2019-09-05 12:06:15,824 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-09-05 12:06:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:16,040 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-09-05 12:06:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-05 12:06:16,040 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-09-05 12:06:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:16,042 INFO L225 Difference]: With dead ends: 165 [2019-09-05 12:06:16,042 INFO L226 Difference]: Without dead ends: 160 [2019-09-05 12:06:16,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2866, Invalid=3614, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 12:06:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-05 12:06:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-05 12:06:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-05 12:06:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-09-05 12:06:16,045 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2019-09-05 12:06:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:16,045 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2019-09-05 12:06:16,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-05 12:06:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2019-09-05 12:06:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-05 12:06:16,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:16,046 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:16,046 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:16,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1047853009, now seen corresponding path program 74 times [2019-09-05 12:06:16,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:16,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:16,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:16,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:16,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:18,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:18,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:18,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:06:18,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:06:18,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:18,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-05 12:06:18,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:18,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:18,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 81 [2019-09-05 12:06:18,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-05 12:06:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-05 12:06:18,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2936, Invalid=3544, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 12:06:18,362 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 81 states. [2019-09-05 12:06:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:18,579 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-09-05 12:06:18,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-05 12:06:18,580 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2019-09-05 12:06:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:18,581 INFO L225 Difference]: With dead ends: 167 [2019-09-05 12:06:18,581 INFO L226 Difference]: Without dead ends: 162 [2019-09-05 12:06:18,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2942, Invalid=3700, Unknown=0, NotChecked=0, Total=6642 [2019-09-05 12:06:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-05 12:06:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-05 12:06:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-05 12:06:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-09-05 12:06:18,586 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2019-09-05 12:06:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:18,587 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-09-05 12:06:18,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-05 12:06:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-09-05 12:06:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-05 12:06:18,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:18,588 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:18,588 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:18,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:18,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1197059091, now seen corresponding path program 75 times [2019-09-05 12:06:18,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:18,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:18,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:18,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:18,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:20,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:20,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:20,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:06:20,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-09-05 12:06:20,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:20,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-05 12:06:20,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:20,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:21,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:21,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 82 [2019-09-05 12:06:21,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-05 12:06:21,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-05 12:06:21,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3013, Invalid=3629, Unknown=0, NotChecked=0, Total=6642 [2019-09-05 12:06:21,008 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-09-05 12:06:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:21,171 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-09-05 12:06:21,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-05 12:06:21,172 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-09-05 12:06:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:21,173 INFO L225 Difference]: With dead ends: 169 [2019-09-05 12:06:21,173 INFO L226 Difference]: Without dead ends: 164 [2019-09-05 12:06:21,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3019, Invalid=3787, Unknown=0, NotChecked=0, Total=6806 [2019-09-05 12:06:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-05 12:06:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-05 12:06:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-05 12:06:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-09-05 12:06:21,178 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2019-09-05 12:06:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:21,179 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-09-05 12:06:21,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-05 12:06:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-09-05 12:06:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-05 12:06:21,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:21,180 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:21,180 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:21,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:21,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1810962697, now seen corresponding path program 76 times [2019-09-05 12:06:21,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:21,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:21,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:21,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:21,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:23,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:23,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:23,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:06:23,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:06:23,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:23,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-05 12:06:23,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:23,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:23,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:23,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 83 [2019-09-05 12:06:23,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-05 12:06:23,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-05 12:06:23,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3091, Invalid=3715, Unknown=0, NotChecked=0, Total=6806 [2019-09-05 12:06:23,566 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 83 states. [2019-09-05 12:06:23,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:23,765 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-09-05 12:06:23,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 12:06:23,766 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 162 [2019-09-05 12:06:23,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:23,767 INFO L225 Difference]: With dead ends: 171 [2019-09-05 12:06:23,767 INFO L226 Difference]: Without dead ends: 166 [2019-09-05 12:06:23,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3097, Invalid=3875, Unknown=0, NotChecked=0, Total=6972 [2019-09-05 12:06:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-05 12:06:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-05 12:06:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-05 12:06:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-09-05 12:06:23,772 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2019-09-05 12:06:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:23,772 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-09-05 12:06:23,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-05 12:06:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-09-05 12:06:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-05 12:06:23,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:23,773 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:23,774 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:23,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2006910757, now seen corresponding path program 77 times [2019-09-05 12:06:23,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:23,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:23,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:26,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:26,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:26,073 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:06:26,269 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-09-05 12:06:26,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:26,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-05 12:06:26,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:26,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:26,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:26,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 84 [2019-09-05 12:06:26,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-05 12:06:26,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-05 12:06:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3170, Invalid=3802, Unknown=0, NotChecked=0, Total=6972 [2019-09-05 12:06:26,370 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-09-05 12:06:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:26,600 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-09-05 12:06:26,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-05 12:06:26,601 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-09-05 12:06:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:26,602 INFO L225 Difference]: With dead ends: 173 [2019-09-05 12:06:26,602 INFO L226 Difference]: Without dead ends: 168 [2019-09-05 12:06:26,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3176, Invalid=3964, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:06:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-05 12:06:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-05 12:06:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-05 12:06:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-09-05 12:06:26,607 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2019-09-05 12:06:26,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:26,607 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-09-05 12:06:26,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-05 12:06:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-09-05 12:06:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-05 12:06:26,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:26,608 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:26,608 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:26,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1334435393, now seen corresponding path program 78 times [2019-09-05 12:06:26,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:26,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:26,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:26,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:26,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:28,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:28,880 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:28,891 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:06:29,104 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-05 12:06:29,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:29,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-05 12:06:29,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:29,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:29,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:29,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 85 [2019-09-05 12:06:29,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-05 12:06:29,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-05 12:06:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=3890, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:06:29,200 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 85 states. [2019-09-05 12:06:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:29,377 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-09-05 12:06:29,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-05 12:06:29,378 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 166 [2019-09-05 12:06:29,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:29,379 INFO L225 Difference]: With dead ends: 175 [2019-09-05 12:06:29,379 INFO L226 Difference]: Without dead ends: 170 [2019-09-05 12:06:29,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3256, Invalid=4054, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 12:06:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-05 12:06:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-05 12:06:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-05 12:06:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-09-05 12:06:29,384 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2019-09-05 12:06:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:29,384 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-09-05 12:06:29,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-05 12:06:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-09-05 12:06:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-05 12:06:29,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:29,386 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:29,386 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash -669295011, now seen corresponding path program 79 times [2019-09-05 12:06:29,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:29,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:29,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:31,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:31,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:31,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:31,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-05 12:06:31,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:31,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:32,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:32,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 86 [2019-09-05 12:06:32,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-05 12:06:32,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-05 12:06:32,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3331, Invalid=3979, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 12:06:32,010 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-09-05 12:06:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:32,258 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-09-05 12:06:32,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-05 12:06:32,258 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-09-05 12:06:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:32,260 INFO L225 Difference]: With dead ends: 177 [2019-09-05 12:06:32,260 INFO L226 Difference]: Without dead ends: 172 [2019-09-05 12:06:32,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3337, Invalid=4145, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 12:06:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-05 12:06:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-05 12:06:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-05 12:06:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-09-05 12:06:32,264 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2019-09-05 12:06:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:32,264 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-09-05 12:06:32,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-05 12:06:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-09-05 12:06:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-05 12:06:32,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:32,265 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:32,265 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2108864647, now seen corresponding path program 80 times [2019-09-05 12:06:32,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:32,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:32,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:32,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:32,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:34,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:34,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:34,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:06:34,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:06:34,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:34,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-05 12:06:34,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:34,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (81)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:06:34,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:34,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 87 [2019-09-05 12:06:34,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-05 12:06:34,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-05 12:06:34,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3413, Invalid=4069, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 12:06:34,922 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 87 states. [2019-09-05 12:06:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:35,288 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-09-05 12:06:35,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-05 12:06:35,289 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 170 [2019-09-05 12:06:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:35,290 INFO L225 Difference]: With dead ends: 179 [2019-09-05 12:06:35,290 INFO L226 Difference]: Without dead ends: 174 [2019-09-05 12:06:35,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3419, Invalid=4237, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:06:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-05 12:06:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-05 12:06:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-05 12:06:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-09-05 12:06:35,293 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2019-09-05 12:06:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:35,294 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-09-05 12:06:35,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-05 12:06:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-09-05 12:06:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-05 12:06:35,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:35,295 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:35,295 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:35,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1739151765, now seen corresponding path program 81 times [2019-09-05 12:06:35,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:35,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:35,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:35,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:35,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:37,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:37,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:37,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:06:37,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-09-05 12:06:37,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:37,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-05 12:06:37,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:37,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:38,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:38,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 88 [2019-09-05 12:06:38,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-05 12:06:38,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-05 12:06:38,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3496, Invalid=4160, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:06:38,021 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-09-05 12:06:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:38,239 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-09-05 12:06:38,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-05 12:06:38,239 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-09-05 12:06:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:38,240 INFO L225 Difference]: With dead ends: 181 [2019-09-05 12:06:38,240 INFO L226 Difference]: Without dead ends: 176 [2019-09-05 12:06:38,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3502, Invalid=4330, Unknown=0, NotChecked=0, Total=7832 [2019-09-05 12:06:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-05 12:06:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-05 12:06:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-05 12:06:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-09-05 12:06:38,245 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2019-09-05 12:06:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:38,245 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-09-05 12:06:38,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-05 12:06:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-09-05 12:06:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-05 12:06:38,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:38,246 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:38,247 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:38,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:38,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1716081841, now seen corresponding path program 82 times [2019-09-05 12:06:38,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:38,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:38,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:38,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:38,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:40,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:40,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:40,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:06:40,904 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:06:40,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:40,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-05 12:06:40,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:40,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:41,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:41,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 89 [2019-09-05 12:06:41,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-05 12:06:41,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-05 12:06:41,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3580, Invalid=4252, Unknown=0, NotChecked=0, Total=7832 [2019-09-05 12:06:41,010 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 89 states. [2019-09-05 12:06:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:41,198 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-09-05 12:06:41,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-05 12:06:41,198 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 174 [2019-09-05 12:06:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:41,199 INFO L225 Difference]: With dead ends: 183 [2019-09-05 12:06:41,199 INFO L226 Difference]: Without dead ends: 178 [2019-09-05 12:06:41,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3586, Invalid=4424, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 12:06:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-05 12:06:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-05 12:06:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-05 12:06:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-09-05 12:06:41,203 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2019-09-05 12:06:41,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:41,204 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-09-05 12:06:41,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-05 12:06:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-09-05 12:06:41,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-05 12:06:41,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:41,205 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:41,205 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:41,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1020721357, now seen corresponding path program 83 times [2019-09-05 12:06:41,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:41,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:41,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:41,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:41,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:43,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:43,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:43,742 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:06:43,960 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-09-05 12:06:43,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:43,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-05 12:06:43,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:43,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:44,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:44,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 90 [2019-09-05 12:06:44,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-05 12:06:44,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-05 12:06:44,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3665, Invalid=4345, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 12:06:44,062 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-09-05 12:06:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:44,251 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-09-05 12:06:44,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-05 12:06:44,252 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-09-05 12:06:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:44,253 INFO L225 Difference]: With dead ends: 185 [2019-09-05 12:06:44,253 INFO L226 Difference]: Without dead ends: 180 [2019-09-05 12:06:44,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3671, Invalid=4519, Unknown=0, NotChecked=0, Total=8190 [2019-09-05 12:06:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-05 12:06:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-05 12:06:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-05 12:06:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-09-05 12:06:44,258 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2019-09-05 12:06:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:44,258 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2019-09-05 12:06:44,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-05 12:06:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2019-09-05 12:06:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-05 12:06:44,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:44,259 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:44,259 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:44,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:44,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1500772887, now seen corresponding path program 84 times [2019-09-05 12:06:44,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:44,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:44,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:44,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:44,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:46,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:46,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:46,827 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:06:47,052 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-09-05 12:06:47,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:47,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-05 12:06:47,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:47,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:47,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:47,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 91 [2019-09-05 12:06:47,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-05 12:06:47,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-05 12:06:47,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4439, Unknown=0, NotChecked=0, Total=8190 [2019-09-05 12:06:47,176 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 91 states. [2019-09-05 12:06:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:47,402 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-09-05 12:06:47,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-05 12:06:47,402 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 178 [2019-09-05 12:06:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:47,403 INFO L225 Difference]: With dead ends: 187 [2019-09-05 12:06:47,403 INFO L226 Difference]: Without dead ends: 182 [2019-09-05 12:06:47,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3757, Invalid=4615, Unknown=0, NotChecked=0, Total=8372 [2019-09-05 12:06:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-05 12:06:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-05 12:06:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-05 12:06:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-09-05 12:06:47,408 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2019-09-05 12:06:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:47,409 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-09-05 12:06:47,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-05 12:06:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-09-05 12:06:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-05 12:06:47,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:47,410 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:47,410 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:47,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1999780869, now seen corresponding path program 85 times [2019-09-05 12:06:47,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:47,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:47,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:47,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:47,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:50,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:50,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:50,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:50,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-05 12:06:50,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:50,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:50,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:50,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 92 [2019-09-05 12:06:50,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-05 12:06:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-05 12:06:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3838, Invalid=4534, Unknown=0, NotChecked=0, Total=8372 [2019-09-05 12:06:50,326 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-09-05 12:06:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:50,615 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-09-05 12:06:50,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-05 12:06:50,615 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-09-05 12:06:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:50,616 INFO L225 Difference]: With dead ends: 189 [2019-09-05 12:06:50,616 INFO L226 Difference]: Without dead ends: 184 [2019-09-05 12:06:50,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3844, Invalid=4712, Unknown=0, NotChecked=0, Total=8556 [2019-09-05 12:06:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-05 12:06:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-05 12:06:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-05 12:06:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-09-05 12:06:50,621 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2019-09-05 12:06:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:50,621 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2019-09-05 12:06:50,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-05 12:06:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2019-09-05 12:06:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-05 12:06:50,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:50,622 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:50,622 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1222419679, now seen corresponding path program 86 times [2019-09-05 12:06:50,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:50,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:50,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:53,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:53,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:53,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:06:53,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:06:53,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:53,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-05 12:06:53,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:53,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:53,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:53,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 93 [2019-09-05 12:06:53,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-05 12:06:53,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-05 12:06:53,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=4630, Unknown=0, NotChecked=0, Total=8556 [2019-09-05 12:06:53,561 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 93 states. [2019-09-05 12:06:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:53,795 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-09-05 12:06:53,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-05 12:06:53,796 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 182 [2019-09-05 12:06:53,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:53,797 INFO L225 Difference]: With dead ends: 191 [2019-09-05 12:06:53,797 INFO L226 Difference]: Without dead ends: 186 [2019-09-05 12:06:53,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3932, Invalid=4810, Unknown=0, NotChecked=0, Total=8742 [2019-09-05 12:06:53,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-05 12:06:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-09-05 12:06:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-05 12:06:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-09-05 12:06:53,803 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2019-09-05 12:06:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:53,803 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-09-05 12:06:53,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-05 12:06:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-09-05 12:06:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-05 12:06:53,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:53,804 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:53,805 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:53,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:53,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1085725891, now seen corresponding path program 87 times [2019-09-05 12:06:53,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:53,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:53,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:53,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:53,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:56,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:56,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:56,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:06:56,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-09-05 12:06:56,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:56,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-05 12:06:56,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:56,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:57,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:57,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 94 [2019-09-05 12:06:57,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-05 12:06:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-05 12:06:57,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4015, Invalid=4727, Unknown=0, NotChecked=0, Total=8742 [2019-09-05 12:06:57,020 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-09-05 12:06:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:57,234 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-09-05 12:06:57,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-05 12:06:57,235 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-09-05 12:06:57,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:57,236 INFO L225 Difference]: With dead ends: 193 [2019-09-05 12:06:57,236 INFO L226 Difference]: Without dead ends: 188 [2019-09-05 12:06:57,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4021, Invalid=4909, Unknown=0, NotChecked=0, Total=8930 [2019-09-05 12:06:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-05 12:06:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-05 12:06:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-05 12:06:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-09-05 12:06:57,241 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2019-09-05 12:06:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:57,241 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-09-05 12:06:57,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-05 12:06:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-09-05 12:06:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-05 12:06:57,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:57,242 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:57,242 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:57,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1427985497, now seen corresponding path program 88 times [2019-09-05 12:06:57,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:57,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:57,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:57,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:57,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:00,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:00,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:00,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:07:00,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:07:00,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:00,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-05 12:07:00,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:00,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:00,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:00,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 95 [2019-09-05 12:07:00,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-05 12:07:00,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-05 12:07:00,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4105, Invalid=4825, Unknown=0, NotChecked=0, Total=8930 [2019-09-05 12:07:00,574 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 95 states. [2019-09-05 12:07:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:00,880 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-09-05 12:07:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-05 12:07:00,881 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 186 [2019-09-05 12:07:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:00,882 INFO L225 Difference]: With dead ends: 195 [2019-09-05 12:07:00,882 INFO L226 Difference]: Without dead ends: 190 [2019-09-05 12:07:00,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4111, Invalid=5009, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 12:07:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-05 12:07:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-05 12:07:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-05 12:07:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-09-05 12:07:00,887 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2019-09-05 12:07:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:00,887 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-09-05 12:07:00,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-05 12:07:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-09-05 12:07:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-05 12:07:00,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:00,888 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:00,888 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:00,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:00,889 INFO L82 PathProgramCache]: Analyzing trace with hash -961958283, now seen corresponding path program 89 times [2019-09-05 12:07:00,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:00,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:00,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:00,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:00,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:03,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:03,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:03,758 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:07:03,999 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-09-05 12:07:03,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:04,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-05 12:07:04,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:04,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:04,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:04,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 96 [2019-09-05 12:07:04,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-05 12:07:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-05 12:07:04,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 12:07:04,106 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-09-05 12:07:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:04,376 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-09-05 12:07:04,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-05 12:07:04,377 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-09-05 12:07:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:04,377 INFO L225 Difference]: With dead ends: 197 [2019-09-05 12:07:04,378 INFO L226 Difference]: Without dead ends: 192 [2019-09-05 12:07:04,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 12:07:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-05 12:07:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-05 12:07:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-05 12:07:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-09-05 12:07:04,382 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2019-09-05 12:07:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:04,382 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-09-05 12:07:04,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-05 12:07:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-09-05 12:07:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-05 12:07:04,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:04,384 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:04,384 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:04,384 INFO L82 PathProgramCache]: Analyzing trace with hash 109572497, now seen corresponding path program 90 times [2019-09-05 12:07:04,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:04,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:04,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:04,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:04,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:07,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:07,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:07,332 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:07:07,576 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-09-05 12:07:07,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:07,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-05 12:07:07,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:07,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:07,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:07,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 97 [2019-09-05 12:07:07,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-05 12:07:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-05 12:07:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4288, Invalid=5024, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 12:07:07,686 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 97 states. [2019-09-05 12:07:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:07,883 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-09-05 12:07:07,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-05 12:07:07,883 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 190 [2019-09-05 12:07:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:07,884 INFO L225 Difference]: With dead ends: 199 [2019-09-05 12:07:07,884 INFO L226 Difference]: Without dead ends: 194 [2019-09-05 12:07:07,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4294, Invalid=5212, Unknown=0, NotChecked=0, Total=9506 [2019-09-05 12:07:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-05 12:07:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-05 12:07:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-05 12:07:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-09-05 12:07:07,888 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2019-09-05 12:07:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:07,889 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-09-05 12:07:07,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-05 12:07:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-09-05 12:07:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-05 12:07:07,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:07,890 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:07,890 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:07,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:07,891 INFO L82 PathProgramCache]: Analyzing trace with hash -941498963, now seen corresponding path program 91 times [2019-09-05 12:07:07,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:07,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:07,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:07,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:07,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:10,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:10,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:10,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:11,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-05 12:07:11,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:11,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:11,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:11,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 98 [2019-09-05 12:07:11,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-05 12:07:11,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-05 12:07:11,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4381, Invalid=5125, Unknown=0, NotChecked=0, Total=9506 [2019-09-05 12:07:11,160 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-09-05 12:07:11,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:11,396 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-09-05 12:07:11,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-05 12:07:11,396 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-09-05 12:07:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:11,397 INFO L225 Difference]: With dead ends: 201 [2019-09-05 12:07:11,398 INFO L226 Difference]: Without dead ends: 196 [2019-09-05 12:07:11,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4387, Invalid=5315, Unknown=0, NotChecked=0, Total=9702 [2019-09-05 12:07:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-05 12:07:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-05 12:07:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-05 12:07:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-09-05 12:07:11,402 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2019-09-05 12:07:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:11,402 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2019-09-05 12:07:11,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-05 12:07:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2019-09-05 12:07:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-05 12:07:11,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:11,403 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:11,403 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:11,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:11,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1703857463, now seen corresponding path program 92 times [2019-09-05 12:07:11,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:11,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:11,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:14,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:14,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:14,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:07:14,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:07:14,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:14,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-05 12:07:14,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:14,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:14,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:14,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 99 [2019-09-05 12:07:14,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-05 12:07:14,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-05 12:07:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4475, Invalid=5227, Unknown=0, NotChecked=0, Total=9702 [2019-09-05 12:07:14,778 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 99 states. [2019-09-05 12:07:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:15,046 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-09-05 12:07:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-05 12:07:15,046 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 194 [2019-09-05 12:07:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:15,048 INFO L225 Difference]: With dead ends: 203 [2019-09-05 12:07:15,048 INFO L226 Difference]: Without dead ends: 198 [2019-09-05 12:07:15,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4481, Invalid=5419, Unknown=0, NotChecked=0, Total=9900 [2019-09-05 12:07:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-05 12:07:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-05 12:07:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-05 12:07:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-09-05 12:07:15,054 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2019-09-05 12:07:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:15,054 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-09-05 12:07:15,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-05 12:07:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-09-05 12:07:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-05 12:07:15,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:15,056 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:15,056 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:15,056 INFO L82 PathProgramCache]: Analyzing trace with hash 109031653, now seen corresponding path program 93 times [2019-09-05 12:07:15,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:15,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:15,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:15,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:15,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:18,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:18,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:18,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:07:18,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-09-05 12:07:18,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:18,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-05 12:07:18,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:18,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:18,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:18,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 100 [2019-09-05 12:07:18,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-05 12:07:18,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-05 12:07:18,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4570, Invalid=5330, Unknown=0, NotChecked=0, Total=9900 [2019-09-05 12:07:18,549 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-09-05 12:07:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:18,836 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-09-05 12:07:18,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-05 12:07:18,837 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-09-05 12:07:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:18,838 INFO L225 Difference]: With dead ends: 205 [2019-09-05 12:07:18,838 INFO L226 Difference]: Without dead ends: 200 [2019-09-05 12:07:18,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4576, Invalid=5524, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 12:07:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-05 12:07:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-05 12:07:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-05 12:07:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-09-05 12:07:18,843 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2019-09-05 12:07:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:18,843 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-09-05 12:07:18,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-05 12:07:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-09-05 12:07:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-05 12:07:18,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:18,844 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:18,844 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:18,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1461250047, now seen corresponding path program 94 times [2019-09-05 12:07:18,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:18,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:18,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:18,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:18,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:22,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:22,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:22,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:07:22,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:07:22,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:22,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-05 12:07:22,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:22,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:22,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:22,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 101 [2019-09-05 12:07:22,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-05 12:07:22,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-05 12:07:22,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4666, Invalid=5434, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 12:07:22,293 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 101 states. [2019-09-05 12:07:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:22,518 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-05 12:07:22,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-05 12:07:22,519 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 198 [2019-09-05 12:07:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:22,520 INFO L225 Difference]: With dead ends: 207 [2019-09-05 12:07:22,520 INFO L226 Difference]: Without dead ends: 202 [2019-09-05 12:07:22,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4672, Invalid=5630, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 12:07:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-05 12:07:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-05 12:07:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-05 12:07:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-09-05 12:07:22,525 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2019-09-05 12:07:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:22,525 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-09-05 12:07:22,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-05 12:07:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-09-05 12:07:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-05 12:07:22,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:22,526 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:22,526 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:22,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1326524445, now seen corresponding path program 95 times [2019-09-05 12:07:22,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:22,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:22,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:22,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:22,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:25,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:25,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:25,774 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:07:26,047 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-09-05 12:07:26,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:26,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-05 12:07:26,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:26,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:26,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:26,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 102 [2019-09-05 12:07:26,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-05 12:07:26,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-05 12:07:26,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4763, Invalid=5539, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 12:07:26,165 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-09-05 12:07:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:26,365 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-09-05 12:07:26,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-05 12:07:26,366 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-09-05 12:07:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:26,367 INFO L225 Difference]: With dead ends: 209 [2019-09-05 12:07:26,367 INFO L226 Difference]: Without dead ends: 204 [2019-09-05 12:07:26,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4769, Invalid=5737, Unknown=0, NotChecked=0, Total=10506 [2019-09-05 12:07:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-05 12:07:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-05 12:07:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-05 12:07:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-09-05 12:07:26,371 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2019-09-05 12:07:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:26,371 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2019-09-05 12:07:26,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-05 12:07:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2019-09-05 12:07:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-05 12:07:26,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:26,372 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:26,372 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:26,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:26,372 INFO L82 PathProgramCache]: Analyzing trace with hash 318218553, now seen corresponding path program 96 times [2019-09-05 12:07:26,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:26,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:26,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:26,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:26,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:29,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:29,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:29,850 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:07:30,120 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-09-05 12:07:30,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:30,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-05 12:07:30,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:30,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:30,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:30,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 103 [2019-09-05 12:07:30,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-05 12:07:30,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-05 12:07:30,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4861, Invalid=5645, Unknown=0, NotChecked=0, Total=10506 [2019-09-05 12:07:30,242 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 103 states. [2019-09-05 12:07:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:30,580 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-09-05 12:07:30,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-05 12:07:30,580 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 202 [2019-09-05 12:07:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:30,581 INFO L225 Difference]: With dead ends: 211 [2019-09-05 12:07:30,581 INFO L226 Difference]: Without dead ends: 206 [2019-09-05 12:07:30,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4867, Invalid=5845, Unknown=0, NotChecked=0, Total=10712 [2019-09-05 12:07:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-05 12:07:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-05 12:07:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-05 12:07:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-09-05 12:07:30,585 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2019-09-05 12:07:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:30,585 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-09-05 12:07:30,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-05 12:07:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-09-05 12:07:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-05 12:07:30,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:30,586 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:30,586 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:30,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1998865237, now seen corresponding path program 97 times [2019-09-05 12:07:30,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:30,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:30,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:30,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:30,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:33,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:33,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:33,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:34,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-05 12:07:34,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:34,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:34,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:34,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 104 [2019-09-05 12:07:34,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-05 12:07:34,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-05 12:07:34,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=5752, Unknown=0, NotChecked=0, Total=10712 [2019-09-05 12:07:34,258 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-09-05 12:07:34,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:34,538 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-09-05 12:07:34,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-05 12:07:34,538 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-09-05 12:07:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:34,539 INFO L225 Difference]: With dead ends: 213 [2019-09-05 12:07:34,539 INFO L226 Difference]: Without dead ends: 208 [2019-09-05 12:07:34,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4966, Invalid=5954, Unknown=0, NotChecked=0, Total=10920 [2019-09-05 12:07:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-05 12:07:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-05 12:07:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-05 12:07:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-09-05 12:07:34,544 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2019-09-05 12:07:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:34,544 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-09-05 12:07:34,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-05 12:07:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-09-05 12:07:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-05 12:07:34,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:34,545 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:34,545 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:34,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:34,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2102342031, now seen corresponding path program 98 times [2019-09-05 12:07:34,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:34,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:34,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:34,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:38,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:38,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:38,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:07:38,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:07:38,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:38,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-05 12:07:38,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:38,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:38,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:38,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 105 [2019-09-05 12:07:38,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-05 12:07:38,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-05 12:07:38,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5060, Invalid=5860, Unknown=0, NotChecked=0, Total=10920 [2019-09-05 12:07:38,282 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 105 states. [2019-09-05 12:07:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:38,627 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-09-05 12:07:38,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-05 12:07:38,627 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 206 [2019-09-05 12:07:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:38,629 INFO L225 Difference]: With dead ends: 215 [2019-09-05 12:07:38,629 INFO L226 Difference]: Without dead ends: 210 [2019-09-05 12:07:38,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5066, Invalid=6064, Unknown=0, NotChecked=0, Total=11130 [2019-09-05 12:07:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-05 12:07:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-05 12:07:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-05 12:07:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-09-05 12:07:38,633 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2019-09-05 12:07:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:38,633 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-09-05 12:07:38,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-05 12:07:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-09-05 12:07:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-05 12:07:38,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:38,635 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:38,635 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash -582548851, now seen corresponding path program 99 times [2019-09-05 12:07:38,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:38,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:38,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:38,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:38,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:42,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:42,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:42,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:07:42,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-09-05 12:07:42,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:42,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-05 12:07:42,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:42,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:42,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:42,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 106 [2019-09-05 12:07:42,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-05 12:07:42,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-05 12:07:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5161, Invalid=5969, Unknown=0, NotChecked=0, Total=11130 [2019-09-05 12:07:42,623 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-09-05 12:07:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:42,837 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2019-09-05 12:07:42,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-05 12:07:42,837 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-09-05 12:07:42,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:42,839 INFO L225 Difference]: With dead ends: 217 [2019-09-05 12:07:42,839 INFO L226 Difference]: Without dead ends: 212 [2019-09-05 12:07:42,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5167, Invalid=6175, Unknown=0, NotChecked=0, Total=11342 [2019-09-05 12:07:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-05 12:07:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-09-05 12:07:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-05 12:07:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-09-05 12:07:42,844 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2019-09-05 12:07:42,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:42,845 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-09-05 12:07:42,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-05 12:07:42,845 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-09-05 12:07:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-05 12:07:42,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:42,846 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:42,846 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:42,847 INFO L82 PathProgramCache]: Analyzing trace with hash -350183511, now seen corresponding path program 100 times [2019-09-05 12:07:42,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:42,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:42,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:42,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:46,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:46,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:46,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:07:46,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:07:46,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:46,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-05 12:07:46,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:46,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:46,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 107 [2019-09-05 12:07:46,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-05 12:07:46,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-05 12:07:46,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5263, Invalid=6079, Unknown=0, NotChecked=0, Total=11342 [2019-09-05 12:07:46,791 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 107 states. [2019-09-05 12:07:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:47,175 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-09-05 12:07:47,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-05 12:07:47,175 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 210 [2019-09-05 12:07:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:47,176 INFO L225 Difference]: With dead ends: 219 [2019-09-05 12:07:47,176 INFO L226 Difference]: Without dead ends: 214 [2019-09-05 12:07:47,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5269, Invalid=6287, Unknown=0, NotChecked=0, Total=11556 [2019-09-05 12:07:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-05 12:07:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-09-05 12:07:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-05 12:07:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-09-05 12:07:47,181 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2019-09-05 12:07:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:47,181 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-09-05 12:07:47,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-05 12:07:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-09-05 12:07:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-05 12:07:47,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:47,183 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:47,183 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:47,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:47,183 INFO L82 PathProgramCache]: Analyzing trace with hash -385391163, now seen corresponding path program 101 times [2019-09-05 12:07:47,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:47,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:47,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:47,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:47,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:50,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:50,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:50,888 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:07:51,205 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2019-09-05 12:07:51,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:51,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-05 12:07:51,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:51,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:51,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:51,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 108 [2019-09-05 12:07:51,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-05 12:07:51,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-05 12:07:51,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5366, Invalid=6190, Unknown=0, NotChecked=0, Total=11556 [2019-09-05 12:07:51,358 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-09-05 12:07:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:51,761 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-09-05 12:07:51,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-05 12:07:51,762 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-09-05 12:07:51,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:51,763 INFO L225 Difference]: With dead ends: 221 [2019-09-05 12:07:51,763 INFO L226 Difference]: Without dead ends: 216 [2019-09-05 12:07:51,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5372, Invalid=6400, Unknown=0, NotChecked=0, Total=11772 [2019-09-05 12:07:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-05 12:07:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-09-05 12:07:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-05 12:07:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2019-09-05 12:07:51,768 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2019-09-05 12:07:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:51,768 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2019-09-05 12:07:51,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-05 12:07:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2019-09-05 12:07:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-05 12:07:51,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:51,770 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:51,770 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:51,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:51,770 INFO L82 PathProgramCache]: Analyzing trace with hash 139793633, now seen corresponding path program 102 times [2019-09-05 12:07:51,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:51,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:51,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:51,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:51,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:55,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:55,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:55,540 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:07:55,839 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2019-09-05 12:07:55,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:55,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-05 12:07:55,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:55,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:55,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:55,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 109 [2019-09-05 12:07:55,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-05 12:07:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-05 12:07:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5470, Invalid=6302, Unknown=0, NotChecked=0, Total=11772 [2019-09-05 12:07:55,965 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 109 states. [2019-09-05 12:07:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:56,367 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-09-05 12:07:56,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-05 12:07:56,367 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 214 [2019-09-05 12:07:56,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:56,368 INFO L225 Difference]: With dead ends: 223 [2019-09-05 12:07:56,368 INFO L226 Difference]: Without dead ends: 218 [2019-09-05 12:07:56,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5476, Invalid=6514, Unknown=0, NotChecked=0, Total=11990 [2019-09-05 12:07:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-05 12:07:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-09-05 12:07:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-05 12:07:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-09-05 12:07:56,372 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2019-09-05 12:07:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:56,373 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-09-05 12:07:56,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-05 12:07:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-09-05 12:07:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-05 12:07:56,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:56,374 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:56,374 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:56,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1963758339, now seen corresponding path program 103 times [2019-09-05 12:07:56,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:56,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:56,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:56,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:56,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:00,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:00,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:00,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:00,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-05 12:08:00,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:00,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:00,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:00,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 110 [2019-09-05 12:08:00,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-05 12:08:00,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-05 12:08:00,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5575, Invalid=6415, Unknown=0, NotChecked=0, Total=11990 [2019-09-05 12:08:00,444 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-09-05 12:08:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:00,851 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-09-05 12:08:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-05 12:08:00,851 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-09-05 12:08:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:00,852 INFO L225 Difference]: With dead ends: 225 [2019-09-05 12:08:00,852 INFO L226 Difference]: Without dead ends: 220 [2019-09-05 12:08:00,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5581, Invalid=6629, Unknown=0, NotChecked=0, Total=12210 [2019-09-05 12:08:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-05 12:08:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-09-05 12:08:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-05 12:08:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2019-09-05 12:08:00,857 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2019-09-05 12:08:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:00,857 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2019-09-05 12:08:00,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-05 12:08:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2019-09-05 12:08:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-05 12:08:00,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:00,858 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:00,858 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:00,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:00,858 INFO L82 PathProgramCache]: Analyzing trace with hash -547607015, now seen corresponding path program 104 times [2019-09-05 12:08:00,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:00,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:00,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:00,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:00,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:04,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:04,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:04,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:08:04,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:08:04,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:04,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-05 12:08:04,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:04,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:05,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:05,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 111 [2019-09-05 12:08:05,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-05 12:08:05,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-05 12:08:05,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5681, Invalid=6529, Unknown=0, NotChecked=0, Total=12210 [2019-09-05 12:08:05,091 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 111 states. [2019-09-05 12:08:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:05,512 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-09-05 12:08:05,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-05 12:08:05,512 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 218 [2019-09-05 12:08:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:05,513 INFO L225 Difference]: With dead ends: 227 [2019-09-05 12:08:05,514 INFO L226 Difference]: Without dead ends: 222 [2019-09-05 12:08:05,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5687, Invalid=6745, Unknown=0, NotChecked=0, Total=12432 [2019-09-05 12:08:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-05 12:08:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-09-05 12:08:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-05 12:08:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-09-05 12:08:05,519 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2019-09-05 12:08:05,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:05,519 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-09-05 12:08:05,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-05 12:08:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-09-05 12:08:05,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-05 12:08:05,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:05,520 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:05,520 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:05,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:05,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1130817483, now seen corresponding path program 105 times [2019-09-05 12:08:05,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:05,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:05,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:05,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:05,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:09,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:09,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:09,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:08:09,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2019-09-05 12:08:09,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:09,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-05 12:08:09,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:09,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:09,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:09,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 112 [2019-09-05 12:08:09,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-05 12:08:09,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-05 12:08:09,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5788, Invalid=6644, Unknown=0, NotChecked=0, Total=12432 [2019-09-05 12:08:09,962 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-09-05 12:08:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:10,207 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2019-09-05 12:08:10,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-05 12:08:10,207 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-09-05 12:08:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:10,208 INFO L225 Difference]: With dead ends: 229 [2019-09-05 12:08:10,209 INFO L226 Difference]: Without dead ends: 224 [2019-09-05 12:08:10,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5794, Invalid=6862, Unknown=0, NotChecked=0, Total=12656 [2019-09-05 12:08:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-05 12:08:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-09-05 12:08:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-05 12:08:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-09-05 12:08:10,214 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2019-09-05 12:08:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:10,214 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-09-05 12:08:10,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-05 12:08:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-09-05 12:08:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-05 12:08:10,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:10,215 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:10,216 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:10,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1044638545, now seen corresponding path program 106 times [2019-09-05 12:08:10,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:10,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:10,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:14,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:14,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:14,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:08:14,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:08:14,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:14,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-05 12:08:14,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:14,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:14,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:14,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 113 [2019-09-05 12:08:14,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-05 12:08:14,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-05 12:08:14,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5896, Invalid=6760, Unknown=0, NotChecked=0, Total=12656 [2019-09-05 12:08:14,546 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 113 states. [2019-09-05 12:08:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:14,905 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-09-05 12:08:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-05 12:08:14,906 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 222 [2019-09-05 12:08:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:14,907 INFO L225 Difference]: With dead ends: 231 [2019-09-05 12:08:14,907 INFO L226 Difference]: Without dead ends: 226 [2019-09-05 12:08:14,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5902, Invalid=6980, Unknown=0, NotChecked=0, Total=12882 [2019-09-05 12:08:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-05 12:08:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-09-05 12:08:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-05 12:08:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-09-05 12:08:14,912 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2019-09-05 12:08:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:14,912 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-09-05 12:08:14,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-05 12:08:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-09-05 12:08:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-05 12:08:14,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:14,913 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:14,914 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:14,914 INFO L82 PathProgramCache]: Analyzing trace with hash 8808301, now seen corresponding path program 107 times [2019-09-05 12:08:14,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:14,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:14,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:14,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:14,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:19,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:19,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:19,093 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:08:19,407 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2019-09-05 12:08:19,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:19,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-05 12:08:19,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:19,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:19,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:19,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 114 [2019-09-05 12:08:19,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-05 12:08:19,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-05 12:08:19,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6005, Invalid=6877, Unknown=0, NotChecked=0, Total=12882 [2019-09-05 12:08:19,543 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-09-05 12:08:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:20,001 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2019-09-05 12:08:20,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-05 12:08:20,001 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-09-05 12:08:20,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:20,002 INFO L225 Difference]: With dead ends: 233 [2019-09-05 12:08:20,003 INFO L226 Difference]: Without dead ends: 228 [2019-09-05 12:08:20,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6011, Invalid=7099, Unknown=0, NotChecked=0, Total=13110 [2019-09-05 12:08:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-05 12:08:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-09-05 12:08:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-05 12:08:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-09-05 12:08:20,007 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2019-09-05 12:08:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:20,007 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-09-05 12:08:20,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-05 12:08:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-09-05 12:08:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-05 12:08:20,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:20,008 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:20,008 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:20,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:20,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1008356489, now seen corresponding path program 108 times [2019-09-05 12:08:20,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:20,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:20,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:20,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:20,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:24,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:24,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:24,216 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:08:24,533 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2019-09-05 12:08:24,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:24,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-05 12:08:24,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:24,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:24,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:24,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 115 [2019-09-05 12:08:24,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-05 12:08:24,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-05 12:08:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6115, Invalid=6995, Unknown=0, NotChecked=0, Total=13110 [2019-09-05 12:08:24,673 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 115 states. [2019-09-05 12:08:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:25,000 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-09-05 12:08:25,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-05 12:08:25,000 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 226 [2019-09-05 12:08:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:25,001 INFO L225 Difference]: With dead ends: 235 [2019-09-05 12:08:25,001 INFO L226 Difference]: Without dead ends: 230 [2019-09-05 12:08:25,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6121, Invalid=7219, Unknown=0, NotChecked=0, Total=13340 [2019-09-05 12:08:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-05 12:08:25,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-09-05 12:08:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-05 12:08:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-09-05 12:08:25,004 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2019-09-05 12:08:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:25,004 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-09-05 12:08:25,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-05 12:08:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-09-05 12:08:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-05 12:08:25,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:25,005 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:25,005 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:25,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash -498509147, now seen corresponding path program 109 times [2019-09-05 12:08:25,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:25,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:25,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:29,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:29,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:29,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:29,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-05 12:08:29,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:29,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:29,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:29,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 116 [2019-09-05 12:08:29,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-05 12:08:29,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-05 12:08:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6226, Invalid=7114, Unknown=0, NotChecked=0, Total=13340 [2019-09-05 12:08:29,567 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-09-05 12:08:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:29,849 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-09-05 12:08:29,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-05 12:08:29,850 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-09-05 12:08:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:29,851 INFO L225 Difference]: With dead ends: 237 [2019-09-05 12:08:29,851 INFO L226 Difference]: Without dead ends: 232 [2019-09-05 12:08:29,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6232, Invalid=7340, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 12:08:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-05 12:08:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2019-09-05 12:08:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-05 12:08:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-09-05 12:08:29,855 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2019-09-05 12:08:29,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:29,856 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-09-05 12:08:29,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-05 12:08:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-09-05 12:08:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-05 12:08:29,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:29,857 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:29,857 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:29,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1192406591, now seen corresponding path program 110 times [2019-09-05 12:08:29,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:29,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:29,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:29,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:34,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:34,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:34,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:08:34,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:08:34,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:34,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-05 12:08:34,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:34,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:34,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:34,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 117 [2019-09-05 12:08:34,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-05 12:08:34,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-05 12:08:34,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6338, Invalid=7234, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 12:08:34,563 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 117 states. [2019-09-05 12:08:35,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:35,046 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-09-05 12:08:35,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-05 12:08:35,047 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 230 [2019-09-05 12:08:35,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:35,047 INFO L225 Difference]: With dead ends: 239 [2019-09-05 12:08:35,048 INFO L226 Difference]: Without dead ends: 234 [2019-09-05 12:08:35,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6344, Invalid=7462, Unknown=0, NotChecked=0, Total=13806 [2019-09-05 12:08:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-05 12:08:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-09-05 12:08:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-05 12:08:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-09-05 12:08:35,052 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2019-09-05 12:08:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:35,052 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-09-05 12:08:35,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-05 12:08:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-09-05 12:08:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-05 12:08:35,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:35,053 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:35,053 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:35,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:35,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1987047901, now seen corresponding path program 111 times [2019-09-05 12:08:35,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:35,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:35,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:35,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:35,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:39,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:39,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:39,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:08:39,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2019-09-05 12:08:39,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:39,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-05 12:08:39,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:39,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:39,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:39,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 118 [2019-09-05 12:08:39,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-05 12:08:39,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-05 12:08:39,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6451, Invalid=7355, Unknown=0, NotChecked=0, Total=13806 [2019-09-05 12:08:39,952 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-09-05 12:08:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:40,437 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2019-09-05 12:08:40,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-05 12:08:40,437 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-09-05 12:08:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:40,438 INFO L225 Difference]: With dead ends: 241 [2019-09-05 12:08:40,438 INFO L226 Difference]: Without dead ends: 236 [2019-09-05 12:08:40,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6457, Invalid=7585, Unknown=0, NotChecked=0, Total=14042 [2019-09-05 12:08:40,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-05 12:08:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-09-05 12:08:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-05 12:08:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-09-05 12:08:40,442 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2019-09-05 12:08:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:40,442 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-09-05 12:08:40,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-05 12:08:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-09-05 12:08:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-05 12:08:40,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:40,443 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:40,443 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:40,443 INFO L82 PathProgramCache]: Analyzing trace with hash -573900039, now seen corresponding path program 112 times [2019-09-05 12:08:40,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:40,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:40,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:44,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:44,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:44,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:08:45,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:08:45,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:45,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-05 12:08:45,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:45,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:45,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:45,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 119 [2019-09-05 12:08:45,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-05 12:08:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-05 12:08:45,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6565, Invalid=7477, Unknown=0, NotChecked=0, Total=14042 [2019-09-05 12:08:45,251 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 119 states. [2019-09-05 12:08:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:45,734 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-09-05 12:08:45,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-05 12:08:45,734 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 234 [2019-09-05 12:08:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:45,735 INFO L225 Difference]: With dead ends: 243 [2019-09-05 12:08:45,735 INFO L226 Difference]: Without dead ends: 238 [2019-09-05 12:08:45,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6571, Invalid=7709, Unknown=0, NotChecked=0, Total=14280 [2019-09-05 12:08:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-05 12:08:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-09-05 12:08:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-05 12:08:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-09-05 12:08:45,740 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2019-09-05 12:08:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:45,740 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-09-05 12:08:45,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-05 12:08:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-09-05 12:08:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-05 12:08:45,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:45,741 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:45,741 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:45,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash -628609771, now seen corresponding path program 113 times [2019-09-05 12:08:45,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:45,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:45,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:45,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:45,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:50,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:50,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:50,346 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:08:50,693 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2019-09-05 12:08:50,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:50,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-05 12:08:50,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:50,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:50,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:50,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 120 [2019-09-05 12:08:50,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-05 12:08:50,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-05 12:08:50,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6680, Invalid=7600, Unknown=0, NotChecked=0, Total=14280 [2019-09-05 12:08:50,858 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-09-05 12:08:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:51,369 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-09-05 12:08:51,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-05 12:08:51,369 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-09-05 12:08:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:51,370 INFO L225 Difference]: With dead ends: 245 [2019-09-05 12:08:51,370 INFO L226 Difference]: Without dead ends: 240 [2019-09-05 12:08:51,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6686, Invalid=7834, Unknown=0, NotChecked=0, Total=14520 [2019-09-05 12:08:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-05 12:08:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-09-05 12:08:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-05 12:08:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2019-09-05 12:08:51,375 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2019-09-05 12:08:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:51,375 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2019-09-05 12:08:51,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-05 12:08:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2019-09-05 12:08:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-05 12:08:51,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:51,377 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:51,377 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:51,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:51,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1665054671, now seen corresponding path program 114 times [2019-09-05 12:08:51,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:51,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:51,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:51,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:51,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:55,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:55,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:08:56,343 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2019-09-05 12:08:56,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:56,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-05 12:08:56,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:56,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:56,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:56,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 121 [2019-09-05 12:08:56,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-05 12:08:56,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-05 12:08:56,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6796, Invalid=7724, Unknown=0, NotChecked=0, Total=14520 [2019-09-05 12:08:56,489 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 121 states. [2019-09-05 12:08:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:56,974 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-09-05 12:08:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-05 12:08:56,974 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 238 [2019-09-05 12:08:56,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:56,975 INFO L225 Difference]: With dead ends: 247 [2019-09-05 12:08:56,975 INFO L226 Difference]: Without dead ends: 242 [2019-09-05 12:08:56,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6802, Invalid=7960, Unknown=0, NotChecked=0, Total=14762 [2019-09-05 12:08:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-05 12:08:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-09-05 12:08:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-05 12:08:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-09-05 12:08:56,980 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2019-09-05 12:08:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:56,980 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-09-05 12:08:56,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-05 12:08:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-09-05 12:08:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-05 12:08:56,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:56,981 INFO L399 BasicCegarLoop]: trace histogram [115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:56,981 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:56,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:56,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1256190899, now seen corresponding path program 115 times [2019-09-05 12:08:56,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:56,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:56,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:56,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:56,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 0 proven. 13225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:01,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:01,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:01,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:01,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-05 12:09:01,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:01,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 0 proven. 13225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:02,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:02,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 122 [2019-09-05 12:09:02,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-05 12:09:02,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-05 12:09:02,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6913, Invalid=7849, Unknown=0, NotChecked=0, Total=14762 [2019-09-05 12:09:02,065 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-09-05 12:09:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:02,363 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-09-05 12:09:02,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-05 12:09:02,364 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-09-05 12:09:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:02,365 INFO L225 Difference]: With dead ends: 249 [2019-09-05 12:09:02,365 INFO L226 Difference]: Without dead ends: 244 [2019-09-05 12:09:02,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6919, Invalid=8087, Unknown=0, NotChecked=0, Total=15006 [2019-09-05 12:09:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-05 12:09:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2019-09-05 12:09:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-05 12:09:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2019-09-05 12:09:02,369 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2019-09-05 12:09:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:02,370 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2019-09-05 12:09:02,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-05 12:09:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2019-09-05 12:09:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-05 12:09:02,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:02,370 INFO L399 BasicCegarLoop]: trace histogram [116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:02,371 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash 819870057, now seen corresponding path program 116 times [2019-09-05 12:09:02,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:02,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:02,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:02,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:07,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:07,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:09:07,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:09:07,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:07,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-05 12:09:07,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:07,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:07,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:07,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 123 [2019-09-05 12:09:07,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-05 12:09:07,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-05 12:09:07,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7031, Invalid=7975, Unknown=0, NotChecked=0, Total=15006 [2019-09-05 12:09:07,543 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 123 states. [2019-09-05 12:09:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:07,924 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-09-05 12:09:07,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-05 12:09:07,924 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 242 [2019-09-05 12:09:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:07,925 INFO L225 Difference]: With dead ends: 251 [2019-09-05 12:09:07,925 INFO L226 Difference]: Without dead ends: 246 [2019-09-05 12:09:07,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7037, Invalid=8215, Unknown=0, NotChecked=0, Total=15252 [2019-09-05 12:09:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-05 12:09:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-09-05 12:09:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-05 12:09:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-09-05 12:09:07,929 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2019-09-05 12:09:07,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:07,929 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-09-05 12:09:07,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-05 12:09:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-09-05 12:09:07,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-05 12:09:07,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:07,930 INFO L399 BasicCegarLoop]: trace histogram [117, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:07,930 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:07,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:07,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1245343867, now seen corresponding path program 117 times [2019-09-05 12:09:07,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:07,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:07,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:07,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:07,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 0 proven. 13689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:12,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:12,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:12,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:09:13,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 118 check-sat command(s) [2019-09-05 12:09:13,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:13,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-05 12:09:13,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:13,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 0 proven. 13689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:13,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:13,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 124 [2019-09-05 12:09:13,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-05 12:09:13,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-05 12:09:13,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7150, Invalid=8102, Unknown=0, NotChecked=0, Total=15252 [2019-09-05 12:09:13,537 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-09-05 12:09:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:14,112 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2019-09-05 12:09:14,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-05 12:09:14,112 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-09-05 12:09:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:14,113 INFO L225 Difference]: With dead ends: 253 [2019-09-05 12:09:14,114 INFO L226 Difference]: Without dead ends: 248 [2019-09-05 12:09:14,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7156, Invalid=8344, Unknown=0, NotChecked=0, Total=15500 [2019-09-05 12:09:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-05 12:09:14,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-09-05 12:09:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-05 12:09:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-09-05 12:09:14,119 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2019-09-05 12:09:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:14,119 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-09-05 12:09:14,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-05 12:09:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-09-05 12:09:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-05 12:09:14,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:14,120 INFO L399 BasicCegarLoop]: trace histogram [118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:14,120 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:14,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1641034079, now seen corresponding path program 118 times [2019-09-05 12:09:14,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:14,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:14,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:14,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:14,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:19,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:19,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:19,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:09:19,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:09:19,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:19,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-05 12:09:19,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:19,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:19,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:19,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 125 [2019-09-05 12:09:19,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-05 12:09:19,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-05 12:09:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7270, Invalid=8230, Unknown=0, NotChecked=0, Total=15500 [2019-09-05 12:09:19,374 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 125 states. [2019-09-05 12:09:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:19,854 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-09-05 12:09:19,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-05 12:09:19,854 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 246 [2019-09-05 12:09:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:19,855 INFO L225 Difference]: With dead ends: 255 [2019-09-05 12:09:19,855 INFO L226 Difference]: Without dead ends: 250 [2019-09-05 12:09:19,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7276, Invalid=8474, Unknown=0, NotChecked=0, Total=15750 [2019-09-05 12:09:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-05 12:09:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-09-05 12:09:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-05 12:09:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-09-05 12:09:19,860 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2019-09-05 12:09:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:19,860 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-09-05 12:09:19,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-05 12:09:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-09-05 12:09:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-05 12:09:19,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:19,861 INFO L399 BasicCegarLoop]: trace histogram [119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:19,861 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:19,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash 352761533, now seen corresponding path program 119 times [2019-09-05 12:09:19,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:19,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:19,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:19,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 0 proven. 14161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:24,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:24,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:24,937 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:09:25,317 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 120 check-sat command(s) [2019-09-05 12:09:25,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:25,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-05 12:09:25,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:25,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 0 proven. 14161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:25,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:25,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 126 [2019-09-05 12:09:25,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-05 12:09:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-05 12:09:25,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7391, Invalid=8359, Unknown=0, NotChecked=0, Total=15750 [2019-09-05 12:09:25,509 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-09-05 12:09:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:25,827 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2019-09-05 12:09:25,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-05 12:09:25,828 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-09-05 12:09:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:25,829 INFO L225 Difference]: With dead ends: 257 [2019-09-05 12:09:25,829 INFO L226 Difference]: Without dead ends: 252 [2019-09-05 12:09:25,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7397, Invalid=8605, Unknown=0, NotChecked=0, Total=16002 [2019-09-05 12:09:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-05 12:09:25,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-09-05 12:09:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-05 12:09:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-09-05 12:09:25,834 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2019-09-05 12:09:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:25,834 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-09-05 12:09:25,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-05 12:09:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-09-05 12:09:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-05 12:09:25,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:25,835 INFO L399 BasicCegarLoop]: trace histogram [120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:25,835 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:25,835 INFO L82 PathProgramCache]: Analyzing trace with hash 834930649, now seen corresponding path program 120 times [2019-09-05 12:09:25,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:25,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:25,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:25,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:25,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:30,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:30,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:30,929 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:09:31,308 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 121 check-sat command(s) [2019-09-05 12:09:31,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:31,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-05 12:09:31,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:31,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:31,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:31,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 127 [2019-09-05 12:09:31,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-05 12:09:31,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-05 12:09:31,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7513, Invalid=8489, Unknown=0, NotChecked=0, Total=16002 [2019-09-05 12:09:31,461 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 127 states. [2019-09-05 12:09:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:32,068 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-09-05 12:09:32,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-05 12:09:32,069 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 250 [2019-09-05 12:09:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:32,069 INFO L225 Difference]: With dead ends: 259 [2019-09-05 12:09:32,069 INFO L226 Difference]: Without dead ends: 254 [2019-09-05 12:09:32,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7519, Invalid=8737, Unknown=0, NotChecked=0, Total=16256 [2019-09-05 12:09:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-05 12:09:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-09-05 12:09:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-05 12:09:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-09-05 12:09:32,073 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2019-09-05 12:09:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:32,074 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-09-05 12:09:32,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-05 12:09:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-09-05 12:09:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-05 12:09:32,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:32,075 INFO L399 BasicCegarLoop]: trace histogram [121, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:32,075 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:32,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:32,075 INFO L82 PathProgramCache]: Analyzing trace with hash 342983157, now seen corresponding path program 121 times [2019-09-05 12:09:32,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:32,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:32,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:32,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:32,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 0 proven. 14641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:37,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:37,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:37,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:37,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-05 12:09:37,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:37,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 0 proven. 14641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:37,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:37,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 128 [2019-09-05 12:09:37,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-05 12:09:37,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-05 12:09:37,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7636, Invalid=8620, Unknown=0, NotChecked=0, Total=16256 [2019-09-05 12:09:37,659 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-09-05 12:09:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:38,292 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-09-05 12:09:38,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-05 12:09:38,292 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-09-05 12:09:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:38,293 INFO L225 Difference]: With dead ends: 261 [2019-09-05 12:09:38,293 INFO L226 Difference]: Without dead ends: 256 [2019-09-05 12:09:38,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7642, Invalid=8870, Unknown=0, NotChecked=0, Total=16512 [2019-09-05 12:09:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-05 12:09:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2019-09-05 12:09:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-05 12:09:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2019-09-05 12:09:38,298 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2019-09-05 12:09:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:38,299 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2019-09-05 12:09:38,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-05 12:09:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2019-09-05 12:09:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-05 12:09:38,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:38,300 INFO L399 BasicCegarLoop]: trace histogram [122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:38,300 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash 27845905, now seen corresponding path program 122 times [2019-09-05 12:09:38,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:38,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:38,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:38,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:43,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:43,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:43,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:43,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:09:43,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:09:43,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:43,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-05 12:09:43,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:43,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:43,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:43,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 129 [2019-09-05 12:09:43,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-05 12:09:43,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-05 12:09:43,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7760, Invalid=8752, Unknown=0, NotChecked=0, Total=16512 [2019-09-05 12:09:43,968 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 129 states. [2019-09-05 12:09:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:44,603 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-09-05 12:09:44,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-05 12:09:44,604 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 254 [2019-09-05 12:09:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:44,604 INFO L225 Difference]: With dead ends: 263 [2019-09-05 12:09:44,605 INFO L226 Difference]: Without dead ends: 258 [2019-09-05 12:09:44,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7766, Invalid=9004, Unknown=0, NotChecked=0, Total=16770 [2019-09-05 12:09:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-05 12:09:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-09-05 12:09:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-05 12:09:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-09-05 12:09:44,608 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2019-09-05 12:09:44,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:44,609 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-09-05 12:09:44,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-05 12:09:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-09-05 12:09:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-05 12:09:44,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:44,610 INFO L399 BasicCegarLoop]: trace histogram [123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:44,610 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2123624749, now seen corresponding path program 123 times [2019-09-05 12:09:44,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:44,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:44,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 0 proven. 15129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:50,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:50,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:50,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:09:50,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2019-09-05 12:09:50,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:50,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-05 12:09:50,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:50,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 0 proven. 15129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:50,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:50,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 130 [2019-09-05 12:09:50,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-05 12:09:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-05 12:09:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7885, Invalid=8885, Unknown=0, NotChecked=0, Total=16770 [2019-09-05 12:09:50,607 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-09-05 12:09:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:51,268 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-09-05 12:09:51,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-05 12:09:51,268 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-09-05 12:09:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:51,269 INFO L225 Difference]: With dead ends: 265 [2019-09-05 12:09:51,270 INFO L226 Difference]: Without dead ends: 260 [2019-09-05 12:09:51,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7891, Invalid=9139, Unknown=0, NotChecked=0, Total=17030 [2019-09-05 12:09:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-05 12:09:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-09-05 12:09:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-05 12:09:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-09-05 12:09:51,274 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2019-09-05 12:09:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:51,274 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-09-05 12:09:51,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-05 12:09:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-09-05 12:09:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-05 12:09:51,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:51,275 INFO L399 BasicCegarLoop]: trace histogram [124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:51,275 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:51,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:51,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1827432009, now seen corresponding path program 124 times [2019-09-05 12:09:51,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:51,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:51,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:51,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:51,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:56,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:56,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:56,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:09:56,947 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:09:56,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:56,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-05 12:09:56,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:56,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:57,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:57,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 131 [2019-09-05 12:09:57,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-05 12:09:57,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-05 12:09:57,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8011, Invalid=9019, Unknown=0, NotChecked=0, Total=17030 [2019-09-05 12:09:57,100 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 131 states. [2019-09-05 12:09:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:57,767 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-09-05 12:09:57,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-05 12:09:57,767 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 258 [2019-09-05 12:09:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:57,768 INFO L225 Difference]: With dead ends: 267 [2019-09-05 12:09:57,768 INFO L226 Difference]: Without dead ends: 262 [2019-09-05 12:09:57,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8017, Invalid=9275, Unknown=0, NotChecked=0, Total=17292 [2019-09-05 12:09:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-05 12:09:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-09-05 12:09:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-05 12:09:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-09-05 12:09:57,773 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2019-09-05 12:09:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:57,773 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-09-05 12:09:57,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-05 12:09:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-09-05 12:09:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-05 12:09:57,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:57,775 INFO L399 BasicCegarLoop]: trace histogram [125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:57,775 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:57,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:57,775 INFO L82 PathProgramCache]: Analyzing trace with hash 654050405, now seen corresponding path program 125 times [2019-09-05 12:09:57,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:57,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:57,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:57,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:57,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 0 proven. 15625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:03,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:03,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:03,448 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:10:03,859 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 126 check-sat command(s) [2019-09-05 12:10:03,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:03,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-05 12:10:03,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:03,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 0 proven. 15625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:04,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:04,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130] total 132 [2019-09-05 12:10:04,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-05 12:10:04,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-05 12:10:04,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8138, Invalid=9154, Unknown=0, NotChecked=0, Total=17292 [2019-09-05 12:10:04,018 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-09-05 12:10:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:04,328 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2019-09-05 12:10:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-05 12:10:04,328 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-09-05 12:10:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:04,329 INFO L225 Difference]: With dead ends: 269 [2019-09-05 12:10:04,329 INFO L226 Difference]: Without dead ends: 264 [2019-09-05 12:10:04,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8144, Invalid=9412, Unknown=0, NotChecked=0, Total=17556 [2019-09-05 12:10:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-05 12:10:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2019-09-05 12:10:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-05 12:10:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2019-09-05 12:10:04,334 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2019-09-05 12:10:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:04,334 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2019-09-05 12:10:04,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-05 12:10:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2019-09-05 12:10:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-05 12:10:04,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:04,335 INFO L399 BasicCegarLoop]: trace histogram [126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:04,335 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:04,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1684239487, now seen corresponding path program 126 times [2019-09-05 12:10:04,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:04,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:04,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:04,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:04,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 15876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:10,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:10,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:10,049 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:10:10,459 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2019-09-05 12:10:10,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:10,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 1410 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-05 12:10:10,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:10,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 15876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:10,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:10,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 133 [2019-09-05 12:10:10,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-05 12:10:10,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-05 12:10:10,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8266, Invalid=9290, Unknown=0, NotChecked=0, Total=17556 [2019-09-05 12:10:10,618 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 133 states. [2019-09-05 12:10:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:11,250 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-09-05 12:10:11,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-05 12:10:11,250 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 262 [2019-09-05 12:10:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:11,251 INFO L225 Difference]: With dead ends: 271 [2019-09-05 12:10:11,251 INFO L226 Difference]: Without dead ends: 266 [2019-09-05 12:10:11,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8272, Invalid=9550, Unknown=0, NotChecked=0, Total=17822 [2019-09-05 12:10:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-05 12:10:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-09-05 12:10:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-05 12:10:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-09-05 12:10:11,256 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2019-09-05 12:10:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:11,257 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-09-05 12:10:11,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-05 12:10:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-09-05 12:10:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-05 12:10:11,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:11,258 INFO L399 BasicCegarLoop]: trace histogram [127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:11,258 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1782037405, now seen corresponding path program 127 times [2019-09-05 12:10:11,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:11,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:11,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:11,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:11,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 0 proven. 16129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:16,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:16,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:16,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:17,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-05 12:10:17,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 0 proven. 16129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:17,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:17,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 134 [2019-09-05 12:10:17,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-09-05 12:10:17,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-09-05 12:10:17,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8395, Invalid=9427, Unknown=0, NotChecked=0, Total=17822 [2019-09-05 12:10:17,299 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-09-05 12:10:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:17,986 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-09-05 12:10:17,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-05 12:10:17,987 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-09-05 12:10:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:17,988 INFO L225 Difference]: With dead ends: 273 [2019-09-05 12:10:17,988 INFO L226 Difference]: Without dead ends: 268 [2019-09-05 12:10:17,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8401, Invalid=9689, Unknown=0, NotChecked=0, Total=18090 [2019-09-05 12:10:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-05 12:10:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2019-09-05 12:10:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-05 12:10:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-09-05 12:10:17,994 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2019-09-05 12:10:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:17,994 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2019-09-05 12:10:17,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-09-05 12:10:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2019-09-05 12:10:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-05 12:10:17,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:17,995 INFO L399 BasicCegarLoop]: trace histogram [128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:17,996 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:17,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:17,996 INFO L82 PathProgramCache]: Analyzing trace with hash -20491079, now seen corresponding path program 128 times [2019-09-05 12:10:17,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:17,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:17,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:17,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:17,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 16384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:23,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:23,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:23,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:10:23,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:10:23,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:23,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 135 conjunts are in the unsatisfiable core [2019-09-05 12:10:23,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:24,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 16384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:24,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:24,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 135 [2019-09-05 12:10:24,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-05 12:10:24,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-05 12:10:24,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8525, Invalid=9565, Unknown=0, NotChecked=0, Total=18090 [2019-09-05 12:10:24,151 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 135 states. [2019-09-05 12:10:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:24,786 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-09-05 12:10:24,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-05 12:10:24,787 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 266 [2019-09-05 12:10:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:24,788 INFO L225 Difference]: With dead ends: 275 [2019-09-05 12:10:24,788 INFO L226 Difference]: Without dead ends: 270 [2019-09-05 12:10:24,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8531, Invalid=9829, Unknown=0, NotChecked=0, Total=18360 [2019-09-05 12:10:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-05 12:10:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-09-05 12:10:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-05 12:10:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-09-05 12:10:24,792 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2019-09-05 12:10:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:24,793 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-09-05 12:10:24,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-05 12:10:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-09-05 12:10:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-05 12:10:24,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:24,794 INFO L399 BasicCegarLoop]: trace histogram [129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:24,794 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1378543915, now seen corresponding path program 129 times [2019-09-05 12:10:24,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:24,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:24,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 0 proven. 16641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:30,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:30,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:30,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:10:31,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 130 check-sat command(s) [2019-09-05 12:10:31,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:31,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1443 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-05 12:10:31,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:31,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 0 proven. 16641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:31,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:31,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 136 [2019-09-05 12:10:31,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-05 12:10:31,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-05 12:10:31,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8656, Invalid=9704, Unknown=0, NotChecked=0, Total=18360 [2019-09-05 12:10:31,318 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-09-05 12:10:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:31,675 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2019-09-05 12:10:31,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-05 12:10:31,675 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-09-05 12:10:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:31,676 INFO L225 Difference]: With dead ends: 277 [2019-09-05 12:10:31,676 INFO L226 Difference]: Without dead ends: 272 [2019-09-05 12:10:31,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8662, Invalid=9970, Unknown=0, NotChecked=0, Total=18632 [2019-09-05 12:10:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-05 12:10:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-09-05 12:10:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-05 12:10:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-09-05 12:10:31,680 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2019-09-05 12:10:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:31,680 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-09-05 12:10:31,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-05 12:10:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-09-05 12:10:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-05 12:10:31,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:31,681 INFO L399 BasicCegarLoop]: trace histogram [130, 130, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:31,681 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:31,682 INFO L82 PathProgramCache]: Analyzing trace with hash -797261327, now seen corresponding path program 130 times [2019-09-05 12:10:31,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:31,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:31,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:31,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:31,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 16900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:37,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:37,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:37,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:10:37,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:10:37,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:37,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-05 12:10:37,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:37,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 16900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:37,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:37,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 137 [2019-09-05 12:10:37,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-05 12:10:37,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-05 12:10:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8788, Invalid=9844, Unknown=0, NotChecked=0, Total=18632 [2019-09-05 12:10:37,954 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 137 states. [2019-09-05 12:10:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:38,345 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-09-05 12:10:38,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-05 12:10:38,346 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 270 [2019-09-05 12:10:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:38,347 INFO L225 Difference]: With dead ends: 279 [2019-09-05 12:10:38,347 INFO L226 Difference]: Without dead ends: 274 [2019-09-05 12:10:38,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8794, Invalid=10112, Unknown=0, NotChecked=0, Total=18906 [2019-09-05 12:10:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-05 12:10:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-09-05 12:10:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-05 12:10:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-09-05 12:10:38,351 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2019-09-05 12:10:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:38,351 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-09-05 12:10:38,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-05 12:10:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-09-05 12:10:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-05 12:10:38,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:38,352 INFO L399 BasicCegarLoop]: trace histogram [131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:38,352 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash -530442739, now seen corresponding path program 131 times [2019-09-05 12:10:38,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:38,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:38,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 0 proven. 17161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:44,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:44,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:44,411 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:10:44,845 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 132 check-sat command(s) [2019-09-05 12:10:44,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:44,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-05 12:10:44,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:44,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 0 proven. 17161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:45,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:45,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136] total 138 [2019-09-05 12:10:45,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-05 12:10:45,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-05 12:10:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8921, Invalid=9985, Unknown=0, NotChecked=0, Total=18906 [2019-09-05 12:10:45,016 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-09-05 12:10:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:45,530 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-09-05 12:10:45,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-05 12:10:45,531 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-09-05 12:10:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:45,532 INFO L225 Difference]: With dead ends: 281 [2019-09-05 12:10:45,532 INFO L226 Difference]: Without dead ends: 276 [2019-09-05 12:10:45,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8927, Invalid=10255, Unknown=0, NotChecked=0, Total=19182 [2019-09-05 12:10:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-05 12:10:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2019-09-05 12:10:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-05 12:10:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2019-09-05 12:10:45,537 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2019-09-05 12:10:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:45,537 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2019-09-05 12:10:45,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-05 12:10:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2019-09-05 12:10:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-05 12:10:45,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:45,538 INFO L399 BasicCegarLoop]: trace histogram [132, 132, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:45,538 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:45,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1815817431, now seen corresponding path program 132 times [2019-09-05 12:10:45,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:45,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:45,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:45,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:45,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:51,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:51,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:51,697 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:10:52,136 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 133 check-sat command(s) [2019-09-05 12:10:52,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:52,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-05 12:10:52,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:52,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:52,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:52,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 139 [2019-09-05 12:10:52,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-05 12:10:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-05 12:10:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9055, Invalid=10127, Unknown=0, NotChecked=0, Total=19182 [2019-09-05 12:10:52,307 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 139 states. [2019-09-05 12:10:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:52,815 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-09-05 12:10:52,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-05 12:10:52,816 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 274 [2019-09-05 12:10:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:52,817 INFO L225 Difference]: With dead ends: 283 [2019-09-05 12:10:52,817 INFO L226 Difference]: Without dead ends: 278 [2019-09-05 12:10:52,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9061, Invalid=10399, Unknown=0, NotChecked=0, Total=19460 [2019-09-05 12:10:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-05 12:10:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-09-05 12:10:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-05 12:10:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-09-05 12:10:52,820 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2019-09-05 12:10:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:52,821 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-09-05 12:10:52,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-05 12:10:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-09-05 12:10:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-05 12:10:52,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:52,822 INFO L399 BasicCegarLoop]: trace histogram [133, 133, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:52,822 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:52,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:52,822 INFO L82 PathProgramCache]: Analyzing trace with hash -110315195, now seen corresponding path program 133 times [2019-09-05 12:10:52,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:52,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:52,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:52,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:52,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 0 proven. 17689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:59,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:59,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:59,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:59,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-05 12:10:59,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:59,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 0 proven. 17689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:59,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:59,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138] total 140 [2019-09-05 12:10:59,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-09-05 12:10:59,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-09-05 12:10:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9190, Invalid=10270, Unknown=0, NotChecked=0, Total=19460 [2019-09-05 12:10:59,592 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-09-05 12:11:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:00,046 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-09-05 12:11:00,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-05 12:11:00,047 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-09-05 12:11:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:00,048 INFO L225 Difference]: With dead ends: 285 [2019-09-05 12:11:00,048 INFO L226 Difference]: Without dead ends: 280 [2019-09-05 12:11:00,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9196, Invalid=10544, Unknown=0, NotChecked=0, Total=19740 [2019-09-05 12:11:00,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-05 12:11:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2019-09-05 12:11:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-05 12:11:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2019-09-05 12:11:00,053 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2019-09-05 12:11:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:00,054 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2019-09-05 12:11:00,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-09-05 12:11:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2019-09-05 12:11:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-05 12:11:00,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:00,055 INFO L399 BasicCegarLoop]: trace histogram [134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:00,055 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:00,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1800173471, now seen corresponding path program 134 times [2019-09-05 12:11:00,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:00,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:00,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:00,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:11:00,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:06,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:06,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:06,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:11:06,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:11:06,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:06,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-05 12:11:06,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:06,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:06,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:06,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 141 [2019-09-05 12:11:06,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-05 12:11:06,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-05 12:11:06,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9326, Invalid=10414, Unknown=0, NotChecked=0, Total=19740 [2019-09-05 12:11:06,828 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 141 states. [2019-09-05 12:11:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:07,196 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-09-05 12:11:07,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-05 12:11:07,196 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 278 [2019-09-05 12:11:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:07,197 INFO L225 Difference]: With dead ends: 287 [2019-09-05 12:11:07,197 INFO L226 Difference]: Without dead ends: 282 [2019-09-05 12:11:07,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9332, Invalid=10690, Unknown=0, NotChecked=0, Total=20022 [2019-09-05 12:11:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-05 12:11:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-09-05 12:11:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-05 12:11:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-09-05 12:11:07,201 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2019-09-05 12:11:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:07,201 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-09-05 12:11:07,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-05 12:11:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-09-05 12:11:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-05 12:11:07,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:07,202 INFO L399 BasicCegarLoop]: trace histogram [135, 135, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:07,202 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2038628477, now seen corresponding path program 135 times [2019-09-05 12:11:07,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:07,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:07,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:07,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:07,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 0 proven. 18225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:13,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:13,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:13,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:11:14,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 136 check-sat command(s) [2019-09-05 12:11:14,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:14,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-05 12:11:14,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 0 proven. 18225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:14,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:14,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 142 [2019-09-05 12:11:14,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-05 12:11:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-05 12:11:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9463, Invalid=10559, Unknown=0, NotChecked=0, Total=20022 [2019-09-05 12:11:14,278 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-09-05 12:11:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:14,857 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2019-09-05 12:11:14,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-05 12:11:14,857 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-09-05 12:11:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:14,858 INFO L225 Difference]: With dead ends: 289 [2019-09-05 12:11:14,858 INFO L226 Difference]: Without dead ends: 284 [2019-09-05 12:11:14,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9469, Invalid=10837, Unknown=0, NotChecked=0, Total=20306 [2019-09-05 12:11:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-05 12:11:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-09-05 12:11:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-05 12:11:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-09-05 12:11:14,863 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2019-09-05 12:11:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:14,863 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-09-05 12:11:14,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-05 12:11:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-09-05 12:11:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-05 12:11:14,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:14,864 INFO L399 BasicCegarLoop]: trace histogram [136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:14,864 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:14,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1750393241, now seen corresponding path program 136 times [2019-09-05 12:11:14,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:14,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:14,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:14,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:14,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 18496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:21,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:21,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:11:21,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:11:21,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:21,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-05 12:11:21,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:21,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 18496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:21,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:21,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 143 [2019-09-05 12:11:21,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-05 12:11:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-05 12:11:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9601, Invalid=10705, Unknown=0, NotChecked=0, Total=20306 [2019-09-05 12:11:21,711 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 143 states. [2019-09-05 12:11:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:22,573 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-09-05 12:11:22,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-05 12:11:22,573 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 282 [2019-09-05 12:11:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:22,574 INFO L225 Difference]: With dead ends: 291 [2019-09-05 12:11:22,574 INFO L226 Difference]: Without dead ends: 286 [2019-09-05 12:11:22,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9607, Invalid=10985, Unknown=0, NotChecked=0, Total=20592 [2019-09-05 12:11:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-05 12:11:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-09-05 12:11:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-05 12:11:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-09-05 12:11:22,578 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2019-09-05 12:11:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:22,578 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-09-05 12:11:22,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-05 12:11:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-09-05 12:11:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-05 12:11:22,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:22,579 INFO L399 BasicCegarLoop]: trace histogram [137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:22,580 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:22,580 INFO L82 PathProgramCache]: Analyzing trace with hash -365761611, now seen corresponding path program 137 times [2019-09-05 12:11:22,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:22,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:22,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:22,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:22,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 0 proven. 18769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:29,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:29,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:29,150 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:11:29,607 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 138 check-sat command(s) [2019-09-05 12:11:29,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:29,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-05 12:11:29,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:29,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 0 proven. 18769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:29,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:29,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 142] total 144 [2019-09-05 12:11:29,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-05 12:11:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-05 12:11:29,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9740, Invalid=10852, Unknown=0, NotChecked=0, Total=20592 [2019-09-05 12:11:29,783 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-09-05 12:11:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:30,581 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2019-09-05 12:11:30,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-05 12:11:30,581 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-09-05 12:11:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:30,582 INFO L225 Difference]: With dead ends: 293 [2019-09-05 12:11:30,582 INFO L226 Difference]: Without dead ends: 288 [2019-09-05 12:11:30,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9746, Invalid=11134, Unknown=0, NotChecked=0, Total=20880 [2019-09-05 12:11:30,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-05 12:11:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 287. [2019-09-05 12:11:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-05 12:11:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-09-05 12:11:30,587 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2019-09-05 12:11:30,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:30,588 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-09-05 12:11:30,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-05 12:11:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-09-05 12:11:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-05 12:11:30,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:30,589 INFO L399 BasicCegarLoop]: trace histogram [138, 138, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:30,589 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1823923921, now seen corresponding path program 138 times [2019-09-05 12:11:30,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:30,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:30,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:30,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:30,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 19044 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:37,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:37,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:37,263 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:11:37,726 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2019-09-05 12:11:37,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:37,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1542 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-05 12:11:37,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:37,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 19044 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:37,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:37,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 145 [2019-09-05 12:11:37,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-05 12:11:37,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-05 12:11:37,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9880, Invalid=11000, Unknown=0, NotChecked=0, Total=20880 [2019-09-05 12:11:37,910 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 145 states. [2019-09-05 12:11:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:38,484 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-09-05 12:11:38,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-05 12:11:38,485 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 286 [2019-09-05 12:11:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:38,486 INFO L225 Difference]: With dead ends: 295 [2019-09-05 12:11:38,486 INFO L226 Difference]: Without dead ends: 290 [2019-09-05 12:11:38,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9886, Invalid=11284, Unknown=0, NotChecked=0, Total=21170 [2019-09-05 12:11:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-05 12:11:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-09-05 12:11:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-05 12:11:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-09-05 12:11:38,492 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2019-09-05 12:11:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:38,492 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-09-05 12:11:38,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-05 12:11:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-09-05 12:11:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-05 12:11:38,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:38,494 INFO L399 BasicCegarLoop]: trace histogram [139, 139, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:38,494 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1577745133, now seen corresponding path program 139 times [2019-09-05 12:11:38,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:38,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:38,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:38,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:38,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 0 proven. 19321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:45,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:45,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:45,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:11:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:45,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-05 12:11:45,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:45,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 0 proven. 19321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:45,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:45,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 144] total 146 [2019-09-05 12:11:45,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-09-05 12:11:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-09-05 12:11:45,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10021, Invalid=11149, Unknown=0, NotChecked=0, Total=21170 [2019-09-05 12:11:45,772 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-09-05 12:11:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:46,568 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-09-05 12:11:46,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-05 12:11:46,568 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-09-05 12:11:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:46,569 INFO L225 Difference]: With dead ends: 297 [2019-09-05 12:11:46,569 INFO L226 Difference]: Without dead ends: 292 [2019-09-05 12:11:46,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10027, Invalid=11435, Unknown=0, NotChecked=0, Total=21462 [2019-09-05 12:11:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-05 12:11:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-09-05 12:11:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-05 12:11:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-09-05 12:11:46,574 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2019-09-05 12:11:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:46,574 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-09-05 12:11:46,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-09-05 12:11:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-09-05 12:11:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-05 12:11:46,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:46,575 INFO L399 BasicCegarLoop]: trace histogram [140, 140, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:46,575 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1223131145, now seen corresponding path program 140 times [2019-09-05 12:11:46,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:46,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:46,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:11:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 19600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:53,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:53,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:53,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:11:53,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:11:53,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:53,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-05 12:11:53,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:53,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 19600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:53,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:53,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 147 [2019-09-05 12:11:53,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-05 12:11:53,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-05 12:11:53,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10163, Invalid=11299, Unknown=0, NotChecked=0, Total=21462 [2019-09-05 12:11:53,991 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 147 states. [2019-09-05 12:11:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:54,868 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-09-05 12:11:54,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-05 12:11:54,868 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 290 [2019-09-05 12:11:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:54,869 INFO L225 Difference]: With dead ends: 299 [2019-09-05 12:11:54,869 INFO L226 Difference]: Without dead ends: 294 [2019-09-05 12:11:54,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10169, Invalid=11587, Unknown=0, NotChecked=0, Total=21756 [2019-09-05 12:11:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-05 12:11:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-09-05 12:11:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-05 12:11:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-09-05 12:11:54,874 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2019-09-05 12:11:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:54,874 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-09-05 12:11:54,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-05 12:11:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-09-05 12:11:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-05 12:11:54,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:54,875 INFO L399 BasicCegarLoop]: trace histogram [141, 141, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:54,876 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash -258494939, now seen corresponding path program 141 times [2019-09-05 12:11:54,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:54,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:54,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:54,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 0 proven. 19881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:01,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:01,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:01,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:12:02,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 142 check-sat command(s) [2019-09-05 12:12:02,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:02,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-05 12:12:02,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:02,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 0 proven. 19881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:02,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:02,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 148 [2019-09-05 12:12:02,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-05 12:12:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-05 12:12:02,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10306, Invalid=11450, Unknown=0, NotChecked=0, Total=21756 [2019-09-05 12:12:02,543 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-09-05 12:12:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:03,004 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2019-09-05 12:12:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-05 12:12:03,004 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-09-05 12:12:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:03,005 INFO L225 Difference]: With dead ends: 301 [2019-09-05 12:12:03,005 INFO L226 Difference]: Without dead ends: 296 [2019-09-05 12:12:03,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10312, Invalid=11740, Unknown=0, NotChecked=0, Total=22052 [2019-09-05 12:12:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-05 12:12:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-09-05 12:12:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-05 12:12:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-09-05 12:12:03,009 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2019-09-05 12:12:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:03,010 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-09-05 12:12:03,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-05 12:12:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-09-05 12:12:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-05 12:12:03,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:03,011 INFO L399 BasicCegarLoop]: trace histogram [142, 142, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:03,011 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:03,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1827980609, now seen corresponding path program 142 times [2019-09-05 12:12:03,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:03,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:03,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 20164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:10,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:10,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:10,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:12:10,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:12:10,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:10,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-05 12:12:10,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:10,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 20164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:10,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:10,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 149 [2019-09-05 12:12:10,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-05 12:12:10,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-05 12:12:10,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10450, Invalid=11602, Unknown=0, NotChecked=0, Total=22052 [2019-09-05 12:12:10,451 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 149 states. [2019-09-05 12:12:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:11,373 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-09-05 12:12:11,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-05 12:12:11,373 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 294 [2019-09-05 12:12:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:11,374 INFO L225 Difference]: With dead ends: 303 [2019-09-05 12:12:11,374 INFO L226 Difference]: Without dead ends: 298 [2019-09-05 12:12:11,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10456, Invalid=11894, Unknown=0, NotChecked=0, Total=22350 [2019-09-05 12:12:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-05 12:12:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-09-05 12:12:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-05 12:12:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-09-05 12:12:11,380 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2019-09-05 12:12:11,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:11,380 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-09-05 12:12:11,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-05 12:12:11,380 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-09-05 12:12:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-05 12:12:11,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:11,381 INFO L399 BasicCegarLoop]: trace histogram [143, 143, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:11,381 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:11,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1181255005, now seen corresponding path program 143 times [2019-09-05 12:12:11,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:11,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:11,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:11,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:11,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 0 proven. 20449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:18,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:18,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:18,591 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:12:19,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 144 check-sat command(s) [2019-09-05 12:12:19,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:19,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1597 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-05 12:12:19,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:19,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 0 proven. 20449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:19,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:19,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 148] total 150 [2019-09-05 12:12:19,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-05 12:12:19,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-05 12:12:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10595, Invalid=11755, Unknown=0, NotChecked=0, Total=22350 [2019-09-05 12:12:19,267 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-09-05 12:12:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:19,838 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-09-05 12:12:19,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-05 12:12:19,839 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-09-05 12:12:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:19,840 INFO L225 Difference]: With dead ends: 305 [2019-09-05 12:12:19,840 INFO L226 Difference]: Without dead ends: 300 [2019-09-05 12:12:19,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10601, Invalid=12049, Unknown=0, NotChecked=0, Total=22650 [2019-09-05 12:12:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-05 12:12:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2019-09-05 12:12:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-05 12:12:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2019-09-05 12:12:19,845 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2019-09-05 12:12:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:19,845 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2019-09-05 12:12:19,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-05 12:12:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2019-09-05 12:12:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-05 12:12:19,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:19,846 INFO L399 BasicCegarLoop]: trace histogram [144, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:19,846 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:19,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1846759815, now seen corresponding path program 144 times [2019-09-05 12:12:19,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:19,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:19,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:19,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:19,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 20736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:27,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:27,124 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:27,134 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:12:27,623 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2019-09-05 12:12:27,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:27,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-05 12:12:27,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:27,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 20736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:27,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:27,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 151 [2019-09-05 12:12:27,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-05 12:12:27,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-05 12:12:27,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10741, Invalid=11909, Unknown=0, NotChecked=0, Total=22650 [2019-09-05 12:12:27,838 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 151 states. [2019-09-05 12:12:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:28,854 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-09-05 12:12:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-05 12:12:28,854 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 298 [2019-09-05 12:12:28,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:28,856 INFO L225 Difference]: With dead ends: 307 [2019-09-05 12:12:28,856 INFO L226 Difference]: Without dead ends: 302 [2019-09-05 12:12:28,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10747, Invalid=12205, Unknown=0, NotChecked=0, Total=22952 [2019-09-05 12:12:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-05 12:12:28,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-09-05 12:12:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-05 12:12:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-09-05 12:12:28,861 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2019-09-05 12:12:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:28,862 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-09-05 12:12:28,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-05 12:12:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-09-05 12:12:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-05 12:12:28,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:28,863 INFO L399 BasicCegarLoop]: trace histogram [145, 145, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:28,864 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:28,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:28,864 INFO L82 PathProgramCache]: Analyzing trace with hash 218824853, now seen corresponding path program 145 times [2019-09-05 12:12:28,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:28,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:28,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:28,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:28,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 0 proven. 21025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:36,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:36,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:36,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:12:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:36,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 1619 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-05 12:12:36,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:36,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 0 proven. 21025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:36,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:36,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 150] total 152 [2019-09-05 12:12:36,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-09-05 12:12:36,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-09-05 12:12:36,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10888, Invalid=12064, Unknown=0, NotChecked=0, Total=22952 [2019-09-05 12:12:36,773 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-09-05 12:12:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:37,940 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2019-09-05 12:12:37,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-05 12:12:37,940 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-09-05 12:12:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:37,941 INFO L225 Difference]: With dead ends: 309 [2019-09-05 12:12:37,942 INFO L226 Difference]: Without dead ends: 304 [2019-09-05 12:12:37,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10894, Invalid=12362, Unknown=0, NotChecked=0, Total=23256 [2019-09-05 12:12:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-05 12:12:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2019-09-05 12:12:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-05 12:12:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2019-09-05 12:12:37,947 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2019-09-05 12:12:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:37,947 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2019-09-05 12:12:37,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-09-05 12:12:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2019-09-05 12:12:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-05 12:12:37,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:37,948 INFO L399 BasicCegarLoop]: trace histogram [146, 146, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:37,948 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:37,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash 970800049, now seen corresponding path program 146 times [2019-09-05 12:12:37,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:37,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:12:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 21316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:45,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:45,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:45,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:12:45,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:12:45,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:45,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-05 12:12:45,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:45,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 21316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:45,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:45,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 153 [2019-09-05 12:12:45,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-05 12:12:45,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-05 12:12:45,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11036, Invalid=12220, Unknown=0, NotChecked=0, Total=23256 [2019-09-05 12:12:45,812 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 153 states. [2019-09-05 12:12:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:46,298 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-09-05 12:12:46,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-05 12:12:46,298 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 302 [2019-09-05 12:12:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:46,299 INFO L225 Difference]: With dead ends: 311 [2019-09-05 12:12:46,299 INFO L226 Difference]: Without dead ends: 306 [2019-09-05 12:12:46,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11042, Invalid=12520, Unknown=0, NotChecked=0, Total=23562 [2019-09-05 12:12:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-05 12:12:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-09-05 12:12:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-05 12:12:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-09-05 12:12:46,304 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2019-09-05 12:12:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:46,304 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-09-05 12:12:46,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-05 12:12:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-09-05 12:12:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-05 12:12:46,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:46,305 INFO L399 BasicCegarLoop]: trace histogram [147, 147, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:46,305 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:46,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2064457677, now seen corresponding path program 147 times [2019-09-05 12:12:46,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:46,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:46,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:46,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:46,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 0 proven. 21609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:53,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:53,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:53,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:12:54,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 148 check-sat command(s) [2019-09-05 12:12:54,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:54,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-05 12:12:54,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:54,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 0 proven. 21609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:54,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:54,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 152] total 154 [2019-09-05 12:12:54,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-05 12:12:54,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-05 12:12:54,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11185, Invalid=12377, Unknown=0, NotChecked=0, Total=23562 [2019-09-05 12:12:54,558 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-09-05 12:12:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:55,342 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2019-09-05 12:12:55,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-05 12:12:55,342 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-09-05 12:12:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:55,343 INFO L225 Difference]: With dead ends: 313 [2019-09-05 12:12:55,343 INFO L226 Difference]: Without dead ends: 308 [2019-09-05 12:12:55,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11191, Invalid=12679, Unknown=0, NotChecked=0, Total=23870 [2019-09-05 12:12:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-05 12:12:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2019-09-05 12:12:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-05 12:12:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-09-05 12:12:55,348 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2019-09-05 12:12:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:55,348 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-09-05 12:12:55,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-05 12:12:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-09-05 12:12:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-05 12:12:55,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:55,349 INFO L399 BasicCegarLoop]: trace histogram [148, 148, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:55,349 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash 802450665, now seen corresponding path program 148 times [2019-09-05 12:12:55,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:55,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:55,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 21904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:03,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:03,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:03,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:13:03,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:13:03,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:03,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-05 12:13:03,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:03,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:13:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 21904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:03,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:03,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 155 [2019-09-05 12:13:03,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-09-05 12:13:03,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-09-05 12:13:03,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11335, Invalid=12535, Unknown=0, NotChecked=0, Total=23870 [2019-09-05 12:13:03,784 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 155 states. [2019-09-05 12:13:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:04,889 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-09-05 12:13:04,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-05 12:13:04,889 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 306 [2019-09-05 12:13:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:04,890 INFO L225 Difference]: With dead ends: 315 [2019-09-05 12:13:04,890 INFO L226 Difference]: Without dead ends: 310 [2019-09-05 12:13:04,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11341, Invalid=12839, Unknown=0, NotChecked=0, Total=24180 [2019-09-05 12:13:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-05 12:13:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-09-05 12:13:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-05 12:13:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-09-05 12:13:04,896 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2019-09-05 12:13:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:04,896 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-09-05 12:13:04,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-09-05 12:13:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-09-05 12:13:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-05 12:13:04,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:04,897 INFO L399 BasicCegarLoop]: trace histogram [149, 149, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:04,898 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:04,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:04,898 INFO L82 PathProgramCache]: Analyzing trace with hash -805510395, now seen corresponding path program 149 times [2019-09-05 12:13:04,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:04,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:04,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:04,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:04,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 0 proven. 22201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:12,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:12,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:12,724 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:13:13,299 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 150 check-sat command(s) [2019-09-05 12:13:13,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:13,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 156 conjunts are in the unsatisfiable core [2019-09-05 12:13:13,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:13,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:13:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 0 proven. 22201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:13,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:13,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154, 154] total 156 [2019-09-05 12:13:13,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-05 12:13:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-05 12:13:13,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11486, Invalid=12694, Unknown=0, NotChecked=0, Total=24180 [2019-09-05 12:13:13,491 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-09-05 12:13:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:14,729 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2019-09-05 12:13:14,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-05 12:13:14,729 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-09-05 12:13:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:14,731 INFO L225 Difference]: With dead ends: 317 [2019-09-05 12:13:14,731 INFO L226 Difference]: Without dead ends: 312 [2019-09-05 12:13:14,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11492, Invalid=13000, Unknown=0, NotChecked=0, Total=24492 [2019-09-05 12:13:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-05 12:13:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 311. [2019-09-05 12:13:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-05 12:13:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-09-05 12:13:14,737 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2019-09-05 12:13:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:14,738 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-09-05 12:13:14,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-05 12:13:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-09-05 12:13:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-05 12:13:14,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:14,739 INFO L399 BasicCegarLoop]: trace histogram [150, 150, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:14,739 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:14,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:14,739 INFO L82 PathProgramCache]: Analyzing trace with hash 132137505, now seen corresponding path program 150 times [2019-09-05 12:13:14,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:14,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:14,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 22500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:22,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:22,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:22,675 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:13:23,260 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 151 check-sat command(s) [2019-09-05 12:13:23,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:23,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-05 12:13:23,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:23,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:13:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 22500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:23,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:23,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 157 [2019-09-05 12:13:23,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-05 12:13:23,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-05 12:13:23,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11638, Invalid=12854, Unknown=0, NotChecked=0, Total=24492 [2019-09-05 12:13:23,463 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 157 states. [2019-09-05 12:13:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:24,752 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-09-05 12:13:24,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-05 12:13:24,753 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 310 [2019-09-05 12:13:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:24,753 INFO L225 Difference]: With dead ends: 319 [2019-09-05 12:13:24,753 INFO L226 Difference]: Without dead ends: 314 [2019-09-05 12:13:24,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11644, Invalid=13162, Unknown=0, NotChecked=0, Total=24806 [2019-09-05 12:13:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-05 12:13:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-09-05 12:13:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-05 12:13:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-09-05 12:13:24,759 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2019-09-05 12:13:24,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:24,759 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-09-05 12:13:24,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-05 12:13:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-09-05 12:13:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-05 12:13:24,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:24,761 INFO L399 BasicCegarLoop]: trace histogram [151, 151, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:24,761 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:24,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:24,761 INFO L82 PathProgramCache]: Analyzing trace with hash -731362755, now seen corresponding path program 151 times [2019-09-05 12:13:24,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:24,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:24,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:24,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:24,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 0 proven. 22801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:32,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:32,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:32,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:13:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:33,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-05 12:13:33,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:33,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:13:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 0 proven. 22801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:33,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:33,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156, 156] total 158 [2019-09-05 12:13:33,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-09-05 12:13:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-09-05 12:13:33,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11791, Invalid=13015, Unknown=0, NotChecked=0, Total=24806 [2019-09-05 12:13:33,191 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-09-05 12:13:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:34,401 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-09-05 12:13:34,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-05 12:13:34,401 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-09-05 12:13:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:34,402 INFO L225 Difference]: With dead ends: 321 [2019-09-05 12:13:34,402 INFO L226 Difference]: Without dead ends: 316 [2019-09-05 12:13:34,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11797, Invalid=13325, Unknown=0, NotChecked=0, Total=25122 [2019-09-05 12:13:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-05 12:13:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2019-09-05 12:13:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-05 12:13:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2019-09-05 12:13:34,407 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2019-09-05 12:13:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:34,407 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2019-09-05 12:13:34,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-09-05 12:13:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2019-09-05 12:13:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-05 12:13:34,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:34,408 INFO L399 BasicCegarLoop]: trace histogram [152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:34,408 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1626424487, now seen corresponding path program 152 times [2019-09-05 12:13:34,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:34,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:34,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:13:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 0 proven. 23104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:42,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:42,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:42,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:13:42,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:13:42,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:42,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 159 conjunts are in the unsatisfiable core [2019-09-05 12:13:42,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:42,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:13:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 0 proven. 23104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:43,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:43,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 159 [2019-09-05 12:13:43,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-05 12:13:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-05 12:13:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11945, Invalid=13177, Unknown=0, NotChecked=0, Total=25122 [2019-09-05 12:13:43,007 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 159 states. [2019-09-05 12:13:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:44,253 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-09-05 12:13:44,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-05 12:13:44,253 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 314 [2019-09-05 12:13:44,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:44,254 INFO L225 Difference]: With dead ends: 323 [2019-09-05 12:13:44,254 INFO L226 Difference]: Without dead ends: 318 [2019-09-05 12:13:44,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11951, Invalid=13489, Unknown=0, NotChecked=0, Total=25440 [2019-09-05 12:13:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-05 12:13:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-09-05 12:13:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-09-05 12:13:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-09-05 12:13:44,259 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2019-09-05 12:13:44,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:44,259 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-09-05 12:13:44,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-05 12:13:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-09-05 12:13:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-05 12:13:44,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:44,261 INFO L399 BasicCegarLoop]: trace histogram [153, 153, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:44,261 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1507677557, now seen corresponding path program 153 times [2019-09-05 12:13:44,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:44,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:44,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:44,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:44,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 0 proven. 23409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:52,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:52,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:52,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:13:53,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 154 check-sat command(s) [2019-09-05 12:13:53,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:53,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1707 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-05 12:13:53,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:53,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:13:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 0 proven. 23409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:53,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:53,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158, 158] total 160 [2019-09-05 12:13:53,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-09-05 12:13:53,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-09-05 12:13:53,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12100, Invalid=13340, Unknown=0, NotChecked=0, Total=25440 [2019-09-05 12:13:53,309 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-09-05 12:13:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:54,645 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-09-05 12:13:54,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-05 12:13:54,645 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-09-05 12:13:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:54,646 INFO L225 Difference]: With dead ends: 325 [2019-09-05 12:13:54,646 INFO L226 Difference]: Without dead ends: 320 [2019-09-05 12:13:54,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12106, Invalid=13654, Unknown=0, NotChecked=0, Total=25760 [2019-09-05 12:13:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-05 12:13:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2019-09-05 12:13:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-05 12:13:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2019-09-05 12:13:54,651 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2019-09-05 12:13:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:54,651 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2019-09-05 12:13:54,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-09-05 12:13:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2019-09-05 12:13:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-05 12:13:54,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:54,652 INFO L399 BasicCegarLoop]: trace histogram [154, 154, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:54,653 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:54,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:54,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1687299951, now seen corresponding path program 154 times [2019-09-05 12:13:54,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:54,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:54,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:54,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:54,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 23716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:02,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:02,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:02,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:14:03,205 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:14:03,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:03,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1718 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-05 12:14:03,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:03,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:14:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 23716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:03,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:03,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 159] total 161 [2019-09-05 12:14:03,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-05 12:14:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-05 12:14:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12256, Invalid=13504, Unknown=0, NotChecked=0, Total=25760 [2019-09-05 12:14:03,399 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 161 states. [2019-09-05 12:14:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:04,652 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-09-05 12:14:04,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-05 12:14:04,653 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 318 [2019-09-05 12:14:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:04,653 INFO L225 Difference]: With dead ends: 327 [2019-09-05 12:14:04,653 INFO L226 Difference]: Without dead ends: 322 [2019-09-05 12:14:04,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12262, Invalid=13820, Unknown=0, NotChecked=0, Total=26082 [2019-09-05 12:14:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-05 12:14:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-09-05 12:14:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-09-05 12:14:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-09-05 12:14:04,658 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2019-09-05 12:14:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:04,658 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-09-05 12:14:04,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-05 12:14:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-09-05 12:14:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-05 12:14:04,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:04,660 INFO L399 BasicCegarLoop]: trace histogram [155, 155, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:04,660 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1159068499, now seen corresponding path program 155 times [2019-09-05 12:14:04,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:04,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:04,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:04,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:04,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 0 proven. 24025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:13,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:13,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:13,056 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:14:13,651 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2019-09-05 12:14:13,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:13,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-05 12:14:13,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:13,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:14:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 0 proven. 24025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:13,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:13,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160, 160] total 162 [2019-09-05 12:14:13,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-05 12:14:13,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-05 12:14:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12413, Invalid=13669, Unknown=0, NotChecked=0, Total=26082 [2019-09-05 12:14:13,855 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-09-05 12:14:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:15,126 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2019-09-05 12:14:15,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-05 12:14:15,126 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-09-05 12:14:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:15,127 INFO L225 Difference]: With dead ends: 329 [2019-09-05 12:14:15,127 INFO L226 Difference]: Without dead ends: 324 [2019-09-05 12:14:15,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12419, Invalid=13987, Unknown=0, NotChecked=0, Total=26406 [2019-09-05 12:14:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-05 12:14:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2019-09-05 12:14:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-05 12:14:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2019-09-05 12:14:15,132 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2019-09-05 12:14:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:15,132 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2019-09-05 12:14:15,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-05 12:14:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2019-09-05 12:14:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-05 12:14:15,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:15,133 INFO L399 BasicCegarLoop]: trace histogram [156, 156, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:15,134 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash -334784055, now seen corresponding path program 156 times [2019-09-05 12:14:15,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:15,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:15,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:15,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:15,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 24336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:23,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:23,691 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:23,701 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:14:24,282 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 157 check-sat command(s) [2019-09-05 12:14:24,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:24,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 1740 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-05 12:14:24,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:24,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:14:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 24336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:24,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:24,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161, 161] total 163 [2019-09-05 12:14:24,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-05 12:14:24,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-05 12:14:24,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12571, Invalid=13835, Unknown=0, NotChecked=0, Total=26406 [2019-09-05 12:14:24,524 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 163 states. [2019-09-05 12:14:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:25,297 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-09-05 12:14:25,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-05 12:14:25,298 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 322 [2019-09-05 12:14:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:25,298 INFO L225 Difference]: With dead ends: 331 [2019-09-05 12:14:25,299 INFO L226 Difference]: Without dead ends: 326 [2019-09-05 12:14:25,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12577, Invalid=14155, Unknown=0, NotChecked=0, Total=26732 [2019-09-05 12:14:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-05 12:14:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-09-05 12:14:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-05 12:14:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-09-05 12:14:25,303 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2019-09-05 12:14:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:25,303 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-09-05 12:14:25,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-05 12:14:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-09-05 12:14:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-05 12:14:25,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:25,305 INFO L399 BasicCegarLoop]: trace histogram [157, 157, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:25,305 INFO L418 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:25,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1528584165, now seen corresponding path program 157 times [2019-09-05 12:14:25,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:25,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:25,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:25,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:25,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 0 proven. 24649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:34,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:34,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:34,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:14:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:34,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 1751 conjuncts, 164 conjunts are in the unsatisfiable core [2019-09-05 12:14:34,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:34,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:14:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 0 proven. 24649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:34,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:34,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162, 162] total 164 [2019-09-05 12:14:34,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-09-05 12:14:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-09-05 12:14:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12730, Invalid=14002, Unknown=0, NotChecked=0, Total=26732 [2019-09-05 12:14:34,476 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-09-05 12:14:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:35,243 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2019-09-05 12:14:35,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-09-05 12:14:35,244 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-09-05 12:14:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:35,244 INFO L225 Difference]: With dead ends: 333 [2019-09-05 12:14:35,244 INFO L226 Difference]: Without dead ends: 328 [2019-09-05 12:14:35,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12736, Invalid=14324, Unknown=0, NotChecked=0, Total=27060 [2019-09-05 12:14:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-05 12:14:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2019-09-05 12:14:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-05 12:14:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-09-05 12:14:35,249 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2019-09-05 12:14:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:35,250 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2019-09-05 12:14:35,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-09-05 12:14:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2019-09-05 12:14:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-05 12:14:35,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:35,251 INFO L399 BasicCegarLoop]: trace histogram [158, 158, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:35,251 INFO L418 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1224081153, now seen corresponding path program 158 times [2019-09-05 12:14:35,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:35,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:35,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:35,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:14:35,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 24964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:43,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:43,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:43,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:14:44,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:14:44,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:44,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1762 conjuncts, 165 conjunts are in the unsatisfiable core [2019-09-05 12:14:44,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:44,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:14:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 24964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:44,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:44,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163, 163] total 165 [2019-09-05 12:14:44,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-05 12:14:44,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-05 12:14:44,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12890, Invalid=14170, Unknown=0, NotChecked=0, Total=27060 [2019-09-05 12:14:44,300 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 165 states. [2019-09-05 12:14:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:45,816 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-09-05 12:14:45,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-05 12:14:45,816 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 326 [2019-09-05 12:14:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:45,816 INFO L225 Difference]: With dead ends: 335 [2019-09-05 12:14:45,817 INFO L226 Difference]: Without dead ends: 330 [2019-09-05 12:14:45,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12896, Invalid=14494, Unknown=0, NotChecked=0, Total=27390 [2019-09-05 12:14:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-05 12:14:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-09-05 12:14:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-05 12:14:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-09-05 12:14:45,821 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2019-09-05 12:14:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:45,821 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-09-05 12:14:45,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-05 12:14:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-09-05 12:14:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-05 12:14:45,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:45,822 INFO L399 BasicCegarLoop]: trace histogram [159, 159, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:45,823 INFO L418 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:45,823 INFO L82 PathProgramCache]: Analyzing trace with hash 654462749, now seen corresponding path program 159 times [2019-09-05 12:14:45,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:45,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:45,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 0 proven. 25281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:54,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:54,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:54,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:14:55,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 160 check-sat command(s) [2019-09-05 12:14:55,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:55,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 166 conjunts are in the unsatisfiable core [2019-09-05 12:14:55,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:55,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:14:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 0 proven. 25281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:55,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:55,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164, 164] total 166 [2019-09-05 12:14:55,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-09-05 12:14:55,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-09-05 12:14:55,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13051, Invalid=14339, Unknown=0, NotChecked=0, Total=27390 [2019-09-05 12:14:55,495 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-09-05 12:14:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:56,544 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2019-09-05 12:14:56,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-09-05 12:14:56,544 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-09-05 12:14:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:56,545 INFO L225 Difference]: With dead ends: 337 [2019-09-05 12:14:56,546 INFO L226 Difference]: Without dead ends: 332 [2019-09-05 12:14:56,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13057, Invalid=14665, Unknown=0, NotChecked=0, Total=27722 [2019-09-05 12:14:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-05 12:14:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2019-09-05 12:14:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-05 12:14:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-09-05 12:14:56,551 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2019-09-05 12:14:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:56,551 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-09-05 12:14:56,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-09-05 12:14:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-09-05 12:14:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-05 12:14:56,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:56,552 INFO L399 BasicCegarLoop]: trace histogram [160, 160, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:56,552 INFO L418 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:56,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:56,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1287976903, now seen corresponding path program 160 times [2019-09-05 12:14:56,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:56,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:56,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 25600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:05,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:05,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:05,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:15:05,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:15:05,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:15:05,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 1784 conjuncts, 167 conjunts are in the unsatisfiable core [2019-09-05 12:15:05,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:05,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:15:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 25600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:05,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:05,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165, 165] total 167 [2019-09-05 12:15:05,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-09-05 12:15:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-09-05 12:15:05,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13213, Invalid=14509, Unknown=0, NotChecked=0, Total=27722 [2019-09-05 12:15:05,892 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 167 states. [2019-09-05 12:15:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:07,021 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-09-05 12:15:07,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-05 12:15:07,022 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 330 [2019-09-05 12:15:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:07,023 INFO L225 Difference]: With dead ends: 339 [2019-09-05 12:15:07,023 INFO L226 Difference]: Without dead ends: 334 [2019-09-05 12:15:07,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13219, Invalid=14837, Unknown=0, NotChecked=0, Total=28056 [2019-09-05 12:15:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-05 12:15:07,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-09-05 12:15:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-05 12:15:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-09-05 12:15:07,028 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2019-09-05 12:15:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:07,029 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-09-05 12:15:07,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-09-05 12:15:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-09-05 12:15:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-05 12:15:07,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:07,030 INFO L399 BasicCegarLoop]: trace histogram [161, 161, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:07,030 INFO L418 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash 338291285, now seen corresponding path program 161 times [2019-09-05 12:15:07,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:07,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:07,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:07,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:07,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 0 proven. 25921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:16,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:16,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:16,178 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:15:16,767 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 162 check-sat command(s) [2019-09-05 12:15:16,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:15:16,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 168 conjunts are in the unsatisfiable core [2019-09-05 12:15:16,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:16,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:15:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 0 proven. 25921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:16,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:16,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166, 166] total 168 [2019-09-05 12:15:16,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-09-05 12:15:16,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-09-05 12:15:16,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13376, Invalid=14680, Unknown=0, NotChecked=0, Total=28056 [2019-09-05 12:15:16,978 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-09-05 12:15:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:18,373 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2019-09-05 12:15:18,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-09-05 12:15:18,373 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-09-05 12:15:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:18,374 INFO L225 Difference]: With dead ends: 341 [2019-09-05 12:15:18,374 INFO L226 Difference]: Without dead ends: 336 [2019-09-05 12:15:18,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13382, Invalid=15010, Unknown=0, NotChecked=0, Total=28392 [2019-09-05 12:15:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-05 12:15:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2019-09-05 12:15:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-05 12:15:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2019-09-05 12:15:18,379 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2019-09-05 12:15:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:18,380 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2019-09-05 12:15:18,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-09-05 12:15:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2019-09-05 12:15:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-05 12:15:18,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:18,382 INFO L399 BasicCegarLoop]: trace histogram [162, 162, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:18,382 INFO L418 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash -186075791, now seen corresponding path program 162 times [2019-09-05 12:15:18,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:18,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:18,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 26244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:27,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:27,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:27,622 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:15:28,218 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 163 check-sat command(s) [2019-09-05 12:15:28,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:15:28,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 1806 conjuncts, 169 conjunts are in the unsatisfiable core [2019-09-05 12:15:28,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:28,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:15:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 26244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:28,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:28,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167, 167] total 169 [2019-09-05 12:15:28,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-05 12:15:28,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-05 12:15:28,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13540, Invalid=14852, Unknown=0, NotChecked=0, Total=28392 [2019-09-05 12:15:28,427 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 169 states. [2019-09-05 12:15:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:29,527 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-09-05 12:15:29,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-05 12:15:29,527 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 334 [2019-09-05 12:15:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:29,528 INFO L225 Difference]: With dead ends: 343 [2019-09-05 12:15:29,528 INFO L226 Difference]: Without dead ends: 338 [2019-09-05 12:15:29,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13546, Invalid=15184, Unknown=0, NotChecked=0, Total=28730 [2019-09-05 12:15:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-05 12:15:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-09-05 12:15:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-05 12:15:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-09-05 12:15:29,534 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2019-09-05 12:15:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:29,535 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-09-05 12:15:29,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-05 12:15:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-09-05 12:15:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-05 12:15:29,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:29,536 INFO L399 BasicCegarLoop]: trace histogram [163, 163, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:29,536 INFO L418 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:29,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:29,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1591662195, now seen corresponding path program 163 times [2019-09-05 12:15:29,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:29,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:29,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:29,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:29,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 0 proven. 26569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:38,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:38,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:38,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:15:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:39,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 1817 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-05 12:15:39,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:39,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:15:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 0 proven. 26569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:39,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:39,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168, 168] total 170 [2019-09-05 12:15:39,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-09-05 12:15:39,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-09-05 12:15:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13705, Invalid=15025, Unknown=0, NotChecked=0, Total=28730 [2019-09-05 12:15:39,238 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-09-05 12:15:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:40,441 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-09-05 12:15:40,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-09-05 12:15:40,441 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-09-05 12:15:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:40,442 INFO L225 Difference]: With dead ends: 345 [2019-09-05 12:15:40,443 INFO L226 Difference]: Without dead ends: 340 [2019-09-05 12:15:40,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13711, Invalid=15359, Unknown=0, NotChecked=0, Total=29070 [2019-09-05 12:15:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-09-05 12:15:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2019-09-05 12:15:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-05 12:15:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2019-09-05 12:15:40,449 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2019-09-05 12:15:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:40,449 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2019-09-05 12:15:40,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-09-05 12:15:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2019-09-05 12:15:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-05 12:15:40,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:40,451 INFO L399 BasicCegarLoop]: trace histogram [164, 164, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:40,451 INFO L418 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash 554501801, now seen corresponding path program 164 times [2019-09-05 12:15:40,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:40,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:40,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:40,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:15:40,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 26896 backedges. 0 proven. 26896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:49,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:49,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:49,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:15:50,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:15:50,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:15:50,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1828 conjuncts, 171 conjunts are in the unsatisfiable core [2019-09-05 12:15:50,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:50,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:15:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 26896 backedges. 0 proven. 26896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:50,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:50,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169, 169] total 171 [2019-09-05 12:15:50,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-05 12:15:50,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-05 12:15:50,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13871, Invalid=15199, Unknown=0, NotChecked=0, Total=29070 [2019-09-05 12:15:50,420 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 171 states. [2019-09-05 12:15:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:52,133 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-09-05 12:15:52,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-09-05 12:15:52,134 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 338 [2019-09-05 12:15:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:52,135 INFO L225 Difference]: With dead ends: 347 [2019-09-05 12:15:52,135 INFO L226 Difference]: Without dead ends: 342 [2019-09-05 12:15:52,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13877, Invalid=15535, Unknown=0, NotChecked=0, Total=29412 [2019-09-05 12:15:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-05 12:15:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-09-05 12:15:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-05 12:15:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-09-05 12:15:52,140 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2019-09-05 12:15:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:52,141 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-09-05 12:15:52,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-05 12:15:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-09-05 12:15:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-05 12:15:52,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:52,142 INFO L399 BasicCegarLoop]: trace histogram [165, 165, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:52,142 INFO L418 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1433799877, now seen corresponding path program 165 times [2019-09-05 12:15:52,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:52,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:52,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:52,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:52,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:16:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 0 proven. 27225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:01,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:16:01,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:16:01,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:16:02,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 166 check-sat command(s) [2019-09-05 12:16:02,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:16:02,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 1839 conjuncts, 172 conjunts are in the unsatisfiable core [2019-09-05 12:16:02,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:16:02,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:16:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 0 proven. 27225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:02,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:16:02,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170, 170] total 172 [2019-09-05 12:16:02,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-09-05 12:16:02,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-09-05 12:16:02,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14038, Invalid=15374, Unknown=0, NotChecked=0, Total=29412 [2019-09-05 12:16:02,598 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-09-05 12:16:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:16:03,240 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2019-09-05 12:16:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-09-05 12:16:03,240 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-09-05 12:16:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:16:03,241 INFO L225 Difference]: With dead ends: 349 [2019-09-05 12:16:03,242 INFO L226 Difference]: Without dead ends: 344 [2019-09-05 12:16:03,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14044, Invalid=15712, Unknown=0, NotChecked=0, Total=29756 [2019-09-05 12:16:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-05 12:16:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2019-09-05 12:16:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-05 12:16:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2019-09-05 12:16:03,247 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2019-09-05 12:16:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:16:03,247 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2019-09-05 12:16:03,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-09-05 12:16:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2019-09-05 12:16:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-05 12:16:03,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:16:03,249 INFO L399 BasicCegarLoop]: trace histogram [166, 166, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:16:03,249 INFO L418 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:16:03,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:16:03,249 INFO L82 PathProgramCache]: Analyzing trace with hash 330693601, now seen corresponding path program 166 times [2019-09-05 12:16:03,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:16:03,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:16:03,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:03,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:16:03,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:16:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 27556 backedges. 0 proven. 27556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:12,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:16:12,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:16:12,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:16:13,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:16:13,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:16:13,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-05 12:16:13,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:16:13,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:16:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 27556 backedges. 0 proven. 27556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:13,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:16:13,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171, 171] total 173 [2019-09-05 12:16:13,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 173 states [2019-09-05 12:16:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2019-09-05 12:16:13,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14206, Invalid=15550, Unknown=0, NotChecked=0, Total=29756 [2019-09-05 12:16:13,378 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 173 states. [2019-09-05 12:16:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:16:14,634 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-09-05 12:16:14,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-09-05 12:16:14,635 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 342 [2019-09-05 12:16:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:16:14,636 INFO L225 Difference]: With dead ends: 351 [2019-09-05 12:16:14,636 INFO L226 Difference]: Without dead ends: 346 [2019-09-05 12:16:14,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14212, Invalid=15890, Unknown=0, NotChecked=0, Total=30102 [2019-09-05 12:16:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-05 12:16:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-09-05 12:16:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-05 12:16:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-09-05 12:16:14,641 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2019-09-05 12:16:14,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:16:14,642 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-09-05 12:16:14,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 173 states. [2019-09-05 12:16:14,642 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-09-05 12:16:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-05 12:16:14,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:16:14,643 INFO L399 BasicCegarLoop]: trace histogram [167, 167, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:16:14,643 INFO L418 AbstractCegarLoop]: === Iteration 169 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:16:14,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:16:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1102484477, now seen corresponding path program 167 times [2019-09-05 12:16:14,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:16:14,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:16:14,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:14,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:16:14,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:16:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 0 proven. 27889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:24,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:16:24,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:16:24,455 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:16:25,087 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 168 check-sat command(s) [2019-09-05 12:16:25,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:16:25,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 1861 conjuncts, 174 conjunts are in the unsatisfiable core [2019-09-05 12:16:25,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:16:25,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:16:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 0 proven. 27889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:25,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:16:25,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172, 172] total 174 [2019-09-05 12:16:25,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-09-05 12:16:25,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-09-05 12:16:25,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14375, Invalid=15727, Unknown=0, NotChecked=0, Total=30102 [2019-09-05 12:16:25,314 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-09-05 12:16:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:16:27,004 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2019-09-05 12:16:27,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-09-05 12:16:27,004 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-09-05 12:16:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:16:27,005 INFO L225 Difference]: With dead ends: 353 [2019-09-05 12:16:27,005 INFO L226 Difference]: Without dead ends: 348 [2019-09-05 12:16:27,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14381, Invalid=16069, Unknown=0, NotChecked=0, Total=30450 [2019-09-05 12:16:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-05 12:16:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 347. [2019-09-05 12:16:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-05 12:16:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-09-05 12:16:27,009 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2019-09-05 12:16:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:16:27,010 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2019-09-05 12:16:27,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-09-05 12:16:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2019-09-05 12:16:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-05 12:16:27,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:16:27,011 INFO L399 BasicCegarLoop]: trace histogram [168, 168, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:16:27,011 INFO L418 AbstractCegarLoop]: === Iteration 170 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:16:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:16:27,011 INFO L82 PathProgramCache]: Analyzing trace with hash -235825895, now seen corresponding path program 168 times [2019-09-05 12:16:27,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:16:27,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:16:27,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:27,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:16:27,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:16:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 28224 backedges. 0 proven. 28224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:36,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:16:36,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:16:36,821 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:16:37,451 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 169 check-sat command(s) [2019-09-05 12:16:37,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:16:37,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 1872 conjuncts, 175 conjunts are in the unsatisfiable core [2019-09-05 12:16:37,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:16:37,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:16:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 28224 backedges. 0 proven. 28224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:37,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:16:37,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173, 173] total 175 [2019-09-05 12:16:37,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 175 states [2019-09-05 12:16:37,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2019-09-05 12:16:37,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14545, Invalid=15905, Unknown=0, NotChecked=0, Total=30450 [2019-09-05 12:16:37,712 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 175 states. [2019-09-05 12:16:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:16:39,295 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-09-05 12:16:39,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-09-05 12:16:39,295 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 346 [2019-09-05 12:16:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:16:39,296 INFO L225 Difference]: With dead ends: 355 [2019-09-05 12:16:39,296 INFO L226 Difference]: Without dead ends: 350 [2019-09-05 12:16:39,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14551, Invalid=16249, Unknown=0, NotChecked=0, Total=30800 [2019-09-05 12:16:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-05 12:16:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-09-05 12:16:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-05 12:16:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-09-05 12:16:39,301 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2019-09-05 12:16:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:16:39,302 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-09-05 12:16:39,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 175 states. [2019-09-05 12:16:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-09-05 12:16:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-05 12:16:39,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:16:39,303 INFO L399 BasicCegarLoop]: trace histogram [169, 169, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:16:39,304 INFO L418 AbstractCegarLoop]: === Iteration 171 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:16:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:16:39,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2138095413, now seen corresponding path program 169 times [2019-09-05 12:16:39,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:16:39,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:16:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:39,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:16:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:16:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 0 proven. 28561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:49,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:16:49,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:16:49,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:16:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:16:49,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 1883 conjuncts, 176 conjunts are in the unsatisfiable core [2019-09-05 12:16:49,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:16:49,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:16:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 0 proven. 28561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:49,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:16:49,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174, 174] total 176 [2019-09-05 12:16:49,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-09-05 12:16:49,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-09-05 12:16:49,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14716, Invalid=16084, Unknown=0, NotChecked=0, Total=30800 [2019-09-05 12:16:49,912 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-09-05 12:16:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:16:51,114 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2019-09-05 12:16:51,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-09-05 12:16:51,115 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-09-05 12:16:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:16:51,115 INFO L225 Difference]: With dead ends: 357 [2019-09-05 12:16:51,115 INFO L226 Difference]: Without dead ends: 352 [2019-09-05 12:16:51,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14722, Invalid=16430, Unknown=0, NotChecked=0, Total=31152 [2019-09-05 12:16:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-05 12:16:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2019-09-05 12:16:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-05 12:16:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-09-05 12:16:51,121 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2019-09-05 12:16:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:16:51,122 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-09-05 12:16:51,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-09-05 12:16:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-09-05 12:16:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-05 12:16:51,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:16:51,123 INFO L399 BasicCegarLoop]: trace histogram [170, 170, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:16:51,123 INFO L418 AbstractCegarLoop]: === Iteration 172 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:16:51,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:16:51,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1446129071, now seen corresponding path program 170 times [2019-09-05 12:16:51,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:16:51,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:16:51,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:51,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:16:51,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:17:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 28900 backedges. 0 proven. 28900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:17:01,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:17:01,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:17:01,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:17:01,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:17:01,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:17:01,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1894 conjuncts, 177 conjunts are in the unsatisfiable core [2019-09-05 12:17:01,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:17:01,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:17:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 28900 backedges. 0 proven. 28900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:17:01,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:17:01,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175, 175] total 177 [2019-09-05 12:17:01,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 177 states [2019-09-05 12:17:01,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2019-09-05 12:17:01,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14888, Invalid=16264, Unknown=0, NotChecked=0, Total=31152 [2019-09-05 12:17:01,581 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 177 states. [2019-09-05 12:17:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:17:02,532 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-09-05 12:17:02,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-09-05 12:17:02,532 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 350 [2019-09-05 12:17:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:17:02,533 INFO L225 Difference]: With dead ends: 359 [2019-09-05 12:17:02,533 INFO L226 Difference]: Without dead ends: 354 [2019-09-05 12:17:02,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14894, Invalid=16612, Unknown=0, NotChecked=0, Total=31506 [2019-09-05 12:17:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-05 12:17:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-09-05 12:17:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-05 12:17:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-09-05 12:17:02,539 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2019-09-05 12:17:02,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:17:02,539 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-09-05 12:17:02,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 177 states. [2019-09-05 12:17:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-09-05 12:17:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-05 12:17:02,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:17:02,541 INFO L399 BasicCegarLoop]: trace histogram [171, 171, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:17:02,541 INFO L418 AbstractCegarLoop]: === Iteration 173 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:17:02,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:17:02,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1322086803, now seen corresponding path program 171 times [2019-09-05 12:17:02,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:17:02,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:17:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:17:02,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:17:02,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:17:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:17:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 0 proven. 29241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:17:12,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:17:12,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:17:12,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:17:13,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 172 check-sat command(s) [2019-09-05 12:17:13,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:17:13,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 1905 conjuncts, 178 conjunts are in the unsatisfiable core [2019-09-05 12:17:13,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:17:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:17:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 0 proven. 29241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:17:13,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:17:13,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176, 176] total 178 [2019-09-05 12:17:13,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-09-05 12:17:13,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-09-05 12:17:13,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15061, Invalid=16445, Unknown=0, NotChecked=0, Total=31506 [2019-09-05 12:17:13,714 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-09-05 12:17:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:17:14,518 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2019-09-05 12:17:14,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-09-05 12:17:14,518 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-09-05 12:17:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:17:14,519 INFO L225 Difference]: With dead ends: 361 [2019-09-05 12:17:14,519 INFO L226 Difference]: Without dead ends: 356 [2019-09-05 12:17:14,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=15067, Invalid=16795, Unknown=0, NotChecked=0, Total=31862 [2019-09-05 12:17:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-05 12:17:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2019-09-05 12:17:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-05 12:17:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2019-09-05 12:17:14,524 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2019-09-05 12:17:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:17:14,524 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2019-09-05 12:17:14,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-09-05 12:17:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2019-09-05 12:17:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-05 12:17:14,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:17:14,525 INFO L399 BasicCegarLoop]: trace histogram [172, 172, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:17:14,525 INFO L418 AbstractCegarLoop]: === Iteration 174 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:17:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:17:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1918415753, now seen corresponding path program 172 times [2019-09-05 12:17:14,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:17:14,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:17:14,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:17:14,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:17:14,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:17:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat