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-invgen/down.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:49:48,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:49:48,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:49:48,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:49:48,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:49:48,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:49:48,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:49:48,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:49:48,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:49:48,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:49:48,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:49:48,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:49:48,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:49:48,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:49:48,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:49:48,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:49:48,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:49:48,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:49:48,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:49:48,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:49:48,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:49:48,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:49:48,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:49:48,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:49:48,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:49:48,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:49:48,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:49:48,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:49:48,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:49:48,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:49:48,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:49:48,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:49:48,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:49:48,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:49:48,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:49:48,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:49:48,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:49:48,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:49:48,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:49:48,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:49:48,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:49:48,827 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-03 19:49:48,840 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:49:48,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:49:48,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:49:48,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:49:48,842 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:49:48,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:49:48,843 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:49:48,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:49:48,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:49:48,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:49:48,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:49:48,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:49:48,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:49:48,844 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:49:48,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:49:48,845 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:49:48,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:49:48,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:49:48,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:49:48,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:49:48,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:49:48,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:48,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:49:48,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:49:48,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:49:48,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:49:48,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:49:48,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:49:48,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:49:48,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:49:48,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:49:48,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:49:48,906 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:49:48,907 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:49:48,908 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/down.i [2019-09-03 19:49:48,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1177d044e/3bdbaa38b6a64e8aa1d755c0f1742718/FLAGde8481231 [2019-09-03 19:49:49,394 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:49:49,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down.i [2019-09-03 19:49:49,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1177d044e/3bdbaa38b6a64e8aa1d755c0f1742718/FLAGde8481231 [2019-09-03 19:49:49,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1177d044e/3bdbaa38b6a64e8aa1d755c0f1742718 [2019-09-03 19:49:49,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:49:49,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:49:49,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:49,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:49:49,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:49:49,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:49" (1/1) ... [2019-09-03 19:49:49,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6980db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:49, skipping insertion in model container [2019-09-03 19:49:49,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:49" (1/1) ... [2019-09-03 19:49:49,819 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:49:49,833 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:49:49,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:49,999 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:49:50,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:50,028 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:49:50,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:50 WrapperNode [2019-09-03 19:49:50,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:50,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:49:50,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:49:50,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:49:50,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:50" (1/1) ... [2019-09-03 19:49:50,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:50" (1/1) ... [2019-09-03 19:49:50,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:50" (1/1) ... [2019-09-03 19:49:50,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:50" (1/1) ... [2019-09-03 19:49:50,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:50" (1/1) ... [2019-09-03 19:49:50,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:50" (1/1) ... [2019-09-03 19:49:50,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:50" (1/1) ... [2019-09-03 19:49:50,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:49:50,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:49:50,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:49:50,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:49:50,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:50" (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-03 19:49:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:49:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:49:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:49:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:49:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:49:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:49:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:49:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:49:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:49:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:49:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:49:50,365 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:49:50,365 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:49:50,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:50 BoogieIcfgContainer [2019-09-03 19:49:50,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:49:50,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:49:50,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:49:50,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:49:50,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:49:49" (1/3) ... [2019-09-03 19:49:50,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9d7421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:50, skipping insertion in model container [2019-09-03 19:49:50,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:50" (2/3) ... [2019-09-03 19:49:50,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9d7421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:50, skipping insertion in model container [2019-09-03 19:49:50,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:50" (3/3) ... [2019-09-03 19:49:50,385 INFO L109 eAbstractionObserver]: Analyzing ICFG down.i [2019-09-03 19:49:50,407 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:49:50,419 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:49:50,458 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:49:50,499 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:49:50,499 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:49:50,500 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:49:50,500 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:49:50,500 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:49:50,500 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:49:50,500 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:49:50,500 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:49:50,500 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:49:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-03 19:49:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:49:50,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:50,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:50,523 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:50,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1785764952, now seen corresponding path program 1 times [2019-09-03 19:49:50,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:50,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:50,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:50,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:50,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:50,687 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-03 19:49:50,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:50,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:50,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:50,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:50,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:50,705 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-09-03 19:49:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:50,802 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-03 19:49:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:50,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 19:49:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:50,812 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:49:50,812 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 19:49:50,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 19:49:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 19:49:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:49:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 19:49:50,850 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-09-03 19:49:50,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:50,850 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 19:49:50,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 19:49:50,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:49:50,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:50,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:50,852 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:50,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1701245161, now seen corresponding path program 1 times [2019-09-03 19:49:50,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:50,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:50,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:50,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:50,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:50,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:50,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:49:50,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:49:50,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:49:50,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:50,920 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-03 19:49:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:50,980 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-03 19:49:50,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:49:50,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-09-03 19:49:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:50,984 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:49:50,984 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 19:49:50,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 19:49:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-09-03 19:49:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:49:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-03 19:49:50,997 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-09-03 19:49:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:50,998 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-03 19:49:50,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:49:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-03 19:49:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:49:51,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:51,001 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:51,001 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash -186817542, now seen corresponding path program 1 times [2019-09-03 19:49:51,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:51,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:51,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:51,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:51,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:51,095 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-03 19:49:51,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:51,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:49:51,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:51,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:51,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-03 19:49:51,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:49:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:49:51,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:51,188 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2019-09-03 19:49:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:51,283 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-09-03 19:49:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:49:51,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-09-03 19:49:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:51,286 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:49:51,287 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:49:51,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:49:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:49:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 19:49:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:49:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-03 19:49:51,294 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-09-03 19:49:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:51,294 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-03 19:49:51,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:49:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-03 19:49:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:49:51,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:51,295 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:51,296 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash 151164811, now seen corresponding path program 2 times [2019-09-03 19:49:51,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:51,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:51,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:51,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:51,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:51,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) [2019-09-03 19:49:51,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:51,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:49:51,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:51,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:49:51,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:51,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:51,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:51,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-09-03 19:49:51,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:49:51,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:49:51,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:49:51,475 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-09-03 19:49:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:51,543 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-03 19:49:51,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:49:51,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-09-03 19:49:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:51,545 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:49:51,545 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 19:49:51,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:49:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 19:49:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-09-03 19:49:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:49:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-03 19:49:51,554 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2019-09-03 19:49:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:51,555 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-03 19:49:51,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:49:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-03 19:49:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:49:51,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:51,556 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:51,557 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:51,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:51,557 INFO L82 PathProgramCache]: Analyzing trace with hash -596024552, now seen corresponding path program 3 times [2019-09-03 19:49:51,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:51,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:51,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:51,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:49:51,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:51,678 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-03 19:49:51,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:49:51,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:49:51,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:51,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:49:51,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:49:51,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:51,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-03 19:49:51,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:49:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:49:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:49:51,747 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2019-09-03 19:49:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:51,848 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-03 19:49:51,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:49:51,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-09-03 19:49:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:51,850 INFO L225 Difference]: With dead ends: 49 [2019-09-03 19:49:51,850 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:49:51,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:49:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:49:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 19:49:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:49:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-09-03 19:49:51,857 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2019-09-03 19:49:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:51,858 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-09-03 19:49:51,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:49:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-09-03 19:49:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 19:49:51,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:51,859 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:51,859 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:51,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1736542807, now seen corresponding path program 4 times [2019-09-03 19:49:51,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:51,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:51,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:51,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:49:51,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:51,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 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-03 19:49:51,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:49:51,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:49:51,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:51,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:49:51,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:52,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:49:52,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:52,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-09-03 19:49:52,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:49:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:49:52,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:49:52,040 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2019-09-03 19:49:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:52,124 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-03 19:49:52,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:49:52,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-09-03 19:49:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:52,129 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:49:52,129 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:49:52,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:49:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:49:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-03 19:49:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:49:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-03 19:49:52,145 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2019-09-03 19:49:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:52,145 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-03 19:49:52,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:49:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-03 19:49:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:49:52,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:52,148 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:52,148 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:52,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1844119354, now seen corresponding path program 5 times [2019-09-03 19:49:52,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:52,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:52,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:49:52,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:52,270 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) [2019-09-03 19:49:52,285 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:52,311 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:49:52,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:52,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:49:52,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:49:52,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:52,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-03 19:49:52,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:49:52,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:49:52,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:49:52,339 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2019-09-03 19:49:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:52,497 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-09-03 19:49:52,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:49:52,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-09-03 19:49:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:52,499 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:49:52,499 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:49:52,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:49:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:49:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 19:49:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:49:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-03 19:49:52,507 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2019-09-03 19:49:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:52,508 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-03 19:49:52,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:49:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-03 19:49:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 19:49:52,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:52,509 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:52,510 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:52,510 INFO L82 PathProgramCache]: Analyzing trace with hash 528545995, now seen corresponding path program 6 times [2019-09-03 19:49:52,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:52,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:52,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:52,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:52,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:49:52,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:52,580 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:52,594 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:49:52,614 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-03 19:49:52,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:52,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:49:52,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:52,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:49:52,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:52,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-03 19:49:52,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:49:52,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:49:52,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:49:52,653 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 11 states. [2019-09-03 19:49:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:52,743 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-09-03 19:49:52,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:49:52,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-09-03 19:49:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:52,744 INFO L225 Difference]: With dead ends: 53 [2019-09-03 19:49:52,744 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 19:49:52,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:49:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 19:49:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-09-03 19:49:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:49:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-03 19:49:52,753 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 37 [2019-09-03 19:49:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:52,753 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-03 19:49:52,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:49:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-03 19:49:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:49:52,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:52,755 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:52,755 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1720130008, now seen corresponding path program 7 times [2019-09-03 19:49:52,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:52,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:52,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:52,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:52,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:49:52,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:52,905 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-03 19:49:52,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:52,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:49:52,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:49:52,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:52,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-03 19:49:52,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:49:52,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:49:52,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:49:52,986 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2019-09-03 19:49:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:53,148 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-09-03 19:49:53,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:49:53,148 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-09-03 19:49:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:53,149 INFO L225 Difference]: With dead ends: 71 [2019-09-03 19:49:53,150 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 19:49:53,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:49:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 19:49:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-03 19:49:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 19:49:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-03 19:49:53,164 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 44 [2019-09-03 19:49:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:53,164 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-03 19:49:53,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:49:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-03 19:49:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:49:53,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:53,166 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:53,166 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash 442428009, now seen corresponding path program 8 times [2019-09-03 19:49:53,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:53,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:53,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:49:53,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:53,262 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:53,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:49:53,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:49:53,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:53,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:49:53,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:53,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:49:53,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:53,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-09-03 19:49:53,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:49:53,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:49:53,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:49:53,335 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2019-09-03 19:49:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:53,430 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-03 19:49:53,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:49:53,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-09-03 19:49:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:53,432 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:49:53,432 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 19:49:53,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:49:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 19:49:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-09-03 19:49:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:49:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-03 19:49:53,440 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2019-09-03 19:49:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:53,440 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-03 19:49:53,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:49:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-03 19:49:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:49:53,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:53,442 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:53,442 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:53,442 INFO L82 PathProgramCache]: Analyzing trace with hash 21084794, now seen corresponding path program 9 times [2019-09-03 19:49:53,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:53,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:53,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:53,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:49:53,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:53,553 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-03 19:49:53,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:49:53,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:49:53,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:53,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:49:53,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:49:53,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:53,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-03 19:49:53,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:49:53,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:49:53,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:49:53,618 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2019-09-03 19:49:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:53,830 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-09-03 19:49:53,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:49:53,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-09-03 19:49:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:53,831 INFO L225 Difference]: With dead ends: 82 [2019-09-03 19:49:53,832 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 19:49:53,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:49:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 19:49:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-03 19:49:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 19:49:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-09-03 19:49:53,844 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 52 [2019-09-03 19:49:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:53,844 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-09-03 19:49:53,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:49:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-09-03 19:49:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 19:49:53,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:53,848 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:53,849 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:53,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2096338421, now seen corresponding path program 10 times [2019-09-03 19:49:53,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:53,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:53,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:53,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:53,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:49:53,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:53,946 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:53,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:49:53,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:49:53,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:53,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:49:53,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:54,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:49:54,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:54,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-09-03 19:49:54,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:49:54,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:49:54,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:49:54,059 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2019-09-03 19:49:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:54,174 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-09-03 19:49:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:49:54,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-03 19:49:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:54,176 INFO L225 Difference]: With dead ends: 69 [2019-09-03 19:49:54,176 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 19:49:54,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:49:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 19:49:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-09-03 19:49:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 19:49:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-03 19:49:54,190 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 53 [2019-09-03 19:49:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:54,193 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-03 19:49:54,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:49:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-03 19:49:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 19:49:54,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:54,194 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:54,194 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:54,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:54,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1572192408, now seen corresponding path program 11 times [2019-09-03 19:49:54,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:54,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:54,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:54,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:54,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:49:54,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:54,356 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-03 19:49:54,376 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-03 19:49:54,401 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:49:54,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:54,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:49:54,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:49:54,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:54,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-03 19:49:54,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:49:54,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:49:54,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:49:54,436 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 17 states. [2019-09-03 19:49:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:54,702 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-09-03 19:49:54,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:49:54,703 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-09-03 19:49:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:54,704 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:49:54,704 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 19:49:54,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:49:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 19:49:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-03 19:49:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 19:49:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-03 19:49:54,713 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 60 [2019-09-03 19:49:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:54,713 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-03 19:49:54,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:49:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-03 19:49:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 19:49:54,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:54,714 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:54,714 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:54,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:54,715 INFO L82 PathProgramCache]: Analyzing trace with hash 941903657, now seen corresponding path program 12 times [2019-09-03 19:49:54,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:54,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:54,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:54,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:54,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:49:54,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:54,795 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-03 19:49:54,820 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:49:54,845 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:49:54,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:54,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:49:54,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:54,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:49:54,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:54,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-09-03 19:49:54,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:49:54,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:49:54,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:49:54,895 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 14 states. [2019-09-03 19:49:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:54,993 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-09-03 19:49:54,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:49:54,993 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-03 19:49:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:54,994 INFO L225 Difference]: With dead ends: 77 [2019-09-03 19:49:54,994 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 19:49:54,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:49:54,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 19:49:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-09-03 19:49:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 19:49:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-09-03 19:49:55,001 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 61 [2019-09-03 19:49:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:55,002 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-09-03 19:49:55,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:49:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-09-03 19:49:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:49:55,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:55,003 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:55,003 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:55,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:55,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1438286406, now seen corresponding path program 13 times [2019-09-03 19:49:55,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:55,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:55,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:55,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:55,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:49:55,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:55,186 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) [2019-09-03 19:49:55,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:55,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:49:55,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:49:55,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:55,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-03 19:49:55,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:49:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:49:55,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:49:55,268 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 19 states. [2019-09-03 19:49:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:55,541 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2019-09-03 19:49:55,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:49:55,542 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-09-03 19:49:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:55,543 INFO L225 Difference]: With dead ends: 104 [2019-09-03 19:49:55,543 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 19:49:55,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:49:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 19:49:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-03 19:49:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 19:49:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-03 19:49:55,552 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 68 [2019-09-03 19:49:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:55,553 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-03 19:49:55,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:49:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-03 19:49:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-03 19:49:55,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:55,554 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:55,555 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:55,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash 654895947, now seen corresponding path program 14 times [2019-09-03 19:49:55,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:55,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:55,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:55,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:55,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:49:55,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:55,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 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-03 19:49:55,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:49:55,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:49:55,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:55,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:49:55,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:55,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:49:55,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:55,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-09-03 19:49:55,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:49:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:49:55,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:49:55,765 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2019-09-03 19:49:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:55,852 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-09-03 19:49:55,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:49:55,853 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-09-03 19:49:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:55,854 INFO L225 Difference]: With dead ends: 85 [2019-09-03 19:49:55,854 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 19:49:55,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:49:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 19:49:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-03 19:49:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 19:49:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-03 19:49:55,860 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2019-09-03 19:49:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:55,861 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-03 19:49:55,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:49:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-03 19:49:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 19:49:55,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:55,862 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:55,862 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:55,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash -165587112, now seen corresponding path program 15 times [2019-09-03 19:49:55,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:55,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:55,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:49:56,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:56,038 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) [2019-09-03 19:49:56,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:56,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:49:56,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:56,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:49:56,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:49:56,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:56,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-03 19:49:56,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:49:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:49:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:49:56,126 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 21 states. [2019-09-03 19:49:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:56,434 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-09-03 19:49:56,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:49:56,435 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-03 19:49:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:56,437 INFO L225 Difference]: With dead ends: 115 [2019-09-03 19:49:56,437 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:49:56,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:49:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:49:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-03 19:49:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:49:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-03 19:49:56,446 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 76 [2019-09-03 19:49:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:56,446 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-03 19:49:56,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:49:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-03 19:49:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 19:49:56,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:56,447 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:56,448 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash 501916649, now seen corresponding path program 16 times [2019-09-03 19:49:56,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:56,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:56,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:49:56,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:56,570 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:56,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:49:56,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:49:56,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:56,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:49:56,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:56,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:49:56,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:56,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2019-09-03 19:49:56,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:49:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:49:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:49:56,674 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 16 states. [2019-09-03 19:49:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:56,783 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-09-03 19:49:56,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:49:56,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-09-03 19:49:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:56,786 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:49:56,786 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 19:49:56,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:49:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 19:49:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-09-03 19:49:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 19:49:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-03 19:49:56,793 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 77 [2019-09-03 19:49:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:56,793 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-03 19:49:56,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:49:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-03 19:49:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:49:56,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:56,795 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:56,795 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1520807686, now seen corresponding path program 17 times [2019-09-03 19:49:56,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:56,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:56,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:56,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:49:57,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:57,023 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) [2019-09-03 19:49:57,040 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:57,080 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:49:57,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:57,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:49:57,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:49:57,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:57,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-03 19:49:57,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:49:57,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:49:57,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:49:57,112 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 23 states. [2019-09-03 19:49:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:57,484 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2019-09-03 19:49:57,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:49:57,484 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2019-09-03 19:49:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:57,486 INFO L225 Difference]: With dead ends: 126 [2019-09-03 19:49:57,486 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 19:49:57,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:49:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 19:49:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-03 19:49:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 19:49:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-03 19:49:57,495 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 84 [2019-09-03 19:49:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:57,495 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-03 19:49:57,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:49:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-03 19:49:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-03 19:49:57,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:57,496 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:57,497 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1071283339, now seen corresponding path program 18 times [2019-09-03 19:49:57,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:57,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:57,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:57,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:57,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:49:57,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:57,646 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-03 19:49:57,666 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:49:57,698 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:49:57,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:57,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:49:57,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:57,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:49:57,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:57,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-09-03 19:49:57,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:49:57,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:49:57,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:49:57,742 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 17 states. [2019-09-03 19:49:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:57,853 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-09-03 19:49:57,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:49:57,854 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-03 19:49:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:57,855 INFO L225 Difference]: With dead ends: 101 [2019-09-03 19:49:57,855 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 19:49:57,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:49:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 19:49:57,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-09-03 19:49:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 19:49:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-09-03 19:49:57,862 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 85 [2019-09-03 19:49:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:57,862 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-09-03 19:49:57,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:49:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-09-03 19:49:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 19:49:57,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:57,864 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:57,864 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:57,864 INFO L82 PathProgramCache]: Analyzing trace with hash 48619032, now seen corresponding path program 19 times [2019-09-03 19:49:57,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:57,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:57,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:57,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:57,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:49:58,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:58,092 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:58,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:58,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:49:58,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:49:58,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:58,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-03 19:49:58,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:49:58,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:49:58,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:49:58,167 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 25 states. [2019-09-03 19:49:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:58,662 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2019-09-03 19:49:58,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:49:58,663 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2019-09-03 19:49:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:58,664 INFO L225 Difference]: With dead ends: 137 [2019-09-03 19:49:58,664 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 19:49:58,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:49:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 19:49:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-03 19:49:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 19:49:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-03 19:49:58,672 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 92 [2019-09-03 19:49:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:58,672 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-03 19:49:58,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:49:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-03 19:49:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 19:49:58,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:58,673 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:58,674 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1764890455, now seen corresponding path program 20 times [2019-09-03 19:49:58,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:58,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:58,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:58,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:58,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:49:58,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:58,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:49:58,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:58,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:49:58,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:58,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:49:58,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:58,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:49:58,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:58,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2019-09-03 19:49:58,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:49:58,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:49:58,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:49:58,949 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 18 states. [2019-09-03 19:49:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:59,082 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-09-03 19:49:59,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:49:59,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-03 19:49:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:59,085 INFO L225 Difference]: With dead ends: 109 [2019-09-03 19:49:59,085 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 19:49:59,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:49:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 19:49:59,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-09-03 19:49:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 19:49:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-09-03 19:49:59,092 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 93 [2019-09-03 19:49:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:59,092 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-09-03 19:49:59,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:49:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-09-03 19:49:59,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 19:49:59,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:59,093 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:59,094 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:59,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:59,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1343998918, now seen corresponding path program 21 times [2019-09-03 19:49:59,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:59,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:59,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:49:59,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:59,403 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) [2019-09-03 19:49:59,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:59,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 19:49:59,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:59,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:49:59,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:49:59,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:59,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-03 19:49:59,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:49:59,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:49:59,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:49:59,492 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 27 states. [2019-09-03 19:49:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:59,979 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2019-09-03 19:49:59,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:49:59,980 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2019-09-03 19:49:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:59,981 INFO L225 Difference]: With dead ends: 148 [2019-09-03 19:49:59,981 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 19:49:59,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=391, Invalid=1169, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:49:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 19:49:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-03 19:49:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 19:49:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-09-03 19:49:59,988 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 100 [2019-09-03 19:49:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:59,988 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-09-03 19:49:59,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:49:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-09-03 19:49:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-03 19:49:59,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:59,990 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:59,990 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:59,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2098913845, now seen corresponding path program 22 times [2019-09-03 19:49:59,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:59,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:59,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:59,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:59,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:50:00,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:00,143 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) [2019-09-03 19:50:00,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:00,206 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:00,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:00,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:50:00,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:00,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:50:00,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:00,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-09-03 19:50:00,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:50:00,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:50:00,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:50:00,274 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 19 states. [2019-09-03 19:50:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:00,414 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2019-09-03 19:50:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:50:00,414 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2019-09-03 19:50:00,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:00,415 INFO L225 Difference]: With dead ends: 117 [2019-09-03 19:50:00,416 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 19:50:00,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:50:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 19:50:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-09-03 19:50:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 19:50:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-09-03 19:50:00,423 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 101 [2019-09-03 19:50:00,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:00,424 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-09-03 19:50:00,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:50:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-09-03 19:50:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 19:50:00,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:00,425 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:00,425 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:00,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1239460648, now seen corresponding path program 23 times [2019-09-03 19:50:00,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:00,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:00,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:50:00,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:00,760 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-03 19:50:00,772 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:50:00,814 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:50:00,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:00,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:50:00,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 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-03 19:50:00,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:00,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-03 19:50:00,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:50:00,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:50:00,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:50:00,843 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 29 states. [2019-09-03 19:50:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:01,419 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2019-09-03 19:50:01,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:50:01,422 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2019-09-03 19:50:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:01,423 INFO L225 Difference]: With dead ends: 159 [2019-09-03 19:50:01,424 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 19:50:01,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:50:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 19:50:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-03 19:50:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 19:50:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-03 19:50:01,433 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 108 [2019-09-03 19:50:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:01,434 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-03 19:50:01,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:50:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-03 19:50:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-03 19:50:01,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:01,435 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:01,435 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash -857072279, now seen corresponding path program 24 times [2019-09-03 19:50:01,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:01,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:01,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:50:01,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:01,585 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) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:01,597 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:01,634 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:50:01,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:01,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:50:01,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:01,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:50:01,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:01,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2019-09-03 19:50:01,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:50:01,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:50:01,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:50:01,686 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 20 states. [2019-09-03 19:50:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:01,843 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2019-09-03 19:50:01,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:50:01,843 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 109 [2019-09-03 19:50:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:01,845 INFO L225 Difference]: With dead ends: 125 [2019-09-03 19:50:01,845 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 19:50:01,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:50:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 19:50:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-09-03 19:50:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 19:50:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-09-03 19:50:01,853 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 109 [2019-09-03 19:50:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:01,853 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-09-03 19:50:01,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:50:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-09-03 19:50:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 19:50:01,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:01,855 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:01,855 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1212622714, now seen corresponding path program 25 times [2019-09-03 19:50:01,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:01,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:01,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:01,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:01,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:50:02,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:02,262 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-03 19:50:02,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:02,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:50:02,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:50:02,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:02,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-03 19:50:02,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:50:02,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:50:02,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:50:02,386 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 31 states. [2019-09-03 19:50:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:03,000 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2019-09-03 19:50:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:50:03,001 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2019-09-03 19:50:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:03,002 INFO L225 Difference]: With dead ends: 170 [2019-09-03 19:50:03,002 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 19:50:03,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=511, Invalid=1559, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:50:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 19:50:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-03 19:50:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:50:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-09-03 19:50:03,011 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 116 [2019-09-03 19:50:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:03,012 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-09-03 19:50:03,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:50:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-09-03 19:50:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 19:50:03,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:03,013 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:03,013 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1720504075, now seen corresponding path program 26 times [2019-09-03 19:50:03,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:03,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:03,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:50:03,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:03,245 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) [2019-09-03 19:50:03,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:03,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:03,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:03,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:50:03,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:03,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:50:03,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:03,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-09-03 19:50:03,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:50:03,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:50:03,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:50:03,356 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 21 states. [2019-09-03 19:50:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:03,515 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2019-09-03 19:50:03,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:50:03,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2019-09-03 19:50:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:03,516 INFO L225 Difference]: With dead ends: 133 [2019-09-03 19:50:03,516 INFO L226 Difference]: Without dead ends: 131 [2019-09-03 19:50:03,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:50:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-03 19:50:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-09-03 19:50:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 19:50:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-09-03 19:50:03,525 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 117 [2019-09-03 19:50:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:03,526 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-09-03 19:50:03,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:50:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-09-03 19:50:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 19:50:03,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:03,527 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:03,527 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:03,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1625930648, now seen corresponding path program 27 times [2019-09-03 19:50:03,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:03,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:03,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:03,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:03,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:50:03,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:03,962 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-03 19:50:03,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:04,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:50:04,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:04,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:50:04,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:50:04,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:04,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-03 19:50:04,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:50:04,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:50:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:50:04,103 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 33 states. [2019-09-03 19:50:04,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:04,524 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2019-09-03 19:50:04,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:50:04,525 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2019-09-03 19:50:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:04,526 INFO L225 Difference]: With dead ends: 181 [2019-09-03 19:50:04,526 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 19:50:04,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=577, Invalid=1775, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:50:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 19:50:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-03 19:50:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 19:50:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-03 19:50:04,535 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 124 [2019-09-03 19:50:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:04,536 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-03 19:50:04,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:50:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-03 19:50:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-03 19:50:04,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:04,537 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:04,537 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:04,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash 156975657, now seen corresponding path program 28 times [2019-09-03 19:50:04,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:04,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:04,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:04,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:04,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:50:04,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:04,736 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-03 19:50:04,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:50:04,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:04,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:04,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:50:04,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:04,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:50:04,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:04,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2019-09-03 19:50:04,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:50:04,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:50:04,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:50:04,900 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 22 states. [2019-09-03 19:50:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:05,102 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-09-03 19:50:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:50:05,102 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 125 [2019-09-03 19:50:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:05,103 INFO L225 Difference]: With dead ends: 141 [2019-09-03 19:50:05,104 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 19:50:05,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:50:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 19:50:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-09-03 19:50:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 19:50:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-09-03 19:50:05,113 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 125 [2019-09-03 19:50:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:05,113 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-09-03 19:50:05,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:50:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-09-03 19:50:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 19:50:05,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:05,115 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:05,116 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:05,116 INFO L82 PathProgramCache]: Analyzing trace with hash -303617350, now seen corresponding path program 29 times [2019-09-03 19:50:05,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:05,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:05,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:05,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:05,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:50:05,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:05,574 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) [2019-09-03 19:50:05,587 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:05,645 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 19:50:05,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:05,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:50:05,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:50:05,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:05,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-03 19:50:05,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:50:05,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:50:05,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:50:05,679 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 35 states. [2019-09-03 19:50:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:06,525 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2019-09-03 19:50:06,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:50:06,530 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 132 [2019-09-03 19:50:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:06,532 INFO L225 Difference]: With dead ends: 192 [2019-09-03 19:50:06,532 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 19:50:06,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=647, Invalid=2005, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:50:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 19:50:06,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-03 19:50:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 19:50:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-09-03 19:50:06,541 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 132 [2019-09-03 19:50:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:06,541 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-09-03 19:50:06,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:50:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-09-03 19:50:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-03 19:50:06,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:06,543 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:06,543 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:06,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:06,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1647677515, now seen corresponding path program 30 times [2019-09-03 19:50:06,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:06,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:06,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:50:06,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:06,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:06,791 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:06,857 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:50:06,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:06,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:50:06,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:06,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:50:06,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:06,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-09-03 19:50:06,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:50:06,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:50:06,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:50:06,939 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 23 states. [2019-09-03 19:50:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:07,151 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2019-09-03 19:50:07,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:50:07,151 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 133 [2019-09-03 19:50:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:07,153 INFO L225 Difference]: With dead ends: 149 [2019-09-03 19:50:07,153 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 19:50:07,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:50:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 19:50:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-09-03 19:50:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 19:50:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-09-03 19:50:07,162 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 133 [2019-09-03 19:50:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:07,165 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-09-03 19:50:07,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:50:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-09-03 19:50:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 19:50:07,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:07,168 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:07,169 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:07,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:07,169 INFO L82 PathProgramCache]: Analyzing trace with hash 861999704, now seen corresponding path program 31 times [2019-09-03 19:50:07,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:07,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:07,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:07,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:07,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:50:07,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:07,617 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-03 19:50:07,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:07,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:50:07,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:50:07,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:07,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-03 19:50:07,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:50:07,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:50:07,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:50:07,710 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 37 states. [2019-09-03 19:50:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:08,687 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2019-09-03 19:50:08,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:50:08,687 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2019-09-03 19:50:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:08,688 INFO L225 Difference]: With dead ends: 203 [2019-09-03 19:50:08,688 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 19:50:08,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=721, Invalid=2249, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:50:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 19:50:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-03 19:50:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-03 19:50:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-03 19:50:08,697 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 140 [2019-09-03 19:50:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:08,697 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-03 19:50:08,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:50:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-03 19:50:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-03 19:50:08,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:08,698 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:08,698 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:08,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1950177001, now seen corresponding path program 32 times [2019-09-03 19:50:08,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:08,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:08,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:08,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:08,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:50:08,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:08,932 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) [2019-09-03 19:50:08,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:08,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:08,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:08,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:50:08,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:09,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:50:09,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:09,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2019-09-03 19:50:09,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:50:09,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:50:09,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:50:09,048 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 24 states. [2019-09-03 19:50:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:09,229 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2019-09-03 19:50:09,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:50:09,230 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 141 [2019-09-03 19:50:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:09,232 INFO L225 Difference]: With dead ends: 157 [2019-09-03 19:50:09,232 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 19:50:09,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:50:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 19:50:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-09-03 19:50:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 19:50:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-09-03 19:50:09,241 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 141 [2019-09-03 19:50:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:09,242 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-09-03 19:50:09,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:50:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-09-03 19:50:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 19:50:09,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:09,243 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:09,243 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1630027258, now seen corresponding path program 33 times [2019-09-03 19:50:09,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:09,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:09,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:09,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 19:50:09,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:09,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 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-03 19:50:09,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:09,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 19:50:09,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:09,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:50:09,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 19:50:09,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:09,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-03 19:50:09,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:50:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:50:09,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:50:09,879 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2019-09-03 19:50:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:10,823 INFO L93 Difference]: Finished difference Result 214 states and 233 transitions. [2019-09-03 19:50:10,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:50:10,825 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2019-09-03 19:50:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:10,826 INFO L225 Difference]: With dead ends: 214 [2019-09-03 19:50:10,826 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 19:50:10,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=799, Invalid=2507, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:50:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 19:50:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-03 19:50:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 19:50:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-09-03 19:50:10,838 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 148 [2019-09-03 19:50:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:10,838 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-09-03 19:50:10,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:50:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-09-03 19:50:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 19:50:10,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:10,840 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:10,840 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:10,841 INFO L82 PathProgramCache]: Analyzing trace with hash 776167819, now seen corresponding path program 34 times [2019-09-03 19:50:10,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:10,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:10,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 19:50:11,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:11,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 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-03 19:50:11,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:50:11,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:11,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:11,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:50:11,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:11,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 19:50:11,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:11,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-09-03 19:50:11,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:50:11,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:50:11,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:50:11,211 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 25 states. [2019-09-03 19:50:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:11,421 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2019-09-03 19:50:11,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:50:11,421 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2019-09-03 19:50:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:11,423 INFO L225 Difference]: With dead ends: 165 [2019-09-03 19:50:11,424 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 19:50:11,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:50:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 19:50:11,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-09-03 19:50:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 19:50:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-09-03 19:50:11,437 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 149 [2019-09-03 19:50:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:11,437 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-09-03 19:50:11,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:50:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-09-03 19:50:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 19:50:11,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:11,439 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:11,440 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:11,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:11,440 INFO L82 PathProgramCache]: Analyzing trace with hash -56534760, now seen corresponding path program 35 times [2019-09-03 19:50:11,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:11,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:11,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:11,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 19:50:12,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:12,276 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) [2019-09-03 19:50:12,289 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:12,354 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-03 19:50:12,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:12,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:50:12,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 19:50:12,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:12,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-03 19:50:12,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:50:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:50:12,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:50:12,389 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2019-09-03 19:50:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:13,376 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2019-09-03 19:50:13,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:50:13,380 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 156 [2019-09-03 19:50:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:13,382 INFO L225 Difference]: With dead ends: 225 [2019-09-03 19:50:13,382 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 19:50:13,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=881, Invalid=2779, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:50:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 19:50:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-03 19:50:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:50:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-03 19:50:13,393 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 156 [2019-09-03 19:50:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:13,394 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-03 19:50:13,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:50:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-03 19:50:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 19:50:13,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:13,396 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:13,396 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:13,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:13,396 INFO L82 PathProgramCache]: Analyzing trace with hash -726901847, now seen corresponding path program 36 times [2019-09-03 19:50:13,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:13,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:13,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:13,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 19:50:13,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:13,645 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-03 19:50:13,654 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:13,734 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:50:13,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:13,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:50:13,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:13,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 19:50:13,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:13,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2019-09-03 19:50:13,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:50:13,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:50:13,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:50:13,805 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 26 states. [2019-09-03 19:50:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:14,043 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2019-09-03 19:50:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:50:14,043 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 157 [2019-09-03 19:50:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:14,044 INFO L225 Difference]: With dead ends: 173 [2019-09-03 19:50:14,045 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 19:50:14,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:50:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 19:50:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-09-03 19:50:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 19:50:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-09-03 19:50:14,054 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 157 [2019-09-03 19:50:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:14,055 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-09-03 19:50:14,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:50:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-09-03 19:50:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 19:50:14,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:14,056 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:14,056 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:14,057 INFO L82 PathProgramCache]: Analyzing trace with hash -479305414, now seen corresponding path program 37 times [2019-09-03 19:50:14,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:14,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:14,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:14,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 19:50:14,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:14,705 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-03 19:50:14,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:14,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:50:14,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 19:50:14,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:14,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-03 19:50:14,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:50:14,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:50:14,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:50:14,804 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 43 states. [2019-09-03 19:50:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:15,982 INFO L93 Difference]: Finished difference Result 236 states and 257 transitions. [2019-09-03 19:50:15,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:50:15,985 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2019-09-03 19:50:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:15,986 INFO L225 Difference]: With dead ends: 236 [2019-09-03 19:50:15,986 INFO L226 Difference]: Without dead ends: 168 [2019-09-03 19:50:15,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:50:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-03 19:50:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-03 19:50:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-03 19:50:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-09-03 19:50:15,997 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 164 [2019-09-03 19:50:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:15,997 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-09-03 19:50:15,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:50:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-09-03 19:50:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-03 19:50:15,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:15,999 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:15,999 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:15,999 INFO L82 PathProgramCache]: Analyzing trace with hash 68829899, now seen corresponding path program 38 times [2019-09-03 19:50:15,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:15,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:16,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:16,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:16,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 19:50:16,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:16,307 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-03 19:50:16,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:50:16,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:16,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:16,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:50:16,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:16,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 19:50:16,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:16,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-09-03 19:50:16,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:50:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:50:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:50:16,496 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 27 states. [2019-09-03 19:50:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:16,693 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2019-09-03 19:50:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:50:16,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 165 [2019-09-03 19:50:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:16,696 INFO L225 Difference]: With dead ends: 181 [2019-09-03 19:50:16,696 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 19:50:16,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:50:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 19:50:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2019-09-03 19:50:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 19:50:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-09-03 19:50:16,705 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 165 [2019-09-03 19:50:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:16,705 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-09-03 19:50:16,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:50:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-09-03 19:50:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 19:50:16,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:16,707 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:16,707 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:16,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:16,707 INFO L82 PathProgramCache]: Analyzing trace with hash -356085800, now seen corresponding path program 39 times [2019-09-03 19:50:16,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:16,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:16,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:16,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:16,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 19:50:17,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:17,332 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-03 19:50:17,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:17,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 19:50:17,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:17,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:50:17,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 19:50:17,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:17,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-03 19:50:17,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:50:17,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:50:17,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:50:17,453 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 45 states. [2019-09-03 19:50:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:18,777 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2019-09-03 19:50:18,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:50:18,777 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2019-09-03 19:50:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:18,778 INFO L225 Difference]: With dead ends: 247 [2019-09-03 19:50:18,779 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 19:50:18,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1057, Invalid=3365, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:50:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 19:50:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-09-03 19:50:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-03 19:50:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-03 19:50:18,790 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 172 [2019-09-03 19:50:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:18,791 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-03 19:50:18,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:50:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-03 19:50:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 19:50:18,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:18,792 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:18,792 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:18,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:18,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1355042921, now seen corresponding path program 40 times [2019-09-03 19:50:18,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:18,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:18,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:18,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:18,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 271 proven. 610 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 19:50:19,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:19,149 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-03 19:50:19,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:50:19,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:19,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:19,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:50:19,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:19,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 271 proven. 610 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:50:19,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:19,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2019-09-03 19:50:19,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:50:19,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:50:19,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:50:19,306 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 28 states. [2019-09-03 19:50:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:19,502 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2019-09-03 19:50:19,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:50:19,503 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 173 [2019-09-03 19:50:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:19,504 INFO L225 Difference]: With dead ends: 189 [2019-09-03 19:50:19,504 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 19:50:19,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:50:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 19:50:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2019-09-03 19:50:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 19:50:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-09-03 19:50:19,516 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 173 [2019-09-03 19:50:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:19,516 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-09-03 19:50:19,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:50:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-09-03 19:50:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 19:50:19,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:19,518 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:19,518 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:19,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1998427258, now seen corresponding path program 41 times [2019-09-03 19:50:19,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:19,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:19,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 714 proven. 231 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 19:50:20,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:20,185 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-03 19:50:20,196 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:50:20,275 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-03 19:50:20,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:20,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:50:20,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 714 proven. 231 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 19:50:20,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:20,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-03 19:50:20,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:50:20,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:50:20,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:50:20,323 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 47 states. [2019-09-03 19:50:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:21,682 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2019-09-03 19:50:21,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:50:21,682 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 180 [2019-09-03 19:50:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:21,684 INFO L225 Difference]: With dead ends: 258 [2019-09-03 19:50:21,684 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 19:50:21,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1151, Invalid=3679, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:50:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 19:50:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-03 19:50:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-03 19:50:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-03 19:50:21,703 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 180 [2019-09-03 19:50:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:21,703 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-03 19:50:21,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:50:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-03 19:50:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-03 19:50:21,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:21,706 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:21,706 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:21,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash -568445941, now seen corresponding path program 42 times [2019-09-03 19:50:21,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:21,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:21,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 19:50:22,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:22,116 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-03 19:50:22,128 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-03 19:50:22,223 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-03 19:50:22,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:22,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:50:22,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:22,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 19:50:22,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:22,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-09-03 19:50:22,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:50:22,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:50:22,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:50:22,317 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 29 states. [2019-09-03 19:50:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:22,586 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2019-09-03 19:50:22,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:50:22,587 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 181 [2019-09-03 19:50:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:22,588 INFO L225 Difference]: With dead ends: 197 [2019-09-03 19:50:22,588 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 19:50:22,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:50:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 19:50:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2019-09-03 19:50:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 19:50:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-09-03 19:50:22,599 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 181 [2019-09-03 19:50:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:22,599 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-09-03 19:50:22,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:50:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-09-03 19:50:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 19:50:22,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:22,601 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:22,601 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1257027224, now seen corresponding path program 43 times [2019-09-03 19:50:22,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:22,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:22,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:22,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:22,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 781 proven. 253 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 19:50:23,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:23,295 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-03 19:50:23,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:23,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:50:23,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 781 proven. 253 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:50:23,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:23,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-03 19:50:23,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:50:23,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:50:23,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:50:23,423 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 49 states. [2019-09-03 19:50:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:24,869 INFO L93 Difference]: Finished difference Result 269 states and 293 transitions. [2019-09-03 19:50:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:50:24,870 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 188 [2019-09-03 19:50:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:24,871 INFO L225 Difference]: With dead ends: 269 [2019-09-03 19:50:24,871 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 19:50:24,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1249, Invalid=4007, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:50:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 19:50:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-09-03 19:50:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 19:50:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-03 19:50:24,881 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 188 [2019-09-03 19:50:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:24,882 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-03 19:50:24,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:50:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-03 19:50:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-03 19:50:24,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:24,883 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:24,883 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:24,884 INFO L82 PathProgramCache]: Analyzing trace with hash 765539625, now seen corresponding path program 44 times [2019-09-03 19:50:24,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:24,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:24,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:24,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:24,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 320 proven. 737 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 19:50:25,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:25,259 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-03 19:50:25,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:50:25,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:25,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:25,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:50:25,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:25,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 320 proven. 737 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 19:50:25,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:25,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2019-09-03 19:50:25,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:50:25,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:50:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:50:25,414 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 30 states. [2019-09-03 19:50:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:25,680 INFO L93 Difference]: Finished difference Result 205 states and 207 transitions. [2019-09-03 19:50:25,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:50:25,680 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 189 [2019-09-03 19:50:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:25,682 INFO L225 Difference]: With dead ends: 205 [2019-09-03 19:50:25,682 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 19:50:25,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:50:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 19:50:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-09-03 19:50:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 19:50:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-09-03 19:50:25,693 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 189 [2019-09-03 19:50:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:25,694 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-09-03 19:50:25,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:50:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-09-03 19:50:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 19:50:25,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:25,695 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:25,695 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:25,696 INFO L82 PathProgramCache]: Analyzing trace with hash 530175930, now seen corresponding path program 45 times [2019-09-03 19:50:25,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:25,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:25,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:25,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:25,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 851 proven. 276 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 19:50:26,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:26,636 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-03 19:50:26,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:26,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 19:50:26,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:26,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:50:26,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 851 proven. 276 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 19:50:26,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:26,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-03 19:50:26,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:50:26,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:50:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:50:26,777 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 51 states. [2019-09-03 19:50:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:28,407 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2019-09-03 19:50:28,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:50:28,408 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2019-09-03 19:50:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:28,410 INFO L225 Difference]: With dead ends: 280 [2019-09-03 19:50:28,410 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 19:50:28,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1351, Invalid=4349, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:50:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 19:50:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-09-03 19:50:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 19:50:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-03 19:50:28,421 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 196 [2019-09-03 19:50:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:28,421 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-03 19:50:28,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:50:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-03 19:50:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-03 19:50:28,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:28,422 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:28,422 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:28,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1212992181, now seen corresponding path program 46 times [2019-09-03 19:50:28,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:28,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:28,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:28,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:28,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 346 proven. 805 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 19:50:28,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:28,860 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) [2019-09-03 19:50:28,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:28,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:28,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:28,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:50:28,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:28,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 346 proven. 805 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:50:29,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:29,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-09-03 19:50:29,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:50:29,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:50:29,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:50:29,037 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 31 states. [2019-09-03 19:50:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:29,264 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2019-09-03 19:50:29,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:50:29,264 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 197 [2019-09-03 19:50:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:29,267 INFO L225 Difference]: With dead ends: 213 [2019-09-03 19:50:29,267 INFO L226 Difference]: Without dead ends: 211 [2019-09-03 19:50:29,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:50:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-03 19:50:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2019-09-03 19:50:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 19:50:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-09-03 19:50:29,278 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 197 [2019-09-03 19:50:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:29,278 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-09-03 19:50:29,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:50:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-09-03 19:50:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 19:50:29,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:29,280 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:29,280 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1227869528, now seen corresponding path program 47 times [2019-09-03 19:50:29,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:29,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:29,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 924 proven. 300 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 19:50:30,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:30,149 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-03 19:50:30,159 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:50:30,232 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-03 19:50:30,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:30,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:50:30,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 924 proven. 300 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 19:50:30,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:30,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-03 19:50:30,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:50:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:50:30,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=2053, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:50:30,294 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 53 states. [2019-09-03 19:50:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:32,065 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2019-09-03 19:50:32,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:50:32,066 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2019-09-03 19:50:32,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:32,067 INFO L225 Difference]: With dead ends: 291 [2019-09-03 19:50:32,068 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 19:50:32,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1457, Invalid=4705, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:50:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 19:50:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-09-03 19:50:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-03 19:50:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-03 19:50:32,079 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 204 [2019-09-03 19:50:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:32,079 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-03 19:50:32,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:50:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-03 19:50:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-03 19:50:32,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:32,081 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:32,081 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1889596951, now seen corresponding path program 48 times [2019-09-03 19:50:32,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:32,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:32,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:32,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:32,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 19:50:32,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:32,474 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-03 19:50:32,484 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:32,578 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:50:32,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:32,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:50:32,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:32,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 19:50:32,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:32,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2019-09-03 19:50:32,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:50:32,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:50:32,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:50:32,668 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 32 states. [2019-09-03 19:50:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:32,971 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2019-09-03 19:50:32,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:50:32,972 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-09-03 19:50:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:32,974 INFO L225 Difference]: With dead ends: 221 [2019-09-03 19:50:32,974 INFO L226 Difference]: Without dead ends: 219 [2019-09-03 19:50:32,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:50:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-03 19:50:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2019-09-03 19:50:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-03 19:50:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-09-03 19:50:32,985 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 205 [2019-09-03 19:50:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:32,985 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-09-03 19:50:32,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:50:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-09-03 19:50:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 19:50:32,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:32,987 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:32,987 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:32,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:32,988 INFO L82 PathProgramCache]: Analyzing trace with hash 558312186, now seen corresponding path program 49 times [2019-09-03 19:50:32,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:32,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:32,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:32,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:32,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 19:50:33,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:33,977 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-03 19:50:33,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:34,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:50:34,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 19:50:34,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:34,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-03 19:50:34,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:50:34,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:50:34,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:50:34,112 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 55 states. [2019-09-03 19:50:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:35,956 INFO L93 Difference]: Finished difference Result 302 states and 329 transitions. [2019-09-03 19:50:35,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:50:35,960 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2019-09-03 19:50:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:35,962 INFO L225 Difference]: With dead ends: 302 [2019-09-03 19:50:35,962 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 19:50:35,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1567, Invalid=5075, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:50:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 19:50:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-09-03 19:50:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-03 19:50:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2019-09-03 19:50:35,978 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 212 [2019-09-03 19:50:35,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:35,979 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2019-09-03 19:50:35,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:50:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2019-09-03 19:50:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-03 19:50:35,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:35,982 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:35,982 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:35,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:35,982 INFO L82 PathProgramCache]: Analyzing trace with hash -851622261, now seen corresponding path program 50 times [2019-09-03 19:50:35,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:35,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:35,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 19:50:36,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:36,647 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-03 19:50:36,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:50:36,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:36,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:36,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 19:50:36,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:36,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 19:50:36,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:36,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-09-03 19:50:36,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:50:36,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:50:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=640, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:50:36,918 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 33 states. [2019-09-03 19:50:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:37,185 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2019-09-03 19:50:37,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:50:37,185 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 213 [2019-09-03 19:50:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:37,186 INFO L225 Difference]: With dead ends: 229 [2019-09-03 19:50:37,187 INFO L226 Difference]: Without dead ends: 227 [2019-09-03 19:50:37,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=422, Invalid=700, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:50:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-03 19:50:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2019-09-03 19:50:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 19:50:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2019-09-03 19:50:37,198 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 213 [2019-09-03 19:50:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:37,199 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2019-09-03 19:50:37,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:50:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2019-09-03 19:50:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-03 19:50:37,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:37,201 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:37,201 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:37,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1330916328, now seen corresponding path program 51 times [2019-09-03 19:50:37,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:37,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:37,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:37,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 19:50:38,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:38,144 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-03 19:50:38,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:38,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 19:50:38,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:38,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:50:38,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (52)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:50:38,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:38,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-03 19:50:38,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:50:38,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:50:38,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=2379, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:50:38,303 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 57 states. [2019-09-03 19:50:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:39,378 INFO L93 Difference]: Finished difference Result 313 states and 341 transitions. [2019-09-03 19:50:39,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:50:39,378 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 220 [2019-09-03 19:50:39,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:39,383 INFO L225 Difference]: With dead ends: 313 [2019-09-03 19:50:39,383 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 19:50:39,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1681, Invalid=5459, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:50:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 19:50:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-09-03 19:50:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-03 19:50:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2019-09-03 19:50:39,396 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 220 [2019-09-03 19:50:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:39,396 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2019-09-03 19:50:39,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:50:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2019-09-03 19:50:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-03 19:50:39,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:39,398 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:39,398 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:39,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:39,398 INFO L82 PathProgramCache]: Analyzing trace with hash 957992617, now seen corresponding path program 52 times [2019-09-03 19:50:39,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:39,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:39,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:39,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:39,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 430 proven. 1027 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 19:50:40,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:40,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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:40,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:50:40,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:40,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:40,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:50:40,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:40,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 430 proven. 1027 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 19:50:40,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:40,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 34 [2019-09-03 19:50:40,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:50:40,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:50:40,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:50:40,335 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 34 states. [2019-09-03 19:50:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:40,732 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2019-09-03 19:50:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:50:40,733 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 221 [2019-09-03 19:50:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:40,735 INFO L225 Difference]: With dead ends: 237 [2019-09-03 19:50:40,735 INFO L226 Difference]: Without dead ends: 235 [2019-09-03 19:50:40,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:50:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-03 19:50:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2019-09-03 19:50:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-03 19:50:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2019-09-03 19:50:40,753 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 221 [2019-09-03 19:50:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:40,754 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2019-09-03 19:50:40,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:50:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2019-09-03 19:50:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-03 19:50:40,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:40,757 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:40,757 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1099533882, now seen corresponding path program 53 times [2019-09-03 19:50:40,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:40,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:40,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 1161 proven. 378 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 19:50:42,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:42,521 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-03 19:50:42,542 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:50:42,707 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-03 19:50:42,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:42,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 19:50:42,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 1161 proven. 378 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 19:50:42,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:42,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-03 19:50:42,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:50:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:50:42,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:50:42,816 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2019-09-03 19:50:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:45,663 INFO L93 Difference]: Finished difference Result 324 states and 353 transitions. [2019-09-03 19:50:45,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:50:45,663 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 228 [2019-09-03 19:50:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:45,664 INFO L225 Difference]: With dead ends: 324 [2019-09-03 19:50:45,664 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 19:50:45,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1799, Invalid=5857, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:50:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 19:50:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-09-03 19:50:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-03 19:50:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2019-09-03 19:50:45,679 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 228 [2019-09-03 19:50:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:45,679 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2019-09-03 19:50:45,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:50:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2019-09-03 19:50:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-03 19:50:45,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:45,681 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:45,681 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash -601856053, now seen corresponding path program 54 times [2019-09-03 19:50:45,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:45,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:45,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:45,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:45,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 19:50:46,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:46,424 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-03 19:50:46,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:46,616 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-03 19:50:46,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:46,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:50:46,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (55)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:50:46,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:46,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-09-03 19:50:46,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:50:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:50:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:50:46,788 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 35 states. [2019-09-03 19:50:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:47,119 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2019-09-03 19:50:47,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:50:47,120 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 229 [2019-09-03 19:50:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:47,121 INFO L225 Difference]: With dead ends: 245 [2019-09-03 19:50:47,121 INFO L226 Difference]: Without dead ends: 243 [2019-09-03 19:50:47,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:50:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-03 19:50:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2019-09-03 19:50:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-03 19:50:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2019-09-03 19:50:47,132 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 229 [2019-09-03 19:50:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:47,133 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2019-09-03 19:50:47,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:50:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2019-09-03 19:50:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-03 19:50:47,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:47,135 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:47,135 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:47,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1417884968, now seen corresponding path program 55 times [2019-09-03 19:50:47,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:47,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:47,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:47,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:47,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 19:50:48,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:48,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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:48,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:48,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:50:48,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 19:50:48,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-03 19:50:48,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:50:48,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:50:48,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=2729, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:50:48,469 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 61 states. [2019-09-03 19:50:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:50,768 INFO L93 Difference]: Finished difference Result 335 states and 365 transitions. [2019-09-03 19:50:50,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 19:50:50,768 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 236 [2019-09-03 19:50:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:50,769 INFO L225 Difference]: With dead ends: 335 [2019-09-03 19:50:50,769 INFO L226 Difference]: Without dead ends: 240 [2019-09-03 19:50:50,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1921, Invalid=6269, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:50:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-03 19:50:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-09-03 19:50:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-03 19:50:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2019-09-03 19:50:50,781 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 236 [2019-09-03 19:50:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:50,781 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2019-09-03 19:50:50,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:50:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2019-09-03 19:50:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-03 19:50:50,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:50,783 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:50,783 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1290634089, now seen corresponding path program 56 times [2019-09-03 19:50:50,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:50,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:50,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:50,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:50,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 491 proven. 1190 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 19:50:51,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:51,569 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-03 19:50:51,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:50:51,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:51,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:51,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:50:51,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:51,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 491 proven. 1190 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 19:50:51,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:51,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 36 [2019-09-03 19:50:51,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:50:51,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:50:51,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:50:51,786 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 36 states. [2019-09-03 19:50:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:52,045 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2019-09-03 19:50:52,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:50:52,045 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 237 [2019-09-03 19:50:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:52,047 INFO L225 Difference]: With dead ends: 253 [2019-09-03 19:50:52,047 INFO L226 Difference]: Without dead ends: 251 [2019-09-03 19:50:52,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:50:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-03 19:50:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2019-09-03 19:50:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-03 19:50:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2019-09-03 19:50:52,058 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 237 [2019-09-03 19:50:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:52,059 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2019-09-03 19:50:52,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:50:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2019-09-03 19:50:52,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-03 19:50:52,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:52,060 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:52,061 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:52,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:52,061 INFO L82 PathProgramCache]: Analyzing trace with hash 113574266, now seen corresponding path program 57 times [2019-09-03 19:50:52,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:52,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:52,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:52,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:52,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 19:50:53,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:53,256 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-03 19:50:53,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:53,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 19:50:53,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:53,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:50:53,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (58)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:50:53,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:53,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-03 19:50:53,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:50:53,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:50:53,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:50:53,441 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 63 states. [2019-09-03 19:50:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:56,155 INFO L93 Difference]: Finished difference Result 346 states and 377 transitions. [2019-09-03 19:50:56,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:50:56,157 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 244 [2019-09-03 19:50:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:56,158 INFO L225 Difference]: With dead ends: 346 [2019-09-03 19:50:56,158 INFO L226 Difference]: Without dead ends: 248 [2019-09-03 19:50:56,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2047, Invalid=6695, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:50:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-03 19:50:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-09-03 19:50:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-03 19:50:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2019-09-03 19:50:56,172 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 244 [2019-09-03 19:50:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:56,172 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2019-09-03 19:50:56,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:50:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2019-09-03 19:50:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-03 19:50:56,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:56,174 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:56,175 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:56,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1656789259, now seen corresponding path program 58 times [2019-09-03 19:50:56,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:56,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:56,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:56,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:56,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 19:50:56,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:56,684 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-03 19:50:56,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:50:56,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:56,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:56,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 19:50:56,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:56,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (59)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:50:56,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:56,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-09-03 19:50:56,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:50:56,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:50:56,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:50:56,889 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 37 states. [2019-09-03 19:50:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:57,349 INFO L93 Difference]: Finished difference Result 261 states and 263 transitions. [2019-09-03 19:50:57,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:50:57,349 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 245 [2019-09-03 19:50:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:57,352 INFO L225 Difference]: With dead ends: 261 [2019-09-03 19:50:57,352 INFO L226 Difference]: Without dead ends: 259 [2019-09-03 19:50:57,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:50:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-03 19:50:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-09-03 19:50:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-03 19:50:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2019-09-03 19:50:57,369 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 245 [2019-09-03 19:50:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:57,369 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2019-09-03 19:50:57,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:50:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2019-09-03 19:50:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 19:50:57,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:57,371 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:57,372 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:57,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2101431912, now seen corresponding path program 59 times [2019-09-03 19:50:57,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:57,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:57,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1425 proven. 465 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 19:50:58,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:58,610 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-03 19:50:58,621 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:50:58,736 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-03 19:50:58,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:58,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:50:58,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1425 proven. 465 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 19:50:58,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:58,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-03 19:50:58,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:50:58,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:50:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=3103, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:50:58,801 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 65 states. [2019-09-03 19:51:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:01,415 INFO L93 Difference]: Finished difference Result 357 states and 389 transitions. [2019-09-03 19:51:01,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:51:01,419 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-09-03 19:51:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:01,421 INFO L225 Difference]: With dead ends: 357 [2019-09-03 19:51:01,421 INFO L226 Difference]: Without dead ends: 256 [2019-09-03 19:51:01,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2177, Invalid=7135, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:51:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-03 19:51:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2019-09-03 19:51:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-03 19:51:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2019-09-03 19:51:01,434 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 252 [2019-09-03 19:51:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:01,434 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2019-09-03 19:51:01,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:51:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2019-09-03 19:51:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-03 19:51:01,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:01,436 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:01,436 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:01,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:01,437 INFO L82 PathProgramCache]: Analyzing trace with hash 200681513, now seen corresponding path program 60 times [2019-09-03 19:51:01,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:01,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:01,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:01,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:01,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 556 proven. 1365 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 19:51:01,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:01,968 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-03 19:51:01,979 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:02,077 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-03 19:51:02,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:02,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 19:51:02,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:02,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 556 proven. 1365 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 19:51:02,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:02,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2019-09-03 19:51:02,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:51:02,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:51:02,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:51:02,176 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 38 states. [2019-09-03 19:51:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:02,549 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2019-09-03 19:51:02,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:51:02,549 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 253 [2019-09-03 19:51:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:02,551 INFO L225 Difference]: With dead ends: 269 [2019-09-03 19:51:02,552 INFO L226 Difference]: Without dead ends: 267 [2019-09-03 19:51:02,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:51:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-03 19:51:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2019-09-03 19:51:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-03 19:51:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2019-09-03 19:51:02,576 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 253 [2019-09-03 19:51:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:02,577 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2019-09-03 19:51:02,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:51:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2019-09-03 19:51:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-03 19:51:02,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:02,579 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:02,579 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:02,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash -128088902, now seen corresponding path program 61 times [2019-09-03 19:51:02,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:02,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:02,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:02,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:02,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3875 backedges. 1519 proven. 496 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 19:51:03,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:03,861 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-03 19:51:03,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:03,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 19:51:03,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3875 backedges. 1519 proven. 496 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 19:51:04,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:04,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-03 19:51:04,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 19:51:04,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 19:51:04,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:51:04,021 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 67 states. [2019-09-03 19:51:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:05,373 INFO L93 Difference]: Finished difference Result 368 states and 401 transitions. [2019-09-03 19:51:05,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:51:05,374 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 260 [2019-09-03 19:51:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:05,375 INFO L225 Difference]: With dead ends: 368 [2019-09-03 19:51:05,375 INFO L226 Difference]: Without dead ends: 264 [2019-09-03 19:51:05,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2311, Invalid=7589, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:51:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-03 19:51:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-09-03 19:51:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-03 19:51:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2019-09-03 19:51:05,389 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 260 [2019-09-03 19:51:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:05,389 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2019-09-03 19:51:05,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 19:51:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2019-09-03 19:51:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-03 19:51:05,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:05,391 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:05,391 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:05,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:05,392 INFO L82 PathProgramCache]: Analyzing trace with hash -528360885, now seen corresponding path program 62 times [2019-09-03 19:51:05,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:05,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:05,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:05,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:05,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 590 proven. 1457 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 19:51:05,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:05,974 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-03 19:51:05,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:06,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:06,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:06,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:51:06,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:06,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 590 proven. 1457 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 19:51:06,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:06,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-09-03 19:51:06,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:51:06,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:51:06,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=877, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:51:06,179 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 39 states. [2019-09-03 19:51:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:06,486 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2019-09-03 19:51:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:51:06,487 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 261 [2019-09-03 19:51:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:06,489 INFO L225 Difference]: With dead ends: 277 [2019-09-03 19:51:06,490 INFO L226 Difference]: Without dead ends: 275 [2019-09-03 19:51:06,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=611, Invalid=949, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:51:06,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-03 19:51:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2019-09-03 19:51:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-03 19:51:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2019-09-03 19:51:06,503 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 261 [2019-09-03 19:51:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:06,503 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2019-09-03 19:51:06,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:51:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2019-09-03 19:51:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-03 19:51:06,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:06,505 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:06,505 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:06,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1586333784, now seen corresponding path program 63 times [2019-09-03 19:51:06,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:06,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:06,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:06,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:06,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 1616 proven. 528 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 19:51:07,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:07,867 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-03 19:51:07,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:07,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 19:51:07,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:07,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 19:51:08,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 1616 proven. 528 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:51:08,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:08,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-03 19:51:08,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 19:51:08,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 19:51:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1191, Invalid=3501, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:51:08,068 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 69 states. [2019-09-03 19:51:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:11,004 INFO L93 Difference]: Finished difference Result 379 states and 413 transitions. [2019-09-03 19:51:11,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:51:11,004 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 268 [2019-09-03 19:51:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:11,006 INFO L225 Difference]: With dead ends: 379 [2019-09-03 19:51:11,006 INFO L226 Difference]: Without dead ends: 272 [2019-09-03 19:51:11,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2449, Invalid=8057, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 19:51:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-03 19:51:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-03 19:51:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-03 19:51:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 273 transitions. [2019-09-03 19:51:11,021 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 273 transitions. Word has length 268 [2019-09-03 19:51:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:11,021 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 273 transitions. [2019-09-03 19:51:11,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 19:51:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 273 transitions. [2019-09-03 19:51:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-03 19:51:11,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:11,023 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:11,023 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:11,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1773159191, now seen corresponding path program 64 times [2019-09-03 19:51:11,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:11,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:11,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 625 proven. 1552 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 19:51:11,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:11,605 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) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:11,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:11,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:11,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:11,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 19:51:11,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:11,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 625 proven. 1552 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 19:51:11,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:11,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 40 [2019-09-03 19:51:11,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:51:11,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:51:11,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:51:11,844 INFO L87 Difference]: Start difference. First operand 272 states and 273 transitions. Second operand 40 states. [2019-09-03 19:51:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:12,158 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2019-09-03 19:51:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:51:12,159 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 269 [2019-09-03 19:51:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:12,160 INFO L225 Difference]: With dead ends: 285 [2019-09-03 19:51:12,160 INFO L226 Difference]: Without dead ends: 283 [2019-09-03 19:51:12,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:51:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-03 19:51:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2019-09-03 19:51:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-03 19:51:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2019-09-03 19:51:12,175 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 269 [2019-09-03 19:51:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:12,175 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2019-09-03 19:51:12,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:51:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2019-09-03 19:51:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-03 19:51:12,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:12,177 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:12,178 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:12,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:12,178 INFO L82 PathProgramCache]: Analyzing trace with hash -558426118, now seen corresponding path program 65 times [2019-09-03 19:51:12,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:12,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:12,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:12,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:12,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 1716 proven. 561 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 19:51:13,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:13,579 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-03 19:51:13,588 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:13,697 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-09-03 19:51:13,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:13,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:51:13,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 1716 proven. 561 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 19:51:13,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:13,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-03 19:51:13,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 19:51:13,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 19:51:13,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:51:13,771 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 71 states. [2019-09-03 19:51:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:16,956 INFO L93 Difference]: Finished difference Result 390 states and 425 transitions. [2019-09-03 19:51:16,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:51:16,957 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 276 [2019-09-03 19:51:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:16,958 INFO L225 Difference]: With dead ends: 390 [2019-09-03 19:51:16,958 INFO L226 Difference]: Without dead ends: 280 [2019-09-03 19:51:16,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2591, Invalid=8539, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:51:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-03 19:51:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-09-03 19:51:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-03 19:51:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2019-09-03 19:51:16,972 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 276 [2019-09-03 19:51:16,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:16,972 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2019-09-03 19:51:16,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 19:51:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2019-09-03 19:51:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-03 19:51:16,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:16,974 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:16,975 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:16,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash 365439883, now seen corresponding path program 66 times [2019-09-03 19:51:16,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:16,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:16,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:16,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:16,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 661 proven. 1650 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 19:51:17,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:17,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 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-03 19:51:17,642 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:17,756 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-09-03 19:51:17,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:17,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 19:51:17,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:17,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 661 proven. 1650 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 19:51:17,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:17,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-09-03 19:51:17,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:51:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:51:17,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=964, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:51:17,859 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 41 states. [2019-09-03 19:51:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:18,285 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2019-09-03 19:51:18,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:51:18,286 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 277 [2019-09-03 19:51:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:18,288 INFO L225 Difference]: With dead ends: 293 [2019-09-03 19:51:18,288 INFO L226 Difference]: Without dead ends: 291 [2019-09-03 19:51:18,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=682, Invalid=1040, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:51:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-03 19:51:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2019-09-03 19:51:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-03 19:51:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2019-09-03 19:51:18,298 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 277 [2019-09-03 19:51:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:18,299 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2019-09-03 19:51:18,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:51:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2019-09-03 19:51:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-03 19:51:18,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:18,300 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:18,300 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:18,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash 101011224, now seen corresponding path program 67 times [2019-09-03 19:51:18,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:18,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:18,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:18,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:18,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1819 proven. 595 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 19:51:19,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:19,790 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-03 19:51:19,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:19,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 19:51:19,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1819 proven. 595 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 19:51:19,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:19,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-03 19:51:19,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 19:51:19,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 19:51:19,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=3923, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:51:19,942 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 73 states. [2019-09-03 19:51:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:22,320 INFO L93 Difference]: Finished difference Result 401 states and 437 transitions. [2019-09-03 19:51:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 19:51:22,320 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 284 [2019-09-03 19:51:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:22,321 INFO L225 Difference]: With dead ends: 401 [2019-09-03 19:51:22,322 INFO L226 Difference]: Without dead ends: 288 [2019-09-03 19:51:22,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2737, Invalid=9035, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 19:51:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-03 19:51:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-03 19:51:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-03 19:51:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2019-09-03 19:51:22,336 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 284 [2019-09-03 19:51:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:22,336 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2019-09-03 19:51:22,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 19:51:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2019-09-03 19:51:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-03 19:51:22,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:22,338 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:22,339 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1424604759, now seen corresponding path program 68 times [2019-09-03 19:51:22,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:22,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 19:51:23,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:23,033 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-03 19:51:23,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:23,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:23,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:23,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 19:51:23,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:23,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 19:51:23,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:23,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 42 [2019-09-03 19:51:23,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:51:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:51:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:51:23,249 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 42 states. [2019-09-03 19:51:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:23,665 INFO L93 Difference]: Finished difference Result 301 states and 303 transitions. [2019-09-03 19:51:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:51:23,666 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 285 [2019-09-03 19:51:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:23,668 INFO L225 Difference]: With dead ends: 301 [2019-09-03 19:51:23,668 INFO L226 Difference]: Without dead ends: 299 [2019-09-03 19:51:23,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:51:23,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-03 19:51:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2019-09-03 19:51:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-03 19:51:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2019-09-03 19:51:23,683 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 285 [2019-09-03 19:51:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:23,683 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2019-09-03 19:51:23,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:51:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2019-09-03 19:51:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-03 19:51:23,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:23,685 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:23,686 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash 53852986, now seen corresponding path program 69 times [2019-09-03 19:51:23,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:23,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:23,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 1925 proven. 630 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 19:51:25,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:25,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 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-03 19:51:25,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:25,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-03 19:51:25,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:25,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 19:51:25,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 1925 proven. 630 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 19:51:25,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:25,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-03 19:51:25,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 19:51:25,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 19:51:25,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:51:25,458 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 75 states. [2019-09-03 19:51:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:27,956 INFO L93 Difference]: Finished difference Result 412 states and 449 transitions. [2019-09-03 19:51:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 19:51:27,957 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 292 [2019-09-03 19:51:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:27,958 INFO L225 Difference]: With dead ends: 412 [2019-09-03 19:51:27,958 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 19:51:27,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2887, Invalid=9545, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 19:51:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 19:51:27,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-03 19:51:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 19:51:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2019-09-03 19:51:27,972 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 292 [2019-09-03 19:51:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:27,973 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2019-09-03 19:51:27,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 19:51:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2019-09-03 19:51:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-03 19:51:27,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:27,975 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:27,975 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1140296907, now seen corresponding path program 70 times [2019-09-03 19:51:27,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:27,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:27,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 736 proven. 1855 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 19:51:28,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:28,622 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-03 19:51:28,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:28,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:28,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:28,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 19:51:28,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:28,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 736 proven. 1855 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 19:51:28,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:28,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-09-03 19:51:28,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:51:28,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:51:28,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:51:28,857 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 43 states. [2019-09-03 19:51:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:29,318 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2019-09-03 19:51:29,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:51:29,319 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 293 [2019-09-03 19:51:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:29,321 INFO L225 Difference]: With dead ends: 309 [2019-09-03 19:51:29,321 INFO L226 Difference]: Without dead ends: 307 [2019-09-03 19:51:29,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:51:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-03 19:51:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2019-09-03 19:51:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-03 19:51:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2019-09-03 19:51:29,334 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 293 [2019-09-03 19:51:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:29,335 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2019-09-03 19:51:29,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:51:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2019-09-03 19:51:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-03 19:51:29,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:29,337 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:29,337 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:29,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1623063080, now seen corresponding path program 71 times [2019-09-03 19:51:29,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:29,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:29,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:29,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:29,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 19:51:30,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:30,978 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-03 19:51:30,991 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:31,107 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-03 19:51:31,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:31,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 19:51:31,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 19:51:31,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:31,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-03 19:51:31,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 19:51:31,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 19:51:31,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4369, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:51:31,195 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 77 states. [2019-09-03 19:51:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:33,927 INFO L93 Difference]: Finished difference Result 423 states and 461 transitions. [2019-09-03 19:51:33,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 19:51:33,942 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 300 [2019-09-03 19:51:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:33,944 INFO L225 Difference]: With dead ends: 423 [2019-09-03 19:51:33,944 INFO L226 Difference]: Without dead ends: 304 [2019-09-03 19:51:33,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3041, Invalid=10069, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 19:51:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-03 19:51:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-03 19:51:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-03 19:51:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 305 transitions. [2019-09-03 19:51:33,958 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 305 transitions. Word has length 300 [2019-09-03 19:51:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:33,959 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 305 transitions. [2019-09-03 19:51:33,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 19:51:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 305 transitions. [2019-09-03 19:51:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-03 19:51:33,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:33,961 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:33,961 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:33,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1751496297, now seen corresponding path program 72 times [2019-09-03 19:51:33,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:33,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:33,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:33,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:33,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 775 proven. 1962 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 19:51:34,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:34,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 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-03 19:51:34,675 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:34,809 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-03 19:51:34,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:34,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 19:51:34,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:34,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 775 proven. 1962 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 19:51:34,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:34,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 44 [2019-09-03 19:51:34,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:51:34,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:51:34,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:51:34,903 INFO L87 Difference]: Start difference. First operand 304 states and 305 transitions. Second operand 44 states. [2019-09-03 19:51:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:35,346 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2019-09-03 19:51:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:51:35,347 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 301 [2019-09-03 19:51:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:35,349 INFO L225 Difference]: With dead ends: 317 [2019-09-03 19:51:35,349 INFO L226 Difference]: Without dead ends: 315 [2019-09-03 19:51:35,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:51:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-03 19:51:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2019-09-03 19:51:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-03 19:51:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2019-09-03 19:51:35,360 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 301 [2019-09-03 19:51:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:35,360 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2019-09-03 19:51:35,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:51:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2019-09-03 19:51:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-03 19:51:35,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:35,362 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:35,363 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:35,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1883074170, now seen corresponding path program 73 times [2019-09-03 19:51:35,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:35,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:35,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 2146 proven. 703 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 19:51:37,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:37,159 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-03 19:51:37,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:37,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 19:51:37,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 2146 proven. 703 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 19:51:37,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:37,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-03 19:51:37,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 19:51:37,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 19:51:37,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1561, Invalid=4601, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:51:37,324 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 79 states. [2019-09-03 19:51:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:40,006 INFO L93 Difference]: Finished difference Result 434 states and 473 transitions. [2019-09-03 19:51:40,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:51:40,006 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 308 [2019-09-03 19:51:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:40,007 INFO L225 Difference]: With dead ends: 434 [2019-09-03 19:51:40,008 INFO L226 Difference]: Without dead ends: 312 [2019-09-03 19:51:40,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3199, Invalid=10607, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:51:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-03 19:51:40,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-09-03 19:51:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-03 19:51:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2019-09-03 19:51:40,020 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 308 [2019-09-03 19:51:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:40,020 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2019-09-03 19:51:40,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 19:51:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2019-09-03 19:51:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-03 19:51:40,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:40,022 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:40,022 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:40,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1836318219, now seen corresponding path program 74 times [2019-09-03 19:51:40,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:40,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:40,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:40,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:40,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 815 proven. 2072 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 19:51:40,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:40,732 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-03 19:51:40,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:40,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:40,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:40,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 19:51:40,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:40,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 815 proven. 2072 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 19:51:40,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:40,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-09-03 19:51:40,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:51:40,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:51:40,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:51:40,947 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 45 states. [2019-09-03 19:51:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:41,355 INFO L93 Difference]: Finished difference Result 325 states and 327 transitions. [2019-09-03 19:51:41,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:51:41,356 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 309 [2019-09-03 19:51:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:41,357 INFO L225 Difference]: With dead ends: 325 [2019-09-03 19:51:41,358 INFO L226 Difference]: Without dead ends: 323 [2019-09-03 19:51:41,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:51:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-03 19:51:41,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-09-03 19:51:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-03 19:51:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2019-09-03 19:51:41,369 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 309 [2019-09-03 19:51:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:41,370 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2019-09-03 19:51:41,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:51:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2019-09-03 19:51:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-03 19:51:41,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:41,372 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:41,372 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:41,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1868541080, now seen corresponding path program 75 times [2019-09-03 19:51:41,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:41,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:41,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:41,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:41,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2261 proven. 741 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 19:51:43,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:43,183 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-03 19:51:43,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:43,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-03 19:51:43,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:43,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 19:51:43,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2261 proven. 741 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 19:51:43,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:43,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-03 19:51:43,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 19:51:43,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 19:51:43,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1641, Invalid=4839, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:51:43,403 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 81 states. [2019-09-03 19:51:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:46,369 INFO L93 Difference]: Finished difference Result 445 states and 485 transitions. [2019-09-03 19:51:46,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 19:51:46,370 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 316 [2019-09-03 19:51:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:46,371 INFO L225 Difference]: With dead ends: 445 [2019-09-03 19:51:46,371 INFO L226 Difference]: Without dead ends: 320 [2019-09-03 19:51:46,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2261 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3361, Invalid=11159, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 19:51:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-03 19:51:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-03 19:51:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-03 19:51:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2019-09-03 19:51:46,389 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 316 [2019-09-03 19:51:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:46,390 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2019-09-03 19:51:46,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 19:51:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2019-09-03 19:51:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-03 19:51:46,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:46,392 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:46,392 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:46,393 INFO L82 PathProgramCache]: Analyzing trace with hash 190454569, now seen corresponding path program 76 times [2019-09-03 19:51:46,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:46,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:46,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:46,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 19:51:47,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:47,122 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-03 19:51:47,131 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:47,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:47,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:47,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 19:51:47,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:47,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 19:51:47,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:47,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 46 [2019-09-03 19:51:47,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:51:47,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:51:47,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:51:47,332 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 46 states. [2019-09-03 19:51:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:47,827 INFO L93 Difference]: Finished difference Result 333 states and 335 transitions. [2019-09-03 19:51:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:51:47,827 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 317 [2019-09-03 19:51:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:47,828 INFO L225 Difference]: With dead ends: 333 [2019-09-03 19:51:47,828 INFO L226 Difference]: Without dead ends: 331 [2019-09-03 19:51:47,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:51:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-03 19:51:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-09-03 19:51:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-03 19:51:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2019-09-03 19:51:47,840 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 317 [2019-09-03 19:51:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:47,840 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2019-09-03 19:51:47,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:51:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2019-09-03 19:51:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-03 19:51:47,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:47,842 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:47,842 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:47,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:47,842 INFO L82 PathProgramCache]: Analyzing trace with hash 825373114, now seen corresponding path program 77 times [2019-09-03 19:51:47,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:47,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:47,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:47,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:47,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2379 proven. 780 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 19:51:49,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:49,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 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-03 19:51:49,762 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:49,892 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-09-03 19:51:49,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:49,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 19:51:49,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2379 proven. 780 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 19:51:49,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:49,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-03 19:51:49,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 19:51:49,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 19:51:49,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:51:49,978 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 83 states. [2019-09-03 19:51:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:52,246 INFO L93 Difference]: Finished difference Result 456 states and 497 transitions. [2019-09-03 19:51:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:51:52,247 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 324 [2019-09-03 19:51:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:52,249 INFO L225 Difference]: With dead ends: 456 [2019-09-03 19:51:52,249 INFO L226 Difference]: Without dead ends: 328 [2019-09-03 19:51:52,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3527, Invalid=11725, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 19:51:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-03 19:51:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-09-03 19:51:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-03 19:51:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2019-09-03 19:51:52,268 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 324 [2019-09-03 19:51:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:52,268 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2019-09-03 19:51:52,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 19:51:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2019-09-03 19:51:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-03 19:51:52,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:52,270 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:52,270 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1784578229, now seen corresponding path program 78 times [2019-09-03 19:51:52,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:52,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:52,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 898 proven. 2301 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 19:51:53,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:53,076 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-03 19:51:53,086 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:53,234 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-09-03 19:51:53,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:53,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 19:51:53,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:53,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 898 proven. 2301 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 19:51:53,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:53,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-09-03 19:51:53,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:51:53,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:51:53,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:51:53,338 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 47 states. [2019-09-03 19:51:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:53,733 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2019-09-03 19:51:53,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:51:53,734 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 325 [2019-09-03 19:51:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:53,736 INFO L225 Difference]: With dead ends: 341 [2019-09-03 19:51:53,736 INFO L226 Difference]: Without dead ends: 339 [2019-09-03 19:51:53,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=919, Invalid=1337, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:51:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-03 19:51:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2019-09-03 19:51:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-03 19:51:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2019-09-03 19:51:53,749 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 325 [2019-09-03 19:51:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:53,750 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2019-09-03 19:51:53,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:51:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2019-09-03 19:51:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-03 19:51:53,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:53,752 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:53,752 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1703263400, now seen corresponding path program 79 times [2019-09-03 19:51:53,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:53,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:53,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:53,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:53,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 2500 proven. 820 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 19:51:55,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:55,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 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-03 19:51:55,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:55,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 19:51:55,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 2500 proven. 820 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 19:51:55,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:55,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-03 19:51:55,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 19:51:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 19:51:55,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1807, Invalid=5333, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:51:55,942 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 85 states. [2019-09-03 19:51:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:58,581 INFO L93 Difference]: Finished difference Result 467 states and 509 transitions. [2019-09-03 19:51:58,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 19:51:58,581 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 332 [2019-09-03 19:51:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:58,583 INFO L225 Difference]: With dead ends: 467 [2019-09-03 19:51:58,583 INFO L226 Difference]: Without dead ends: 336 [2019-09-03 19:51:58,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3697, Invalid=12305, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 19:51:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-03 19:51:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-09-03 19:51:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-03 19:51:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 337 transitions. [2019-09-03 19:51:58,594 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 337 transitions. Word has length 332 [2019-09-03 19:51:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:58,595 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 337 transitions. [2019-09-03 19:51:58,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 19:51:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 337 transitions. [2019-09-03 19:51:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-03 19:51:58,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:58,597 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:58,597 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1341165591, now seen corresponding path program 80 times [2019-09-03 19:51:58,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:58,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:58,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:58,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:58,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 941 proven. 2420 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 19:51:59,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51: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 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-03 19:51:59,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:59,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:59,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:59,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 19:51:59,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:59,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 941 proven. 2420 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 19:51:59,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:59,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 48 [2019-09-03 19:51:59,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:51:59,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:51:59,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:51:59,629 INFO L87 Difference]: Start difference. First operand 336 states and 337 transitions. Second operand 48 states. [2019-09-03 19:52:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:00,137 INFO L93 Difference]: Finished difference Result 349 states and 351 transitions. [2019-09-03 19:52:00,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:52:00,138 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 333 [2019-09-03 19:52:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:00,140 INFO L225 Difference]: With dead ends: 349 [2019-09-03 19:52:00,140 INFO L226 Difference]: Without dead ends: 347 [2019-09-03 19:52:00,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=962, Invalid=1390, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:52:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-03 19:52:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2019-09-03 19:52:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-03 19:52:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2019-09-03 19:52:00,153 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 333 [2019-09-03 19:52:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:00,153 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2019-09-03 19:52:00,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:52:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2019-09-03 19:52:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-03 19:52:00,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:00,155 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:00,155 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1837628166, now seen corresponding path program 81 times [2019-09-03 19:52:00,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:00,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:00,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:00,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:00,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 2624 proven. 861 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 19:52:02,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:02,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 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-03 19:52:02,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:02,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-03 19:52:02,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:02,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 19:52:02,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 2624 proven. 861 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 19:52:02,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:02,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-03 19:52:02,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 19:52:02,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 19:52:02,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=5589, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 19:52:02,479 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 87 states. [2019-09-03 19:52:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:04,921 INFO L93 Difference]: Finished difference Result 478 states and 521 transitions. [2019-09-03 19:52:04,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 19:52:04,922 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 340 [2019-09-03 19:52:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:04,923 INFO L225 Difference]: With dead ends: 478 [2019-09-03 19:52:04,923 INFO L226 Difference]: Without dead ends: 344 [2019-09-03 19:52:04,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3871, Invalid=12899, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 19:52:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-03 19:52:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-09-03 19:52:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-03 19:52:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 345 transitions. [2019-09-03 19:52:04,942 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 345 transitions. Word has length 340 [2019-09-03 19:52:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:04,942 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 345 transitions. [2019-09-03 19:52:04,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 19:52:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 345 transitions. [2019-09-03 19:52:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-03 19:52:04,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:04,944 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:04,944 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:04,945 INFO L82 PathProgramCache]: Analyzing trace with hash 14946443, now seen corresponding path program 82 times [2019-09-03 19:52:04,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:04,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:04,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:04,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:04,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 19:52:05,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:05,816 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-03 19:52:05,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:05,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:05,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:05,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 19:52:05,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:05,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 19:52:06,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:06,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-09-03 19:52:06,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:52:06,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:52:06,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:52:06,044 INFO L87 Difference]: Start difference. First operand 344 states and 345 transitions. Second operand 49 states. [2019-09-03 19:52:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:06,610 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2019-09-03 19:52:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:52:06,611 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 341 [2019-09-03 19:52:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:06,613 INFO L225 Difference]: With dead ends: 357 [2019-09-03 19:52:06,613 INFO L226 Difference]: Without dead ends: 355 [2019-09-03 19:52:06,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:52:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-03 19:52:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2019-09-03 19:52:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-03 19:52:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2019-09-03 19:52:06,625 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 341 [2019-09-03 19:52:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:06,626 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2019-09-03 19:52:06,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:52:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2019-09-03 19:52:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-03 19:52:06,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:06,627 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:06,627 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:06,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:06,628 INFO L82 PathProgramCache]: Analyzing trace with hash -475149800, now seen corresponding path program 83 times [2019-09-03 19:52:06,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:06,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:06,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:06,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:06,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 19:52:08,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:08,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 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-03 19:52:08,757 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:08,906 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-03 19:52:08,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:08,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 19:52:08,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 19:52:09,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:09,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-03 19:52:09,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 19:52:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 19:52:09,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1981, Invalid=5851, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 19:52:09,040 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 89 states. [2019-09-03 19:52:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:13,709 INFO L93 Difference]: Finished difference Result 489 states and 533 transitions. [2019-09-03 19:52:13,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:52:13,709 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 348 [2019-09-03 19:52:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:13,711 INFO L225 Difference]: With dead ends: 489 [2019-09-03 19:52:13,711 INFO L226 Difference]: Without dead ends: 352 [2019-09-03 19:52:13,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2751 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4049, Invalid=13507, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 19:52:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-03 19:52:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-09-03 19:52:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-03 19:52:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 353 transitions. [2019-09-03 19:52:13,732 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 353 transitions. Word has length 348 [2019-09-03 19:52:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:13,732 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 353 transitions. [2019-09-03 19:52:13,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 19:52:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 353 transitions. [2019-09-03 19:52:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-03 19:52:13,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:13,735 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:13,737 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:13,738 INFO L82 PathProgramCache]: Analyzing trace with hash 295810217, now seen corresponding path program 84 times [2019-09-03 19:52:13,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:13,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:13,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:13,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:13,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 1030 proven. 2667 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 19:52:14,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:14,591 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-03 19:52:14,600 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:14,798 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-03 19:52:14,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:14,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 19:52:14,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:14,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 1030 proven. 2667 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 19:52:14,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:14,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 50 [2019-09-03 19:52:14,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:52:14,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:52:14,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:52:14,914 INFO L87 Difference]: Start difference. First operand 352 states and 353 transitions. Second operand 50 states. [2019-09-03 19:52:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:15,456 INFO L93 Difference]: Finished difference Result 365 states and 367 transitions. [2019-09-03 19:52:15,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:52:15,457 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 349 [2019-09-03 19:52:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:15,460 INFO L225 Difference]: With dead ends: 365 [2019-09-03 19:52:15,460 INFO L226 Difference]: Without dead ends: 363 [2019-09-03 19:52:15,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:52:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-03 19:52:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2019-09-03 19:52:15,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-03 19:52:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2019-09-03 19:52:15,474 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 349 [2019-09-03 19:52:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:15,474 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2019-09-03 19:52:15,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:52:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2019-09-03 19:52:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-03 19:52:15,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:15,477 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:15,477 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:15,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:15,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1634920506, now seen corresponding path program 85 times [2019-09-03 19:52:15,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:15,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:15,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:15,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:15,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 2881 proven. 946 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 19:52:17,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:17,699 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-03 19:52:17,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:17,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 19:52:17,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 2881 proven. 946 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 19:52:17,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:17,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-03 19:52:17,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 19:52:17,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 19:52:17,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=6119, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:52:17,894 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 91 states. [2019-09-03 19:52:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:21,493 INFO L93 Difference]: Finished difference Result 500 states and 545 transitions. [2019-09-03 19:52:21,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 19:52:21,493 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 356 [2019-09-03 19:52:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:21,497 INFO L225 Difference]: With dead ends: 500 [2019-09-03 19:52:21,497 INFO L226 Difference]: Without dead ends: 360 [2019-09-03 19:52:21,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2881 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4231, Invalid=14129, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 19:52:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-03 19:52:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-09-03 19:52:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-03 19:52:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2019-09-03 19:52:21,518 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 356 [2019-09-03 19:52:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:21,518 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2019-09-03 19:52:21,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 19:52:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2019-09-03 19:52:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-03 19:52:21,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:21,520 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:21,521 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1956622795, now seen corresponding path program 86 times [2019-09-03 19:52:21,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:21,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:21,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 1076 proven. 2795 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 19:52:22,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:22,426 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-03 19:52:22,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:22,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:22,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:22,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 19:52:22,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:22,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 1076 proven. 2795 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 19:52:22,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:22,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-09-03 19:52:22,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:52:22,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:52:22,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:52:22,667 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 51 states. [2019-09-03 19:52:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:23,104 INFO L93 Difference]: Finished difference Result 373 states and 375 transitions. [2019-09-03 19:52:23,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:52:23,104 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 357 [2019-09-03 19:52:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:23,107 INFO L225 Difference]: With dead ends: 373 [2019-09-03 19:52:23,107 INFO L226 Difference]: Without dead ends: 371 [2019-09-03 19:52:23,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1097, Invalid=1555, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:52:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-03 19:52:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2019-09-03 19:52:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-03 19:52:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2019-09-03 19:52:23,120 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 357 [2019-09-03 19:52:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:23,121 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2019-09-03 19:52:23,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:52:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2019-09-03 19:52:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-03 19:52:23,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:23,122 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:23,122 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:23,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1830174936, now seen corresponding path program 87 times [2019-09-03 19:52:23,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:23,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:23,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7788 backedges. 3014 proven. 990 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 19:52:25,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:25,414 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-03 19:52:25,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:25,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-03 19:52:25,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:25,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 19:52:25,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7788 backedges. 3014 proven. 990 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 19:52:25,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:25,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-03 19:52:25,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 19:52:25,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 19:52:25,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2163, Invalid=6393, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:52:25,688 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 93 states. [2019-09-03 19:52:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:29,642 INFO L93 Difference]: Finished difference Result 511 states and 557 transitions. [2019-09-03 19:52:29,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 19:52:29,643 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 364 [2019-09-03 19:52:29,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:29,644 INFO L225 Difference]: With dead ends: 511 [2019-09-03 19:52:29,644 INFO L226 Difference]: Without dead ends: 368 [2019-09-03 19:52:29,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3014 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4417, Invalid=14765, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 19:52:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-03 19:52:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-09-03 19:52:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-03 19:52:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2019-09-03 19:52:29,662 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 364 [2019-09-03 19:52:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:29,662 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2019-09-03 19:52:29,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 19:52:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2019-09-03 19:52:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-03 19:52:29,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:29,665 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:29,665 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:29,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1244457321, now seen corresponding path program 88 times [2019-09-03 19:52:29,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:29,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:29,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:29,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 19:52:30,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:30,663 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-03 19:52:30,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:30,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:30,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:30,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 19:52:30,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:30,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 19:52:31,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:31,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 52 [2019-09-03 19:52:31,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:52:31,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:52:31,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:52:31,006 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 52 states. [2019-09-03 19:52:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:31,446 INFO L93 Difference]: Finished difference Result 381 states and 383 transitions. [2019-09-03 19:52:31,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:52:31,446 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 365 [2019-09-03 19:52:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:31,449 INFO L225 Difference]: With dead ends: 381 [2019-09-03 19:52:31,449 INFO L226 Difference]: Without dead ends: 379 [2019-09-03 19:52:31,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1144, Invalid=1612, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:52:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-03 19:52:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2019-09-03 19:52:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-03 19:52:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2019-09-03 19:52:31,469 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 365 [2019-09-03 19:52:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:31,469 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2019-09-03 19:52:31,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:52:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2019-09-03 19:52:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-03 19:52:31,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:31,472 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:31,472 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash 747035514, now seen corresponding path program 89 times [2019-09-03 19:52:31,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 3150 proven. 1035 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 19:52:34,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:34,181 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-03 19:52:34,191 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:34,353 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2019-09-03 19:52:34,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:34,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 19:52:34,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 3150 proven. 1035 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 19:52:34,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:34,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-03 19:52:34,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 19:52:34,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 19:52:34,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2257, Invalid=6673, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:52:34,446 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 95 states. [2019-09-03 19:52:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:37,437 INFO L93 Difference]: Finished difference Result 522 states and 569 transitions. [2019-09-03 19:52:37,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:52:37,438 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 372 [2019-09-03 19:52:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:37,439 INFO L225 Difference]: With dead ends: 522 [2019-09-03 19:52:37,439 INFO L226 Difference]: Without dead ends: 376 [2019-09-03 19:52:37,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4607, Invalid=15415, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 19:52:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-03 19:52:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-09-03 19:52:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-03 19:52:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2019-09-03 19:52:37,453 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 372 [2019-09-03 19:52:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:37,453 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 377 transitions. [2019-09-03 19:52:37,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 19:52:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 377 transitions. [2019-09-03 19:52:37,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-03 19:52:37,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:37,455 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:37,455 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:37,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2000184075, now seen corresponding path program 90 times [2019-09-03 19:52:37,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:37,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:37,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8191 backedges. 1171 proven. 3060 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 19:52:38,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:38,414 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-03 19:52:38,426 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:38,604 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-09-03 19:52:38,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:38,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:52:38,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:38,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8191 backedges. 1171 proven. 3060 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 19:52:38,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:38,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-09-03 19:52:38,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:52:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:52:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1570, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:52:38,735 INFO L87 Difference]: Start difference. First operand 376 states and 377 transitions. Second operand 53 states. [2019-09-03 19:52:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:39,288 INFO L93 Difference]: Finished difference Result 389 states and 391 transitions. [2019-09-03 19:52:39,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:52:39,289 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 373 [2019-09-03 19:52:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:39,291 INFO L225 Difference]: With dead ends: 389 [2019-09-03 19:52:39,291 INFO L226 Difference]: Without dead ends: 387 [2019-09-03 19:52:39,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1192, Invalid=1670, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:52:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-03 19:52:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-03 19:52:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-03 19:52:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2019-09-03 19:52:39,305 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 373 [2019-09-03 19:52:39,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:39,305 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2019-09-03 19:52:39,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:52:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2019-09-03 19:52:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-03 19:52:39,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:39,307 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:39,307 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:39,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2010097560, now seen corresponding path program 91 times [2019-09-03 19:52:39,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:39,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:39,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:39,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:39,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 3289 proven. 1081 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 19:52:41,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:41,826 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-03 19:52:41,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:41,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 19:52:41,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 3289 proven. 1081 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 19:52:42,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:42,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-03 19:52:42,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 19:52:42,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 19:52:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2353, Invalid=6959, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:52:42,043 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 97 states. [2019-09-03 19:52:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:45,539 INFO L93 Difference]: Finished difference Result 533 states and 581 transitions. [2019-09-03 19:52:45,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 19:52:45,539 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 380 [2019-09-03 19:52:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:45,541 INFO L225 Difference]: With dead ends: 533 [2019-09-03 19:52:45,541 INFO L226 Difference]: Without dead ends: 384 [2019-09-03 19:52:45,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4801, Invalid=16079, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 19:52:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-03 19:52:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-09-03 19:52:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-03 19:52:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2019-09-03 19:52:45,562 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 380 [2019-09-03 19:52:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:45,562 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2019-09-03 19:52:45,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 19:52:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2019-09-03 19:52:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-03 19:52:45,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:45,564 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:45,564 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1832055255, now seen corresponding path program 92 times [2019-09-03 19:52:45,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:45,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:45,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:45,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:45,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8557 backedges. 1220 proven. 3197 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 19:52:46,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:46,547 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-03 19:52:46,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:46,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:46,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:46,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 19:52:46,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8557 backedges. 1220 proven. 3197 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 19:52:46,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:46,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 54 [2019-09-03 19:52:46,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:52:46,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:52:46,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:52:46,820 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 54 states. [2019-09-03 19:52:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:47,432 INFO L93 Difference]: Finished difference Result 397 states and 399 transitions. [2019-09-03 19:52:47,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:52:47,432 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 381 [2019-09-03 19:52:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:47,435 INFO L225 Difference]: With dead ends: 397 [2019-09-03 19:52:47,435 INFO L226 Difference]: Without dead ends: 395 [2019-09-03 19:52:47,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:52:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-03 19:52:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-09-03 19:52:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-03 19:52:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2019-09-03 19:52:47,456 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 381 [2019-09-03 19:52:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:47,456 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2019-09-03 19:52:47,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:52:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2019-09-03 19:52:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-03 19:52:47,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:47,459 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:47,459 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:47,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:47,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2095587654, now seen corresponding path program 93 times [2019-09-03 19:52:47,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:47,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:47,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:47,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:47,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8883 backedges. 3431 proven. 1128 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 19:52:50,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:50,089 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-03 19:52:50,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:50,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-03 19:52:50,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:50,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:52:50,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8883 backedges. 3431 proven. 1128 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 19:52:50,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:50,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-03 19:52:50,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 19:52:50,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 19:52:50,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2451, Invalid=7251, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:52:50,438 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 99 states. [2019-09-03 19:52:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:53,578 INFO L93 Difference]: Finished difference Result 544 states and 593 transitions. [2019-09-03 19:52:53,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 19:52:53,579 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 388 [2019-09-03 19:52:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:53,581 INFO L225 Difference]: With dead ends: 544 [2019-09-03 19:52:53,582 INFO L226 Difference]: Without dead ends: 392 [2019-09-03 19:52:53,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4999, Invalid=16757, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 19:52:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-03 19:52:53,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2019-09-03 19:52:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-03 19:52:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2019-09-03 19:52:53,601 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 388 [2019-09-03 19:52:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:53,601 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2019-09-03 19:52:53,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 19:52:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2019-09-03 19:52:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-03 19:52:53,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:53,603 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:53,604 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:53,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1877859253, now seen corresponding path program 94 times [2019-09-03 19:52:53,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:53,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:53,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:53,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 1270 proven. 3337 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 19:52:54,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:54,716 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-03 19:52:54,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:54,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:54,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:54,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 19:52:54,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:54,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 1270 proven. 3337 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 19:52:55,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:55,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 55 [2019-09-03 19:52:55,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:52:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:52:55,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:52:55,010 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 55 states. [2019-09-03 19:52:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:55,601 INFO L93 Difference]: Finished difference Result 405 states and 407 transitions. [2019-09-03 19:52:55,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:52:55,602 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 389 [2019-09-03 19:52:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:55,604 INFO L225 Difference]: With dead ends: 405 [2019-09-03 19:52:55,604 INFO L226 Difference]: Without dead ends: 403 [2019-09-03 19:52:55,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:52:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-09-03 19:52:55,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2019-09-03 19:52:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-03 19:52:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2019-09-03 19:52:55,619 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 389 [2019-09-03 19:52:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:55,619 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2019-09-03 19:52:55,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:52:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2019-09-03 19:52:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-03 19:52:55,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:55,621 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:55,621 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:55,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:55,622 INFO L82 PathProgramCache]: Analyzing trace with hash 603323992, now seen corresponding path program 95 times [2019-09-03 19:52:55,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:55,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:55,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9264 backedges. 3576 proven. 1176 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 19:52:58,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:58,454 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-03 19:52:58,466 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:58,643 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2019-09-03 19:52:58,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:58,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 19:52:58,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9264 backedges. 3576 proven. 1176 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 19:52:58,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:58,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-03 19:52:58,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 19:52:58,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 19:52:58,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2551, Invalid=7549, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:52:58,734 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 101 states. [2019-09-03 19:53:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:03,079 INFO L93 Difference]: Finished difference Result 555 states and 605 transitions. [2019-09-03 19:53:03,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 19:53:03,079 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 396 [2019-09-03 19:53:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:03,081 INFO L225 Difference]: With dead ends: 555 [2019-09-03 19:53:03,082 INFO L226 Difference]: Without dead ends: 400 [2019-09-03 19:53:03,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3576 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5201, Invalid=17449, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 19:53:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-03 19:53:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2019-09-03 19:53:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-03 19:53:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2019-09-03 19:53:03,102 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 396 [2019-09-03 19:53:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:03,103 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2019-09-03 19:53:03,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 19:53:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2019-09-03 19:53:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-03 19:53:03,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:03,105 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:03,105 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:03,105 INFO L82 PathProgramCache]: Analyzing trace with hash 60695273, now seen corresponding path program 96 times [2019-09-03 19:53:03,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:03,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:03,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:03,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:03,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9313 backedges. 1321 proven. 3480 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 19:53:04,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:04,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 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-03 19:53:04,188 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:04,399 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-03 19:53:04,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:04,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 19:53:04,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:04,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9313 backedges. 1321 proven. 3480 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 19:53:04,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:04,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 56 [2019-09-03 19:53:04,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:53:04,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:53:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:53:04,534 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 56 states. [2019-09-03 19:53:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:05,120 INFO L93 Difference]: Finished difference Result 413 states and 415 transitions. [2019-09-03 19:53:05,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:53:05,120 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 397 [2019-09-03 19:53:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:05,122 INFO L225 Difference]: With dead ends: 413 [2019-09-03 19:53:05,123 INFO L226 Difference]: Without dead ends: 411 [2019-09-03 19:53:05,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:53:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-03 19:53:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2019-09-03 19:53:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-03 19:53:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2019-09-03 19:53:05,144 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 397 [2019-09-03 19:53:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:05,144 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2019-09-03 19:53:05,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:53:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2019-09-03 19:53:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-03 19:53:05,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:05,147 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:05,147 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash 898232826, now seen corresponding path program 97 times [2019-09-03 19:53:05,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:05,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:05,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 3724 proven. 1225 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 19:53:08,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:08,146 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-03 19:53:08,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:08,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 19:53:08,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 3724 proven. 1225 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 19:53:08,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:08,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2019-09-03 19:53:08,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 19:53:08,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 19:53:08,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 19:53:08,382 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 103 states. [2019-09-03 19:53:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:12,940 INFO L93 Difference]: Finished difference Result 566 states and 617 transitions. [2019-09-03 19:53:12,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 19:53:12,941 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 404 [2019-09-03 19:53:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:12,942 INFO L225 Difference]: With dead ends: 566 [2019-09-03 19:53:12,943 INFO L226 Difference]: Without dead ends: 408 [2019-09-03 19:53:12,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5407, Invalid=18155, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 19:53:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-03 19:53:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-09-03 19:53:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-03 19:53:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2019-09-03 19:53:12,962 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 404 [2019-09-03 19:53:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:12,962 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2019-09-03 19:53:12,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 19:53:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2019-09-03 19:53:12,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-03 19:53:12,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:12,964 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:12,964 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2020543093, now seen corresponding path program 98 times [2019-09-03 19:53:12,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:12,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:12,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:12,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:12,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 1373 proven. 3626 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 19:53:14,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:14,239 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-03 19:53:14,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:14,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:14,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:14,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 19:53:14,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:14,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 1373 proven. 3626 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 19:53:14,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:14,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-09-03 19:53:14,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:53:14,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:53:14,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=1804, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:53:14,539 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 57 states. [2019-09-03 19:53:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:15,101 INFO L93 Difference]: Finished difference Result 421 states and 423 transitions. [2019-09-03 19:53:15,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:53:15,102 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 405 [2019-09-03 19:53:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:15,105 INFO L225 Difference]: With dead ends: 421 [2019-09-03 19:53:15,105 INFO L226 Difference]: Without dead ends: 419 [2019-09-03 19:53:15,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1394, Invalid=1912, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:53:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-03 19:53:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2019-09-03 19:53:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-03 19:53:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2019-09-03 19:53:15,121 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 405 [2019-09-03 19:53:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:15,121 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2019-09-03 19:53:15,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:53:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2019-09-03 19:53:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-03 19:53:15,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:15,124 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:15,124 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:15,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash 816137496, now seen corresponding path program 99 times [2019-09-03 19:53:15,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:15,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:15,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 3875 proven. 1275 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 19:53:18,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:18,158 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-03 19:53:18,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:18,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-09-03 19:53:18,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:18,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 19:53:18,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 3875 proven. 1275 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 19:53:18,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:18,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2019-09-03 19:53:18,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 19:53:18,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 19:53:18,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2757, Invalid=8163, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 19:53:18,518 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 105 states. [2019-09-03 19:53:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:23,342 INFO L93 Difference]: Finished difference Result 577 states and 629 transitions. [2019-09-03 19:53:23,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 19:53:23,343 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 412 [2019-09-03 19:53:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:23,346 INFO L225 Difference]: With dead ends: 577 [2019-09-03 19:53:23,347 INFO L226 Difference]: Without dead ends: 416 [2019-09-03 19:53:23,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3875 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5617, Invalid=18875, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 19:53:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-03 19:53:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-09-03 19:53:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-03 19:53:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 417 transitions. [2019-09-03 19:53:23,366 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 417 transitions. Word has length 412 [2019-09-03 19:53:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:23,366 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 417 transitions. [2019-09-03 19:53:23,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 19:53:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 417 transitions. [2019-09-03 19:53:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-03 19:53:23,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:23,368 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:23,368 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1404839849, now seen corresponding path program 100 times [2019-09-03 19:53:23,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:23,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:23,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:23,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:24,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10101 backedges. 1426 proven. 3775 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 19:53:24,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:24,515 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-03 19:53:24,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:24,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:24,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:24,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 19:53:24,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:24,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10101 backedges. 1426 proven. 3775 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 19:53:24,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:24,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 58 [2019-09-03 19:53:24,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:53:24,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:53:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:53:24,836 INFO L87 Difference]: Start difference. First operand 416 states and 417 transitions. Second operand 58 states. [2019-09-03 19:53:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:25,519 INFO L93 Difference]: Finished difference Result 429 states and 431 transitions. [2019-09-03 19:53:25,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:53:25,520 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 413 [2019-09-03 19:53:25,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:25,523 INFO L225 Difference]: With dead ends: 429 [2019-09-03 19:53:25,523 INFO L226 Difference]: Without dead ends: 427 [2019-09-03 19:53:25,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:53:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-03 19:53:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-09-03 19:53:25,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-03 19:53:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2019-09-03 19:53:25,546 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 413 [2019-09-03 19:53:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:25,547 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2019-09-03 19:53:25,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:53:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2019-09-03 19:53:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-03 19:53:25,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:25,550 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:25,550 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:25,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1790896838, now seen corresponding path program 101 times [2019-09-03 19:53:25,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:25,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:25,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:25,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:25,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10455 backedges. 4029 proven. 1326 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 19:53:28,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:28,604 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-03 19:53:28,616 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:28,815 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2019-09-03 19:53:28,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:28,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 19:53:28,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10455 backedges. 4029 proven. 1326 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 19:53:28,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:28,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2019-09-03 19:53:28,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-03 19:53:28,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-03 19:53:28,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2863, Invalid=8479, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 19:53:28,914 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 107 states. [2019-09-03 19:53:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:31,846 INFO L93 Difference]: Finished difference Result 588 states and 641 transitions. [2019-09-03 19:53:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 19:53:31,846 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 420 [2019-09-03 19:53:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:31,847 INFO L225 Difference]: With dead ends: 588 [2019-09-03 19:53:31,847 INFO L226 Difference]: Without dead ends: 424 [2019-09-03 19:53:31,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4029 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5831, Invalid=19609, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 19:53:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-03 19:53:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2019-09-03 19:53:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-03 19:53:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2019-09-03 19:53:31,870 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 420 [2019-09-03 19:53:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:31,870 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2019-09-03 19:53:31,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-03 19:53:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2019-09-03 19:53:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-03 19:53:31,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:31,872 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:31,872 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:31,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:31,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1491544373, now seen corresponding path program 102 times [2019-09-03 19:53:31,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:31,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:31,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:31,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:31,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 1480 proven. 3927 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 19:53:33,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:33,090 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-03 19:53:33,099 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:33,309 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2019-09-03 19:53:33,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:33,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 19:53:33,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:33,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 1480 proven. 3927 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 19:53:33,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:33,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-09-03 19:53:33,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:53:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:53:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:53:33,474 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 59 states. [2019-09-03 19:53:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:34,165 INFO L93 Difference]: Finished difference Result 437 states and 439 transitions. [2019-09-03 19:53:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 19:53:34,166 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 421 [2019-09-03 19:53:34,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:34,168 INFO L225 Difference]: With dead ends: 437 [2019-09-03 19:53:34,168 INFO L226 Difference]: Without dead ends: 435 [2019-09-03 19:53:34,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1501, Invalid=2039, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:53:34,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-03 19:53:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-09-03 19:53:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-03 19:53:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2019-09-03 19:53:34,186 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 421 [2019-09-03 19:53:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:34,187 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2019-09-03 19:53:34,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:53:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2019-09-03 19:53:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-03 19:53:34,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:34,189 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:34,189 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:34,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1141277736, now seen corresponding path program 103 times [2019-09-03 19:53:34,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:34,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:34,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:34,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:34,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10868 backedges. 4186 proven. 1378 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 19:53:37,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:37,448 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-03 19:53:37,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:37,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 19:53:37,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10868 backedges. 4186 proven. 1378 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 19:53:37,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:37,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2019-09-03 19:53:37,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 19:53:37,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 19:53:37,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2971, Invalid=8801, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 19:53:37,745 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 109 states. [2019-09-03 19:53:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:40,965 INFO L93 Difference]: Finished difference Result 599 states and 653 transitions. [2019-09-03 19:53:40,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 19:53:40,965 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 428 [2019-09-03 19:53:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:40,968 INFO L225 Difference]: With dead ends: 599 [2019-09-03 19:53:40,968 INFO L226 Difference]: Without dead ends: 432 [2019-09-03 19:53:40,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6049, Invalid=20357, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 19:53:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-03 19:53:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-09-03 19:53:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-03 19:53:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2019-09-03 19:53:40,986 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 428 [2019-09-03 19:53:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:40,986 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2019-09-03 19:53:40,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 19:53:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2019-09-03 19:53:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-03 19:53:40,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:40,988 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:40,988 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:40,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1723655063, now seen corresponding path program 104 times [2019-09-03 19:53:40,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:40,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:40,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:40,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:40,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10921 backedges. 1535 proven. 4082 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 19:53:42,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:42,232 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-03 19:53:42,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:42,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:42,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:42,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 19:53:42,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:42,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10921 backedges. 1535 proven. 4082 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 19:53:42,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:42,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 60 [2019-09-03 19:53:42,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:53:42,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:53:42,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:53:42,528 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 60 states. [2019-09-03 19:53:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:43,196 INFO L93 Difference]: Finished difference Result 445 states and 447 transitions. [2019-09-03 19:53:43,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:53:43,197 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 429 [2019-09-03 19:53:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:43,198 INFO L225 Difference]: With dead ends: 445 [2019-09-03 19:53:43,198 INFO L226 Difference]: Without dead ends: 443 [2019-09-03 19:53:43,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:53:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-03 19:53:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-03 19:53:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-03 19:53:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2019-09-03 19:53:43,214 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 429 [2019-09-03 19:53:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:43,214 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2019-09-03 19:53:43,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:53:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2019-09-03 19:53:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-03 19:53:43,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:43,216 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:43,216 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:43,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1264498566, now seen corresponding path program 105 times [2019-09-03 19:53:43,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:43,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:43,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:43,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 4346 proven. 1431 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 19:53:46,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:46,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 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-03 19:53:46,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:46,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-09-03 19:53:46,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:46,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 19:53:46,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 4346 proven. 1431 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 19:53:46,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:46,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2019-09-03 19:53:46,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 19:53:46,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 19:53:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=9129, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 19:53:46,918 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 111 states. [2019-09-03 19:53:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:52,251 INFO L93 Difference]: Finished difference Result 610 states and 665 transitions. [2019-09-03 19:53:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 19:53:52,256 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 436 [2019-09-03 19:53:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:52,258 INFO L225 Difference]: With dead ends: 610 [2019-09-03 19:53:52,258 INFO L226 Difference]: Without dead ends: 440 [2019-09-03 19:53:52,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6271, Invalid=21119, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 19:53:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-09-03 19:53:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2019-09-03 19:53:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-03 19:53:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 441 transitions. [2019-09-03 19:53:52,282 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 441 transitions. Word has length 436 [2019-09-03 19:53:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:52,283 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 441 transitions. [2019-09-03 19:53:52,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 19:53:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 441 transitions. [2019-09-03 19:53:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-03 19:53:52,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:52,285 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:52,285 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash -116537333, now seen corresponding path program 106 times [2019-09-03 19:53:52,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:52,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:52,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:52,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:52,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11343 backedges. 1591 proven. 4240 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 19:53:53,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:53,557 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-03 19:53:53,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:53,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:53,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:53,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 19:53:53,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:53,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11343 backedges. 1591 proven. 4240 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 19:53:53,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:53,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 61 [2019-09-03 19:53:53,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:53:53,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:53:53,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:53:53,865 INFO L87 Difference]: Start difference. First operand 440 states and 441 transitions. Second operand 61 states. [2019-09-03 19:53:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:54,481 INFO L93 Difference]: Finished difference Result 453 states and 455 transitions. [2019-09-03 19:53:54,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 19:53:54,481 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 437 [2019-09-03 19:53:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:54,483 INFO L225 Difference]: With dead ends: 453 [2019-09-03 19:53:54,483 INFO L226 Difference]: Without dead ends: 451 [2019-09-03 19:53:54,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1612, Invalid=2170, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:53:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-03 19:53:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2019-09-03 19:53:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-03 19:53:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2019-09-03 19:53:54,502 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 437 [2019-09-03 19:53:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:54,502 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2019-09-03 19:53:54,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:53:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2019-09-03 19:53:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-03 19:53:54,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:54,505 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:54,505 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:54,505 INFO L82 PathProgramCache]: Analyzing trace with hash 51290776, now seen corresponding path program 107 times [2019-09-03 19:53:54,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:54,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:54,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:54,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 4509 proven. 1485 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 19:53:57,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:57,987 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-03 19:53:57,997 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:58,216 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-09-03 19:53:58,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:58,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 19:53:58,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 4509 proven. 1485 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 19:53:58,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:58,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2019-09-03 19:53:58,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-03 19:53:58,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-03 19:53:58,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3193, Invalid=9463, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 19:53:58,325 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 113 states. [2019-09-03 19:54:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:03,768 INFO L93 Difference]: Finished difference Result 621 states and 677 transitions. [2019-09-03 19:54:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 19:54:03,768 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 444 [2019-09-03 19:54:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:03,769 INFO L225 Difference]: With dead ends: 621 [2019-09-03 19:54:03,769 INFO L226 Difference]: Without dead ends: 448 [2019-09-03 19:54:03,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4509 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6497, Invalid=21895, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 19:54:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-03 19:54:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-09-03 19:54:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-03 19:54:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 449 transitions. [2019-09-03 19:54:03,799 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 449 transitions. Word has length 444 [2019-09-03 19:54:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:03,800 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 449 transitions. [2019-09-03 19:54:03,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-03 19:54:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 449 transitions. [2019-09-03 19:54:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-03 19:54:03,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:03,802 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:03,803 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:03,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:03,803 INFO L82 PathProgramCache]: Analyzing trace with hash 156172585, now seen corresponding path program 108 times [2019-09-03 19:54:03,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:03,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:03,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:03,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:03,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11773 backedges. 1648 proven. 4401 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 19:54:05,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:05,197 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-03 19:54:05,206 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:05,432 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-03 19:54:05,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:05,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 19:54:05,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:05,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 11773 backedges. 1648 proven. 4401 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 19:54:05,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:05,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 62 [2019-09-03 19:54:05,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:54:05,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:54:05,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:54:05,617 INFO L87 Difference]: Start difference. First operand 448 states and 449 transitions. Second operand 62 states. [2019-09-03 19:54:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:06,275 INFO L93 Difference]: Finished difference Result 461 states and 463 transitions. [2019-09-03 19:54:06,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 19:54:06,275 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 445 [2019-09-03 19:54:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:06,278 INFO L225 Difference]: With dead ends: 461 [2019-09-03 19:54:06,278 INFO L226 Difference]: Without dead ends: 459 [2019-09-03 19:54:06,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:54:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-03 19:54:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2019-09-03 19:54:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-03 19:54:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2019-09-03 19:54:06,296 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 445 [2019-09-03 19:54:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:06,297 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2019-09-03 19:54:06,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:54:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2019-09-03 19:54:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-03 19:54:06,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:06,299 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:06,299 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:06,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1492218950, now seen corresponding path program 109 times [2019-09-03 19:54:06,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:06,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:06,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12155 backedges. 4675 proven. 1540 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 19:54:09,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:09,906 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-03 19:54:09,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:10,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 19:54:10,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12155 backedges. 4675 proven. 1540 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 19:54:10,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:10,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2019-09-03 19:54:10,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 19:54:10,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 19:54:10,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3307, Invalid=9803, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 19:54:10,186 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 115 states. [2019-09-03 19:54:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:15,967 INFO L93 Difference]: Finished difference Result 632 states and 689 transitions. [2019-09-03 19:54:15,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-03 19:54:15,968 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 452 [2019-09-03 19:54:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:15,969 INFO L225 Difference]: With dead ends: 632 [2019-09-03 19:54:15,969 INFO L226 Difference]: Without dead ends: 456 [2019-09-03 19:54:15,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4675 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6727, Invalid=22685, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 19:54:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-03 19:54:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-09-03 19:54:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-03 19:54:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 457 transitions. [2019-09-03 19:54:15,986 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 457 transitions. Word has length 452 [2019-09-03 19:54:15,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:15,986 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 457 transitions. [2019-09-03 19:54:15,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 19:54:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 457 transitions. [2019-09-03 19:54:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-03 19:54:15,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:15,988 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:15,989 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:15,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1999386293, now seen corresponding path program 110 times [2019-09-03 19:54:15,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:15,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:15,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:15,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:15,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12211 backedges. 1706 proven. 4565 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 19:54:17,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:17,447 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-03 19:54:17,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:17,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:17,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:17,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 19:54:17,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:17,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12211 backedges. 1706 proven. 4565 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 19:54:17,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:17,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 63 [2019-09-03 19:54:17,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:54:17,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:54:17,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=2185, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:54:17,882 INFO L87 Difference]: Start difference. First operand 456 states and 457 transitions. Second operand 63 states. [2019-09-03 19:54:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:18,640 INFO L93 Difference]: Finished difference Result 469 states and 471 transitions. [2019-09-03 19:54:18,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 19:54:18,640 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 453 [2019-09-03 19:54:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:18,642 INFO L225 Difference]: With dead ends: 469 [2019-09-03 19:54:18,642 INFO L226 Difference]: Without dead ends: 467 [2019-09-03 19:54:18,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1727, Invalid=2305, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:54:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-03 19:54:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2019-09-03 19:54:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-03 19:54:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2019-09-03 19:54:18,659 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 453 [2019-09-03 19:54:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:18,659 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2019-09-03 19:54:18,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:54:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2019-09-03 19:54:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-09-03 19:54:18,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:18,661 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:18,661 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:18,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash 570472792, now seen corresponding path program 111 times [2019-09-03 19:54:18,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:18,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:18,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:18,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4844 proven. 1596 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 19:54:22,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:22,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 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-03 19:54:22,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:22,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-09-03 19:54:22,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:22,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 19:54:22,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4844 proven. 1596 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 19:54:22,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:22,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2019-09-03 19:54:22,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-03 19:54:22,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-03 19:54:22,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3423, Invalid=10149, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:54:22,760 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 117 states. [2019-09-03 19:54:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:28,546 INFO L93 Difference]: Finished difference Result 643 states and 701 transitions. [2019-09-03 19:54:28,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-03 19:54:28,547 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 460 [2019-09-03 19:54:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:28,548 INFO L225 Difference]: With dead ends: 643 [2019-09-03 19:54:28,548 INFO L226 Difference]: Without dead ends: 464 [2019-09-03 19:54:28,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4844 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6961, Invalid=23489, Unknown=0, NotChecked=0, Total=30450 [2019-09-03 19:54:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-03 19:54:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-09-03 19:54:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-03 19:54:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2019-09-03 19:54:28,572 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 460 [2019-09-03 19:54:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:28,572 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2019-09-03 19:54:28,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-03 19:54:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2019-09-03 19:54:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-09-03 19:54:28,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:28,575 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:28,576 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:28,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:28,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1208232471, now seen corresponding path program 112 times [2019-09-03 19:54:28,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:28,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:28,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:28,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:28,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12657 backedges. 1765 proven. 4732 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 19:54:30,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:30,001 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-03 19:54:30,010 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:30,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:30,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:30,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 19:54:30,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:30,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12657 backedges. 1765 proven. 4732 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 19:54:30,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:30,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 64 [2019-09-03 19:54:30,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:54:30,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:54:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:54:30,335 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 64 states. [2019-09-03 19:54:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:31,131 INFO L93 Difference]: Finished difference Result 477 states and 479 transitions. [2019-09-03 19:54:31,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:54:31,132 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 461 [2019-09-03 19:54:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:31,133 INFO L225 Difference]: With dead ends: 477 [2019-09-03 19:54:31,134 INFO L226 Difference]: Without dead ends: 475 [2019-09-03 19:54:31,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1786, Invalid=2374, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:54:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-03 19:54:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-09-03 19:54:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-09-03 19:54:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2019-09-03 19:54:31,151 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 461 [2019-09-03 19:54:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:31,151 INFO L475 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2019-09-03 19:54:31,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 19:54:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2019-09-03 19:54:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-03 19:54:31,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:31,153 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:31,153 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:31,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:31,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1058218246, now seen corresponding path program 113 times [2019-09-03 19:54:31,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:31,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:31,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:31,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:31,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 5016 proven. 1653 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 19:54:34,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:34,984 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-03 19:54:34,995 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:35,225 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2019-09-03 19:54:35,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:35,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 19:54:35,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 5016 proven. 1653 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 19:54:35,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:35,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2019-09-03 19:54:35,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-03 19:54:35,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-03 19:54:35,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3541, Invalid=10501, Unknown=0, NotChecked=0, Total=14042 [2019-09-03 19:54:35,348 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 119 states. [2019-09-03 19:54:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:41,390 INFO L93 Difference]: Finished difference Result 654 states and 713 transitions. [2019-09-03 19:54:41,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 19:54:41,390 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 468 [2019-09-03 19:54:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:41,392 INFO L225 Difference]: With dead ends: 654 [2019-09-03 19:54:41,392 INFO L226 Difference]: Without dead ends: 472 [2019-09-03 19:54:41,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7199, Invalid=24307, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 19:54:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-03 19:54:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-09-03 19:54:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-03 19:54:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2019-09-03 19:54:41,409 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 468 [2019-09-03 19:54:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:41,410 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2019-09-03 19:54:41,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-03 19:54:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2019-09-03 19:54:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-03 19:54:41,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:41,412 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:41,412 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:41,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1563501941, now seen corresponding path program 114 times [2019-09-03 19:54:41,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:41,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:41,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:41,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:41,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 13111 backedges. 1825 proven. 4902 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 19:54:42,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:42,872 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-03 19:54:42,882 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:43,130 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2019-09-03 19:54:43,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:43,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 19:54:43,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:43,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13111 backedges. 1825 proven. 4902 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 19:54:43,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:43,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 65 [2019-09-03 19:54:43,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:54:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:54:43,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=2320, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:54:43,304 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand 65 states. [2019-09-03 19:54:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:43,985 INFO L93 Difference]: Finished difference Result 485 states and 487 transitions. [2019-09-03 19:54:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:54:43,986 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 469 [2019-09-03 19:54:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:43,988 INFO L225 Difference]: With dead ends: 485 [2019-09-03 19:54:43,988 INFO L226 Difference]: Without dead ends: 483 [2019-09-03 19:54:43,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1846, Invalid=2444, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:54:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-03 19:54:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2019-09-03 19:54:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-03 19:54:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2019-09-03 19:54:44,011 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 469 [2019-09-03 19:54:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:44,012 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2019-09-03 19:54:44,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:54:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2019-09-03 19:54:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-03 19:54:44,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:44,014 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:44,015 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash -739524584, now seen corresponding path program 115 times [2019-09-03 19:54:44,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:44,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:44,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:44,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:44,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13514 backedges. 5191 proven. 1711 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 19:54:48,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:48,008 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-03 19:54:48,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 19:54:48,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 13514 backedges. 5191 proven. 1711 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 19:54:48,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:48,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2019-09-03 19:54:48,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-03 19:54:48,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-03 19:54:48,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3661, Invalid=10859, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 19:54:48,290 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 121 states. [2019-09-03 19:54:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:54,683 INFO L93 Difference]: Finished difference Result 665 states and 725 transitions. [2019-09-03 19:54:54,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-03 19:54:54,683 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 476 [2019-09-03 19:54:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:54,684 INFO L225 Difference]: With dead ends: 665 [2019-09-03 19:54:54,684 INFO L226 Difference]: Without dead ends: 480 [2019-09-03 19:54:54,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5191 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7441, Invalid=25139, Unknown=0, NotChecked=0, Total=32580 [2019-09-03 19:54:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-03 19:54:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-09-03 19:54:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-03 19:54:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 481 transitions. [2019-09-03 19:54:54,704 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 481 transitions. Word has length 476 [2019-09-03 19:54:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:54,704 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 481 transitions. [2019-09-03 19:54:54,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-03 19:54:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 481 transitions. [2019-09-03 19:54:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-03 19:54:54,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:54,706 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:54,706 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1483053737, now seen corresponding path program 116 times [2019-09-03 19:54:54,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:54,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:54,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 13573 backedges. 1886 proven. 5075 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 19:54:56,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:56,217 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-03 19:54:56,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:56,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:56,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:56,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 19:54:56,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:56,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13573 backedges. 1886 proven. 5075 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 19:54:56,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:56,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 66 [2019-09-03 19:54:56,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:54:56,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:54:56,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:54:56,578 INFO L87 Difference]: Start difference. First operand 480 states and 481 transitions. Second operand 66 states. [2019-09-03 19:54:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:57,204 INFO L93 Difference]: Finished difference Result 493 states and 495 transitions. [2019-09-03 19:54:57,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:54:57,204 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 477 [2019-09-03 19:54:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:57,206 INFO L225 Difference]: With dead ends: 493 [2019-09-03 19:54:57,206 INFO L226 Difference]: Without dead ends: 491 [2019-09-03 19:54:57,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:54:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-03 19:54:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2019-09-03 19:54:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-03 19:54:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2019-09-03 19:54:57,226 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 477 [2019-09-03 19:54:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:57,226 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2019-09-03 19:54:57,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:54:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2019-09-03 19:54:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-03 19:54:57,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:57,228 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:57,228 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:57,229 INFO L82 PathProgramCache]: Analyzing trace with hash -677363142, now seen corresponding path program 117 times [2019-09-03 19:54:57,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:57,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:57,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:57,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:57,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13983 backedges. 5369 proven. 1770 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 19:55:01,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:01,300 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-03 19:55:01,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:01,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-09-03 19:55:01,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:01,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 19:55:01,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13983 backedges. 5369 proven. 1770 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 19:55:01,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:01,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2019-09-03 19:55:01,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-03 19:55:01,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-03 19:55:01,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3783, Invalid=11223, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 19:55:01,744 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 123 states. [2019-09-03 19:55:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:08,484 INFO L93 Difference]: Finished difference Result 676 states and 737 transitions. [2019-09-03 19:55:08,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-03 19:55:08,484 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 484 [2019-09-03 19:55:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:08,485 INFO L225 Difference]: With dead ends: 676 [2019-09-03 19:55:08,485 INFO L226 Difference]: Without dead ends: 488 [2019-09-03 19:55:08,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5369 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7687, Invalid=25985, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 19:55:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-03 19:55:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-09-03 19:55:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-03 19:55:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 489 transitions. [2019-09-03 19:55:08,505 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 489 transitions. Word has length 484 [2019-09-03 19:55:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:08,505 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 489 transitions. [2019-09-03 19:55:08,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-03 19:55:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 489 transitions. [2019-09-03 19:55:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-03 19:55:08,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:08,507 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:08,508 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:08,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:08,508 INFO L82 PathProgramCache]: Analyzing trace with hash 342031307, now seen corresponding path program 118 times [2019-09-03 19:55:08,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:08,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:08,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:08,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:08,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14043 backedges. 1948 proven. 5251 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 19:55:10,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:10,049 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-03 19:55:10,059 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:10,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:10,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:10,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 19:55:10,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:10,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14043 backedges. 1948 proven. 5251 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 19:55:10,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:10,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 67 [2019-09-03 19:55:10,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 19:55:10,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 19:55:10,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=2459, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:55:10,402 INFO L87 Difference]: Start difference. First operand 488 states and 489 transitions. Second operand 67 states. [2019-09-03 19:55:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:11,253 INFO L93 Difference]: Finished difference Result 501 states and 503 transitions. [2019-09-03 19:55:11,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 19:55:11,253 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 485 [2019-09-03 19:55:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:11,255 INFO L225 Difference]: With dead ends: 501 [2019-09-03 19:55:11,255 INFO L226 Difference]: Without dead ends: 499 [2019-09-03 19:55:11,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1969, Invalid=2587, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:55:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-03 19:55:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2019-09-03 19:55:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-03 19:55:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2019-09-03 19:55:11,284 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 485 [2019-09-03 19:55:11,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:11,284 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2019-09-03 19:55:11,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 19:55:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2019-09-03 19:55:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-03 19:55:11,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:11,287 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:11,288 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:11,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:11,288 INFO L82 PathProgramCache]: Analyzing trace with hash 854308568, now seen corresponding path program 119 times [2019-09-03 19:55:11,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:11,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:11,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:11,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:11,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 14460 backedges. 5550 proven. 1830 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 19:55:15,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:15,510 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-03 19:55:15,520 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:15,946 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-09-03 19:55:15,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:15,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 19:55:15,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14460 backedges. 5550 proven. 1830 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 19:55:16,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:16,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2019-09-03 19:55:16,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-03 19:55:16,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-03 19:55:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3907, Invalid=11593, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 19:55:16,121 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 125 states. [2019-09-03 19:55:20,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:20,598 INFO L93 Difference]: Finished difference Result 687 states and 749 transitions. [2019-09-03 19:55:20,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 19:55:20,598 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 492 [2019-09-03 19:55:20,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:20,600 INFO L225 Difference]: With dead ends: 687 [2019-09-03 19:55:20,600 INFO L226 Difference]: Without dead ends: 496 [2019-09-03 19:55:20,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5550 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7937, Invalid=26845, Unknown=0, NotChecked=0, Total=34782 [2019-09-03 19:55:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-03 19:55:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2019-09-03 19:55:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-03 19:55:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 497 transitions. [2019-09-03 19:55:20,619 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 497 transitions. Word has length 492 [2019-09-03 19:55:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:20,620 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 497 transitions. [2019-09-03 19:55:20,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-03 19:55:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 497 transitions. [2019-09-03 19:55:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-03 19:55:20,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:20,622 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:20,622 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:20,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:20,622 INFO L82 PathProgramCache]: Analyzing trace with hash -56078487, now seen corresponding path program 120 times [2019-09-03 19:55:20,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:20,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:20,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 14521 backedges. 2011 proven. 5430 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 19:55:22,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:22,231 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-03 19:55:22,240 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:22,506 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-03 19:55:22,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:22,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 19:55:22,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:22,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14521 backedges. 2011 proven. 5430 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 19:55:22,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:22,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 68 [2019-09-03 19:55:22,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:55:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:55:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:55:22,699 INFO L87 Difference]: Start difference. First operand 496 states and 497 transitions. Second operand 68 states. [2019-09-03 19:55:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:23,492 INFO L93 Difference]: Finished difference Result 509 states and 511 transitions. [2019-09-03 19:55:23,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:55:23,492 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 493 [2019-09-03 19:55:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:23,494 INFO L225 Difference]: With dead ends: 509 [2019-09-03 19:55:23,494 INFO L226 Difference]: Without dead ends: 507 [2019-09-03 19:55:23,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:55:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-03 19:55:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2019-09-03 19:55:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-03 19:55:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2019-09-03 19:55:23,516 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 493 [2019-09-03 19:55:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:23,517 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2019-09-03 19:55:23,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:55:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2019-09-03 19:55:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-03 19:55:23,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:23,519 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:23,519 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2121484934, now seen corresponding path program 121 times [2019-09-03 19:55:23,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:23,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:23,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 14945 backedges. 5734 proven. 1891 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 19:55:27,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:27,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 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-03 19:55:27,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:27,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 19:55:27,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14945 backedges. 5734 proven. 1891 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 19:55:28,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:28,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2019-09-03 19:55:28,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-03 19:55:28,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-03 19:55:28,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4033, Invalid=11969, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 19:55:28,111 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 127 states. [2019-09-03 19:55:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:33,571 INFO L93 Difference]: Finished difference Result 698 states and 761 transitions. [2019-09-03 19:55:33,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-03 19:55:33,571 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 500 [2019-09-03 19:55:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:33,573 INFO L225 Difference]: With dead ends: 698 [2019-09-03 19:55:33,573 INFO L226 Difference]: Without dead ends: 504 [2019-09-03 19:55:33,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8191, Invalid=27719, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 19:55:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-03 19:55:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-03 19:55:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-03 19:55:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2019-09-03 19:55:33,606 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 500 [2019-09-03 19:55:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:33,606 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2019-09-03 19:55:33,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-03 19:55:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2019-09-03 19:55:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-03 19:55:33,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:33,609 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:33,609 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1811164427, now seen corresponding path program 122 times [2019-09-03 19:55:33,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:33,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:33,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:33,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:33,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15007 backedges. 2075 proven. 5612 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 19:55:35,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:35,312 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-03 19:55:35,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:35,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:35,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:35,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 19:55:35,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15007 backedges. 2075 proven. 5612 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 19:55:35,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:35,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 69 [2019-09-03 19:55:35,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 19:55:35,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 19:55:35,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2090, Invalid=2602, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:55:35,691 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 69 states. [2019-09-03 19:55:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:36,547 INFO L93 Difference]: Finished difference Result 517 states and 519 transitions. [2019-09-03 19:55:36,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 19:55:36,547 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 501 [2019-09-03 19:55:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:36,549 INFO L225 Difference]: With dead ends: 517 [2019-09-03 19:55:36,549 INFO L226 Difference]: Without dead ends: 515 [2019-09-03 19:55:36,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2096, Invalid=2734, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:55:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-03 19:55:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2019-09-03 19:55:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-03 19:55:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2019-09-03 19:55:36,572 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 501 [2019-09-03 19:55:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:36,572 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2019-09-03 19:55:36,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 19:55:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2019-09-03 19:55:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-03 19:55:36,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:36,574 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:36,575 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2015141272, now seen corresponding path program 123 times [2019-09-03 19:55:36,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:36,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:36,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:36,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:36,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 15438 backedges. 5921 proven. 1953 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 19:55:41,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:41,219 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-03 19:55:41,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:41,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-09-03 19:55:41,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:41,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 19:55:41,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15438 backedges. 5921 proven. 1953 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 19:55:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:41,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2019-09-03 19:55:41,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-03 19:55:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-03 19:55:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4161, Invalid=12351, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 19:55:41,699 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 129 states. [2019-09-03 19:55:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:45,806 INFO L93 Difference]: Finished difference Result 709 states and 773 transitions. [2019-09-03 19:55:45,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 19:55:45,807 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 508 [2019-09-03 19:55:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:45,808 INFO L225 Difference]: With dead ends: 709 [2019-09-03 19:55:45,808 INFO L226 Difference]: Without dead ends: 512 [2019-09-03 19:55:45,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5921 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8449, Invalid=28607, Unknown=0, NotChecked=0, Total=37056 [2019-09-03 19:55:45,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-03 19:55:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-09-03 19:55:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-03 19:55:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 513 transitions. [2019-09-03 19:55:45,839 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 513 transitions. Word has length 508 [2019-09-03 19:55:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:45,840 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 513 transitions. [2019-09-03 19:55:45,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-03 19:55:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 513 transitions. [2019-09-03 19:55:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-03 19:55:45,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:45,843 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:45,843 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash -706743255, now seen corresponding path program 124 times [2019-09-03 19:55:45,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:45,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:45,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:45,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:45,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15501 backedges. 2140 proven. 5797 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 19:55:47,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:47,643 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-03 19:55:47,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:47,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:47,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:47,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 19:55:47,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:47,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15501 backedges. 2140 proven. 5797 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 19:55:48,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:48,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 70 [2019-09-03 19:55:48,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 19:55:48,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 19:55:48,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:55:48,020 INFO L87 Difference]: Start difference. First operand 512 states and 513 transitions. Second operand 70 states. [2019-09-03 19:55:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:48,886 INFO L93 Difference]: Finished difference Result 525 states and 527 transitions. [2019-09-03 19:55:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:55:48,887 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 509 [2019-09-03 19:55:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:48,889 INFO L225 Difference]: With dead ends: 525 [2019-09-03 19:55:48,889 INFO L226 Difference]: Without dead ends: 523 [2019-09-03 19:55:48,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2161, Invalid=2809, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:55:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-09-03 19:55:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2019-09-03 19:55:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-03 19:55:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2019-09-03 19:55:48,921 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 509 [2019-09-03 19:55:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:48,921 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2019-09-03 19:55:48,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 19:55:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2019-09-03 19:55:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-09-03 19:55:48,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:48,925 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:48,925 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:48,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1444296890, now seen corresponding path program 125 times [2019-09-03 19:55:48,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:48,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:48,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:48,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:48,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 15939 backedges. 6111 proven. 2016 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 19:55:53,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:53,541 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-03 19:55:53,551 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:53,814 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 64 check-sat command(s) [2019-09-03 19:55:53,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:53,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 19:55:53,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15939 backedges. 6111 proven. 2016 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 19:55:53,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:53,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2019-09-03 19:55:53,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-03 19:55:53,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-03 19:55:53,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4291, Invalid=12739, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 19:55:53,956 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 131 states. [2019-09-03 19:55:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:59,599 INFO L93 Difference]: Finished difference Result 720 states and 785 transitions. [2019-09-03 19:55:59,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 19:55:59,600 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 516 [2019-09-03 19:55:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:59,601 INFO L225 Difference]: With dead ends: 720 [2019-09-03 19:55:59,601 INFO L226 Difference]: Without dead ends: 520 [2019-09-03 19:55:59,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6111 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8711, Invalid=29509, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 19:55:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-03 19:55:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2019-09-03 19:55:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-03 19:55:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 521 transitions. [2019-09-03 19:55:59,638 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 521 transitions. Word has length 516 [2019-09-03 19:55:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:59,639 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 521 transitions. [2019-09-03 19:55:59,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-03 19:55:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 521 transitions. [2019-09-03 19:55:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-09-03 19:55:59,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:59,642 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:59,643 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:59,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:59,643 INFO L82 PathProgramCache]: Analyzing trace with hash 954625611, now seen corresponding path program 126 times [2019-09-03 19:55:59,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:59,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:59,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:59,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:59,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2206 proven. 5985 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 19:56:01,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:01,436 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-03 19:56:01,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:01,741 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2019-09-03 19:56:01,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:01,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-03 19:56:01,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:01,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2232 proven. 6145 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2019-09-03 19:56:02,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:02,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 71] total 72 [2019-09-03 19:56:02,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 19:56:02,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 19:56:02,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2223, Invalid=2889, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:56:02,230 INFO L87 Difference]: Start difference. First operand 520 states and 521 transitions. Second operand 72 states. [2019-09-03 19:56:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:03,232 INFO L93 Difference]: Finished difference Result 529 states and 530 transitions. [2019-09-03 19:56:03,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:56:03,232 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 517 [2019-09-03 19:56:03,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:03,234 INFO L225 Difference]: With dead ends: 529 [2019-09-03 19:56:03,235 INFO L226 Difference]: Without dead ends: 527 [2019-09-03 19:56:03,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 577 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2236, Invalid=3166, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:56:03,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-03 19:56:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-03 19:56:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-03 19:56:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2019-09-03 19:56:03,257 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 517 [2019-09-03 19:56:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:03,258 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2019-09-03 19:56:03,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 19:56:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2019-09-03 19:56:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-03 19:56:03,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:03,260 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:03,260 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1147505576, now seen corresponding path program 127 times [2019-09-03 19:56:03,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:03,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:03,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:03,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:03,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16448 backedges. 6304 proven. 2080 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 19:56:08,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:08,171 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-03 19:56:08,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:08,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 19:56:08,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16448 backedges. 6304 proven. 2080 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 19:56:08,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:08,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2019-09-03 19:56:08,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-03 19:56:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-03 19:56:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4423, Invalid=13133, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 19:56:08,510 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 133 states. [2019-09-03 19:56:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:14,144 INFO L93 Difference]: Finished difference Result 731 states and 797 transitions. [2019-09-03 19:56:14,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-03 19:56:14,144 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 524 [2019-09-03 19:56:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:14,145 INFO L225 Difference]: With dead ends: 731 [2019-09-03 19:56:14,146 INFO L226 Difference]: Without dead ends: 528 [2019-09-03 19:56:14,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6304 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=8977, Invalid=30425, Unknown=0, NotChecked=0, Total=39402 [2019-09-03 19:56:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-03 19:56:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-09-03 19:56:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-03 19:56:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2019-09-03 19:56:14,180 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 524 [2019-09-03 19:56:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:14,181 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2019-09-03 19:56:14,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-03 19:56:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2019-09-03 19:56:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-03 19:56:14,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:14,184 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:14,185 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:14,185 INFO L82 PathProgramCache]: Analyzing trace with hash -198670103, now seen corresponding path program 128 times [2019-09-03 19:56:14,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:14,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:14,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:14,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:14,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 2273 proven. 6176 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 19:56:16,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:16,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 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-03 19:56:16,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:16,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:16,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:16,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-03 19:56:16,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:16,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 2272 proven. 6366 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2019-09-03 19:56:16,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:16,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 72] total 73 [2019-09-03 19:56:16,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 19:56:16,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 19:56:16,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2290, Invalid=2966, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:56:16,619 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 73 states. [2019-09-03 19:56:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:17,489 INFO L93 Difference]: Finished difference Result 537 states and 538 transitions. [2019-09-03 19:56:17,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 19:56:17,490 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 525 [2019-09-03 19:56:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:17,492 INFO L225 Difference]: With dead ends: 537 [2019-09-03 19:56:17,492 INFO L226 Difference]: Without dead ends: 535 [2019-09-03 19:56:17,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 586 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2303, Invalid=3247, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:56:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-03 19:56:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2019-09-03 19:56:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-03 19:56:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2019-09-03 19:56:17,515 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 525 [2019-09-03 19:56:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:17,515 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2019-09-03 19:56:17,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 19:56:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2019-09-03 19:56:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-09-03 19:56:17,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:17,517 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:17,518 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash 765512698, now seen corresponding path program 129 times [2019-09-03 19:56:17,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:17,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:17,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:17,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16965 backedges. 6500 proven. 2145 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-03 19:56:22,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:22,504 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-03 19:56:22,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:22,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-09-03 19:56:22,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:22,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-03 19:56:22,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16965 backedges. 6500 proven. 2145 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-03 19:56:23,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:23,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2019-09-03 19:56:23,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-03 19:56:23,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-03 19:56:23,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4557, Invalid=13533, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 19:56:23,147 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 135 states. [2019-09-03 19:56:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:27,247 INFO L93 Difference]: Finished difference Result 742 states and 809 transitions. [2019-09-03 19:56:27,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-03 19:56:27,247 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 532 [2019-09-03 19:56:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:27,248 INFO L225 Difference]: With dead ends: 742 [2019-09-03 19:56:27,249 INFO L226 Difference]: Without dead ends: 536 [2019-09-03 19:56:27,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6500 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=9247, Invalid=31355, Unknown=0, NotChecked=0, Total=40602 [2019-09-03 19:56:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-03 19:56:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-09-03 19:56:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-09-03 19:56:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2019-09-03 19:56:27,286 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 532 [2019-09-03 19:56:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:27,286 INFO L475 AbstractCegarLoop]: Abstraction has 536 states and 537 transitions. [2019-09-03 19:56:27,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-03 19:56:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 537 transitions. [2019-09-03 19:56:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-09-03 19:56:27,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:27,290 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:27,290 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:27,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1268629387, now seen corresponding path program 130 times [2019-09-03 19:56:27,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:27,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:27,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:27,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:27,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17031 backedges. 2341 proven. 6370 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-03 19:56:29,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:29,272 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-03 19:56:29,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:29,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:29,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:29,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-03 19:56:29,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:29,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17031 backedges. 2340 proven. 6563 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2019-09-03 19:56:29,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:29,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 73] total 74 [2019-09-03 19:56:29,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 19:56:29,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 19:56:29,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2358, Invalid=3044, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:56:29,751 INFO L87 Difference]: Start difference. First operand 536 states and 537 transitions. Second operand 74 states. [2019-09-03 19:56:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:30,795 INFO L93 Difference]: Finished difference Result 545 states and 546 transitions. [2019-09-03 19:56:30,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 19:56:30,796 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 533 [2019-09-03 19:56:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:30,798 INFO L225 Difference]: With dead ends: 545 [2019-09-03 19:56:30,798 INFO L226 Difference]: Without dead ends: 543 [2019-09-03 19:56:30,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 595 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2371, Invalid=3329, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:56:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-03 19:56:30,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2019-09-03 19:56:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-03 19:56:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2019-09-03 19:56:30,820 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 533 [2019-09-03 19:56:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:30,820 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 544 transitions. [2019-09-03 19:56:30,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 19:56:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 544 transitions. [2019-09-03 19:56:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2019-09-03 19:56:30,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:30,822 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:30,823 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1266599144, now seen corresponding path program 131 times [2019-09-03 19:56:30,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:30,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:30,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:30,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:30,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 17490 backedges. 6699 proven. 2211 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-03 19:56:35,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:35,799 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-03 19:56:35,810 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:36,112 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2019-09-03 19:56:36,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:36,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-03 19:56:36,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17490 backedges. 6699 proven. 2211 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-03 19:56:36,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:36,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2019-09-03 19:56:36,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-03 19:56:36,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-03 19:56:36,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4693, Invalid=13939, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 19:56:36,309 INFO L87 Difference]: Start difference. First operand 543 states and 544 transitions. Second operand 137 states. [2019-09-03 19:56:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:42,743 INFO L93 Difference]: Finished difference Result 753 states and 821 transitions. [2019-09-03 19:56:42,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-03 19:56:42,744 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 540 [2019-09-03 19:56:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:42,745 INFO L225 Difference]: With dead ends: 753 [2019-09-03 19:56:42,745 INFO L226 Difference]: Without dead ends: 544 [2019-09-03 19:56:42,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6699 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=9521, Invalid=32299, Unknown=0, NotChecked=0, Total=41820 [2019-09-03 19:56:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-03 19:56:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-09-03 19:56:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-03 19:56:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2019-09-03 19:56:42,768 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 540 [2019-09-03 19:56:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:42,768 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 545 transitions. [2019-09-03 19:56:42,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-03 19:56:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 545 transitions. [2019-09-03 19:56:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-09-03 19:56:42,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:42,771 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:42,771 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:42,771 INFO L82 PathProgramCache]: Analyzing trace with hash 111021481, now seen corresponding path program 132 times [2019-09-03 19:56:42,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:42,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:42,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:42,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:42,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17557 backedges. 2410 proven. 6567 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-03 19:56:44,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:44,708 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-03 19:56:44,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:45,033 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-03 19:56:45,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:45,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-03 19:56:45,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:45,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 17557 backedges. 2439 proven. 6733 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2019-09-03 19:56:45,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:45,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 74] total 75 [2019-09-03 19:56:45,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 19:56:45,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 19:56:45,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2427, Invalid=3123, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:56:45,354 INFO L87 Difference]: Start difference. First operand 544 states and 545 transitions. Second operand 75 states. [2019-09-03 19:56:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:46,446 INFO L93 Difference]: Finished difference Result 553 states and 554 transitions. [2019-09-03 19:56:46,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 19:56:46,446 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 541 [2019-09-03 19:56:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:46,448 INFO L225 Difference]: With dead ends: 553 [2019-09-03 19:56:46,448 INFO L226 Difference]: Without dead ends: 551 [2019-09-03 19:56:46,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 604 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2440, Invalid=3412, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:56:46,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-03 19:56:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-03 19:56:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-03 19:56:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2019-09-03 19:56:46,471 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 541 [2019-09-03 19:56:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:46,472 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2019-09-03 19:56:46,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 19:56:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2019-09-03 19:56:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-09-03 19:56:46,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:46,475 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:46,476 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:46,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:46,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1636855610, now seen corresponding path program 133 times [2019-09-03 19:56:46,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:46,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:46,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:46,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:46,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18023 backedges. 6901 proven. 2278 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-03 19:56:51,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:51,677 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-03 19:56:51,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:51,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-03 19:56:51,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18023 backedges. 6901 proven. 2278 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-03 19:56:52,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:52,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2019-09-03 19:56:52,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-03 19:56:52,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-03 19:56:52,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4831, Invalid=14351, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 19:56:52,058 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 139 states. [2019-09-03 19:56:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:56,614 INFO L93 Difference]: Finished difference Result 764 states and 833 transitions. [2019-09-03 19:56:56,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-03 19:56:56,614 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 548 [2019-09-03 19:56:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:56,617 INFO L225 Difference]: With dead ends: 764 [2019-09-03 19:56:56,617 INFO L226 Difference]: Without dead ends: 552 [2019-09-03 19:56:56,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6901 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=9799, Invalid=33257, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 19:56:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-03 19:56:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-09-03 19:56:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-03 19:56:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 553 transitions. [2019-09-03 19:56:56,655 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 553 transitions. Word has length 548 [2019-09-03 19:56:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:56,655 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 553 transitions. [2019-09-03 19:56:56,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-03 19:56:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 553 transitions. [2019-09-03 19:56:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-09-03 19:56:56,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:56,659 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:56,659 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:56,659 INFO L82 PathProgramCache]: Analyzing trace with hash -176283445, now seen corresponding path program 134 times [2019-09-03 19:56:56,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:56,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:56,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:56,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:56,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18091 backedges. 2480 proven. 6767 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-03 19:56:58,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:58,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 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-03 19:56:58,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:58,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:58,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:58,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-03 19:56:58,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:58,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 18091 backedges. 2479 proven. 6966 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2019-09-03 19:56:59,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:59,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 75] total 76 [2019-09-03 19:56:59,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 19:56:59,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 19:56:59,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2497, Invalid=3203, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:56:59,182 INFO L87 Difference]: Start difference. First operand 552 states and 553 transitions. Second operand 76 states. [2019-09-03 19:57:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:00,228 INFO L93 Difference]: Finished difference Result 561 states and 562 transitions. [2019-09-03 19:57:00,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 19:57:00,229 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 549 [2019-09-03 19:57:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:00,231 INFO L225 Difference]: With dead ends: 561 [2019-09-03 19:57:00,231 INFO L226 Difference]: Without dead ends: 559 [2019-09-03 19:57:00,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 613 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2510, Invalid=3496, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:57:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-03 19:57:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-03 19:57:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-03 19:57:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 560 transitions. [2019-09-03 19:57:00,255 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 560 transitions. Word has length 549 [2019-09-03 19:57:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:00,255 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 560 transitions. [2019-09-03 19:57:00,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 19:57:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 560 transitions. [2019-09-03 19:57:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-03 19:57:00,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:00,259 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:00,259 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:00,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:00,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2028794328, now seen corresponding path program 135 times [2019-09-03 19:57:00,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:00,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:00,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:00,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:00,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18564 backedges. 7106 proven. 2346 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-03 19:57:05,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:05,482 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-03 19:57:05,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:05,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-09-03 19:57:05,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:05,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-03 19:57:05,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18564 backedges. 7106 proven. 2346 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-03 19:57:06,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:06,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2019-09-03 19:57:06,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-03 19:57:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-03 19:57:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4971, Invalid=14769, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 19:57:06,056 INFO L87 Difference]: Start difference. First operand 559 states and 560 transitions. Second operand 141 states. [2019-09-03 19:57:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:12,458 INFO L93 Difference]: Finished difference Result 775 states and 845 transitions. [2019-09-03 19:57:12,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-03 19:57:12,458 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 556 [2019-09-03 19:57:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:12,459 INFO L225 Difference]: With dead ends: 775 [2019-09-03 19:57:12,459 INFO L226 Difference]: Without dead ends: 560 [2019-09-03 19:57:12,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7106 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=10081, Invalid=34229, Unknown=0, NotChecked=0, Total=44310 [2019-09-03 19:57:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-03 19:57:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-09-03 19:57:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-03 19:57:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 561 transitions. [2019-09-03 19:57:12,482 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 561 transitions. Word has length 556 [2019-09-03 19:57:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:12,482 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 561 transitions. [2019-09-03 19:57:12,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-03 19:57:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 561 transitions. [2019-09-03 19:57:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-09-03 19:57:12,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:12,485 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:12,485 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash 459047529, now seen corresponding path program 136 times [2019-09-03 19:57:12,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:12,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:12,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:12,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:12,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18633 backedges. 2551 proven. 6970 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-03 19:57:14,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:14,501 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-03 19:57:14,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:14,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:14,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:14,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-03 19:57:14,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:14,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18633 backedges. 2550 proven. 7172 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2019-09-03 19:57:15,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:15,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 76] total 77 [2019-09-03 19:57:15,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 19:57:15,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 19:57:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2568, Invalid=3284, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:57:15,009 INFO L87 Difference]: Start difference. First operand 560 states and 561 transitions. Second operand 77 states. [2019-09-03 19:57:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:15,920 INFO L93 Difference]: Finished difference Result 569 states and 570 transitions. [2019-09-03 19:57:15,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 19:57:15,921 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 557 [2019-09-03 19:57:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:15,922 INFO L225 Difference]: With dead ends: 569 [2019-09-03 19:57:15,922 INFO L226 Difference]: Without dead ends: 567 [2019-09-03 19:57:15,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 622 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2581, Invalid=3581, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:57:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-03 19:57:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-03 19:57:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-03 19:57:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2019-09-03 19:57:15,946 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 557 [2019-09-03 19:57:15,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:15,946 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2019-09-03 19:57:15,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 19:57:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2019-09-03 19:57:15,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-09-03 19:57:15,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:15,949 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:15,949 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:15,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:15,949 INFO L82 PathProgramCache]: Analyzing trace with hash 206119546, now seen corresponding path program 137 times [2019-09-03 19:57:15,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:15,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:15,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:15,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:15,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 19113 backedges. 7314 proven. 2415 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-03 19:57:21,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:21,512 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-03 19:57:21,522 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:21,821 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 70 check-sat command(s) [2019-09-03 19:57:21,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:21,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-03 19:57:21,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 19113 backedges. 7314 proven. 2415 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-03 19:57:21,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:21,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2019-09-03 19:57:21,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-03 19:57:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-03 19:57:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5113, Invalid=15193, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 19:57:21,988 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 143 states. [2019-09-03 19:57:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:30,747 INFO L93 Difference]: Finished difference Result 786 states and 857 transitions. [2019-09-03 19:57:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 19:57:30,748 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 564 [2019-09-03 19:57:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:30,749 INFO L225 Difference]: With dead ends: 786 [2019-09-03 19:57:30,749 INFO L226 Difference]: Without dead ends: 568 [2019-09-03 19:57:30,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7314 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=10367, Invalid=35215, Unknown=0, NotChecked=0, Total=45582 [2019-09-03 19:57:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-03 19:57:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-03 19:57:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-03 19:57:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 569 transitions. [2019-09-03 19:57:30,773 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 569 transitions. Word has length 564 [2019-09-03 19:57:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:30,773 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 569 transitions. [2019-09-03 19:57:30,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-03 19:57:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 569 transitions. [2019-09-03 19:57:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-09-03 19:57:30,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:30,776 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:30,776 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:30,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1223397899, now seen corresponding path program 138 times [2019-09-03 19:57:30,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:30,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:30,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 19183 backedges. 2623 proven. 7176 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-03 19:57:32,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:32,857 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-03 19:57:32,867 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:33,198 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 70 check-sat command(s) [2019-09-03 19:57:33,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:33,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-03 19:57:33,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:33,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 19183 backedges. 2652 proven. 7351 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2019-09-03 19:57:33,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:33,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 77] total 78 [2019-09-03 19:57:33,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 19:57:33,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 19:57:33,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2640, Invalid=3366, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:57:33,502 INFO L87 Difference]: Start difference. First operand 568 states and 569 transitions. Second operand 78 states. [2019-09-03 19:57:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:34,517 INFO L93 Difference]: Finished difference Result 577 states and 578 transitions. [2019-09-03 19:57:34,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 19:57:34,518 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 565 [2019-09-03 19:57:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:34,519 INFO L225 Difference]: With dead ends: 577 [2019-09-03 19:57:34,519 INFO L226 Difference]: Without dead ends: 575 [2019-09-03 19:57:34,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 631 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2653, Invalid=3667, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:57:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-03 19:57:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-09-03 19:57:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-03 19:57:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2019-09-03 19:57:34,546 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 565 [2019-09-03 19:57:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:34,547 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2019-09-03 19:57:34,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 19:57:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2019-09-03 19:57:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-09-03 19:57:34,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:34,549 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:34,549 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:34,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1039767704, now seen corresponding path program 139 times [2019-09-03 19:57:34,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:34,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:34,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19670 backedges. 7525 proven. 2485 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-03 19:57:40,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:40,082 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-03 19:57:40,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:40,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-03 19:57:40,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 19670 backedges. 7525 proven. 2485 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-03 19:57:40,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:40,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2019-09-03 19:57:40,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-03 19:57:40,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-03 19:57:40,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=15623, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 19:57:40,467 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 145 states. [2019-09-03 19:57:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:48,613 INFO L93 Difference]: Finished difference Result 797 states and 869 transitions. [2019-09-03 19:57:48,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-03 19:57:48,614 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 572 [2019-09-03 19:57:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:48,615 INFO L225 Difference]: With dead ends: 797 [2019-09-03 19:57:48,615 INFO L226 Difference]: Without dead ends: 576 [2019-09-03 19:57:48,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7525 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=10657, Invalid=36215, Unknown=0, NotChecked=0, Total=46872 [2019-09-03 19:57:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-03 19:57:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-03 19:57:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-03 19:57:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 577 transitions. [2019-09-03 19:57:48,653 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 577 transitions. Word has length 572 [2019-09-03 19:57:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:48,653 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 577 transitions. [2019-09-03 19:57:48,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-03 19:57:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 577 transitions. [2019-09-03 19:57:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-09-03 19:57:48,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:48,657 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:48,657 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:48,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:48,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1602217769, now seen corresponding path program 140 times [2019-09-03 19:57:48,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:48,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:48,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:48,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:48,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 19741 backedges. 2696 proven. 7385 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-03 19:57:50,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:50,815 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-03 19:57:50,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:57:51,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:57:51,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:51,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-03 19:57:51,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:51,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19741 backedges. 2695 proven. 7593 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2019-09-03 19:57:51,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:51,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 78] total 79 [2019-09-03 19:57:51,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 19:57:51,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 19:57:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2713, Invalid=3449, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:57:51,327 INFO L87 Difference]: Start difference. First operand 576 states and 577 transitions. Second operand 79 states. [2019-09-03 19:57:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:52,238 INFO L93 Difference]: Finished difference Result 585 states and 586 transitions. [2019-09-03 19:57:52,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 19:57:52,238 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 573 [2019-09-03 19:57:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:52,241 INFO L225 Difference]: With dead ends: 585 [2019-09-03 19:57:52,241 INFO L226 Difference]: Without dead ends: 583 [2019-09-03 19:57:52,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2726, Invalid=3754, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:57:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-03 19:57:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-03 19:57:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-03 19:57:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2019-09-03 19:57:52,271 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 573 [2019-09-03 19:57:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:52,271 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2019-09-03 19:57:52,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 19:57:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2019-09-03 19:57:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-09-03 19:57:52,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:52,274 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:52,274 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:52,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1227810234, now seen corresponding path program 141 times [2019-09-03 19:57:52,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:52,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:52,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:52,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:52,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 20235 backedges. 7739 proven. 2556 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2019-09-03 19:57:58,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:58,032 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-03 19:57:58,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:58,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-09-03 19:57:58,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:58,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-03 19:57:58,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 20235 backedges. 7739 proven. 2556 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2019-09-03 19:57:58,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:58,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2019-09-03 19:57:58,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-03 19:57:58,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-03 19:57:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5403, Invalid=16059, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 19:57:58,616 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 147 states. [2019-09-03 19:58:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:04,315 INFO L93 Difference]: Finished difference Result 808 states and 881 transitions. [2019-09-03 19:58:04,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-03 19:58:04,315 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 580 [2019-09-03 19:58:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:04,316 INFO L225 Difference]: With dead ends: 808 [2019-09-03 19:58:04,316 INFO L226 Difference]: Without dead ends: 584 [2019-09-03 19:58:04,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7739 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=10951, Invalid=37229, Unknown=0, NotChecked=0, Total=48180 [2019-09-03 19:58:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-03 19:58:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-09-03 19:58:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-03 19:58:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 585 transitions. [2019-09-03 19:58:04,343 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 585 transitions. Word has length 580 [2019-09-03 19:58:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:04,343 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 585 transitions. [2019-09-03 19:58:04,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-03 19:58:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 585 transitions. [2019-09-03 19:58:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2019-09-03 19:58:04,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:04,346 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:04,346 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:04,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1498026827, now seen corresponding path program 142 times [2019-09-03 19:58:04,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:04,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:04,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 20307 backedges. 2770 proven. 7597 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2019-09-03 19:58:06,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:06,490 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-03 19:58:06,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:06,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:06,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:06,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-03 19:58:06,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:06,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 20307 backedges. 2769 proven. 7808 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2019-09-03 19:58:07,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:07,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 79] total 80 [2019-09-03 19:58:07,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 19:58:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 19:58:07,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2787, Invalid=3533, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:58:07,032 INFO L87 Difference]: Start difference. First operand 584 states and 585 transitions. Second operand 80 states. [2019-09-03 19:58:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:08,110 INFO L93 Difference]: Finished difference Result 593 states and 594 transitions. [2019-09-03 19:58:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:58:08,111 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 581 [2019-09-03 19:58:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:08,113 INFO L225 Difference]: With dead ends: 593 [2019-09-03 19:58:08,113 INFO L226 Difference]: Without dead ends: 591 [2019-09-03 19:58:08,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 649 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2800, Invalid=3842, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:58:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-03 19:58:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-03 19:58:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-03 19:58:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 592 transitions. [2019-09-03 19:58:08,138 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 592 transitions. Word has length 581 [2019-09-03 19:58:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:08,138 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 592 transitions. [2019-09-03 19:58:08,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 19:58:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 592 transitions. [2019-09-03 19:58:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2019-09-03 19:58:08,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:08,141 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:08,141 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:08,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash 398667608, now seen corresponding path program 143 times [2019-09-03 19:58:08,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:08,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:08,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:08,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:08,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20808 backedges. 7956 proven. 2628 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2019-09-03 19:58:14,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:14,116 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-03 19:58:14,125 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:58:14,450 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2019-09-03 19:58:14,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:14,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-03 19:58:14,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 20808 backedges. 7956 proven. 2628 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2019-09-03 19:58:14,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:14,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2019-09-03 19:58:14,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-03 19:58:14,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-03 19:58:14,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5551, Invalid=16501, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 19:58:14,636 INFO L87 Difference]: Start difference. First operand 591 states and 592 transitions. Second operand 149 states. [2019-09-03 19:58:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:24,215 INFO L93 Difference]: Finished difference Result 819 states and 893 transitions. [2019-09-03 19:58:24,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-03 19:58:24,216 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 588 [2019-09-03 19:58:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:24,217 INFO L225 Difference]: With dead ends: 819 [2019-09-03 19:58:24,217 INFO L226 Difference]: Without dead ends: 592 [2019-09-03 19:58:24,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7956 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=11249, Invalid=38257, Unknown=0, NotChecked=0, Total=49506 [2019-09-03 19:58:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-03 19:58:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-09-03 19:58:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-03 19:58:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 593 transitions. [2019-09-03 19:58:24,257 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 593 transitions. Word has length 588 [2019-09-03 19:58:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:24,257 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 593 transitions. [2019-09-03 19:58:24,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-03 19:58:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 593 transitions. [2019-09-03 19:58:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2019-09-03 19:58:24,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:24,261 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:24,261 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash -551273495, now seen corresponding path program 144 times [2019-09-03 19:58:24,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:24,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:24,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:24,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:24,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 20881 backedges. 2845 proven. 7812 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2019-09-03 19:58:26,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:26,514 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-03 19:58:26,524 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:26,885 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-03 19:58:26,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:26,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-03 19:58:26,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:26,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 20881 backedges. 2874 proven. 7996 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2019-09-03 19:58:27,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:27,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 80] total 81 [2019-09-03 19:58:27,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 19:58:27,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 19:58:27,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=3618, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:58:27,258 INFO L87 Difference]: Start difference. First operand 592 states and 593 transitions. Second operand 81 states. [2019-09-03 19:58:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:28,308 INFO L93 Difference]: Finished difference Result 601 states and 602 transitions. [2019-09-03 19:58:28,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 19:58:28,309 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 589 [2019-09-03 19:58:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:28,311 INFO L225 Difference]: With dead ends: 601 [2019-09-03 19:58:28,311 INFO L226 Difference]: Without dead ends: 599 [2019-09-03 19:58:28,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 658 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2875, Invalid=3931, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:58:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-03 19:58:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-03 19:58:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-03 19:58:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 600 transitions. [2019-09-03 19:58:28,341 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 600 transitions. Word has length 589 [2019-09-03 19:58:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:28,342 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 600 transitions. [2019-09-03 19:58:28,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 19:58:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 600 transitions. [2019-09-03 19:58:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-09-03 19:58:28,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:28,344 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:28,345 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1957017850, now seen corresponding path program 145 times [2019-09-03 19:58:28,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:28,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:28,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21389 backedges. 8176 proven. 2701 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2019-09-03 19:58:34,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:34,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 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-03 19:58:34,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:34,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-03 19:58:34,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 21389 backedges. 8176 proven. 2701 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2019-09-03 19:58:34,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:34,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 151 [2019-09-03 19:58:34,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-03 19:58:34,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-03 19:58:34,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5701, Invalid=16949, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 19:58:34,751 INFO L87 Difference]: Start difference. First operand 599 states and 600 transitions. Second operand 151 states. [2019-09-03 19:58:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:40,670 INFO L93 Difference]: Finished difference Result 830 states and 905 transitions. [2019-09-03 19:58:40,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-03 19:58:40,671 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 596 [2019-09-03 19:58:40,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:40,672 INFO L225 Difference]: With dead ends: 830 [2019-09-03 19:58:40,672 INFO L226 Difference]: Without dead ends: 600 [2019-09-03 19:58:40,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8176 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=11551, Invalid=39299, Unknown=0, NotChecked=0, Total=50850 [2019-09-03 19:58:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-09-03 19:58:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-09-03 19:58:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-03 19:58:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 601 transitions. [2019-09-03 19:58:40,699 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 601 transitions. Word has length 596 [2019-09-03 19:58:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:40,699 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 601 transitions. [2019-09-03 19:58:40,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-03 19:58:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 601 transitions. [2019-09-03 19:58:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-09-03 19:58:40,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:40,702 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:40,702 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:40,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:40,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2063443083, now seen corresponding path program 146 times [2019-09-03 19:58:40,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:40,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:40,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:40,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:40,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 21463 backedges. 2921 proven. 8030 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2019-09-03 19:58:42,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:42,998 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-03 19:58:43,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:43,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:43,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:43,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 159 conjunts are in the unsatisfiable core [2019-09-03 19:58:43,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:43,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21463 backedges. 2920 proven. 8247 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2019-09-03 19:58:43,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:43,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 81] total 82 [2019-09-03 19:58:43,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 19:58:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 19:58:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2938, Invalid=3704, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:58:43,561 INFO L87 Difference]: Start difference. First operand 600 states and 601 transitions. Second operand 82 states. [2019-09-03 19:58:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:44,570 INFO L93 Difference]: Finished difference Result 609 states and 610 transitions. [2019-09-03 19:58:44,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 19:58:44,571 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 597 [2019-09-03 19:58:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:44,572 INFO L225 Difference]: With dead ends: 609 [2019-09-03 19:58:44,572 INFO L226 Difference]: Without dead ends: 607 [2019-09-03 19:58:44,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 667 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2951, Invalid=4021, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:58:44,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-03 19:58:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-03 19:58:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-03 19:58:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2019-09-03 19:58:44,597 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 597 [2019-09-03 19:58:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:44,598 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 608 transitions. [2019-09-03 19:58:44,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 19:58:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 608 transitions. [2019-09-03 19:58:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-09-03 19:58:44,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:44,601 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:44,601 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1184516584, now seen corresponding path program 147 times [2019-09-03 19:58:44,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:44,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:44,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:44,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21978 backedges. 8399 proven. 2775 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2019-09-03 19:58:50,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:50,816 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-03 19:58:50,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:51,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-09-03 19:58:51,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:51,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 1437 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-03 19:58:51,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 21978 backedges. 8399 proven. 2775 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2019-09-03 19:58:51,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:51,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 153 [2019-09-03 19:58:51,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-03 19:58:51,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-03 19:58:51,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5853, Invalid=17403, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 19:58:51,479 INFO L87 Difference]: Start difference. First operand 607 states and 608 transitions. Second operand 153 states. [2019-09-03 19:59:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:00,381 INFO L93 Difference]: Finished difference Result 841 states and 917 transitions. [2019-09-03 19:59:00,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-03 19:59:00,382 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 604 [2019-09-03 19:59:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:00,383 INFO L225 Difference]: With dead ends: 841 [2019-09-03 19:59:00,383 INFO L226 Difference]: Without dead ends: 608 [2019-09-03 19:59:00,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8399 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=11857, Invalid=40355, Unknown=0, NotChecked=0, Total=52212 [2019-09-03 19:59:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-03 19:59:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-09-03 19:59:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-03 19:59:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 609 transitions. [2019-09-03 19:59:00,411 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 609 transitions. Word has length 604 [2019-09-03 19:59:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:00,411 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 609 transitions. [2019-09-03 19:59:00,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-03 19:59:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 609 transitions. [2019-09-03 19:59:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-09-03 19:59:00,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:00,414 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:00,414 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:00,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1164279977, now seen corresponding path program 148 times [2019-09-03 19:59:00,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:00,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:00,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:00,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:00,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 22053 backedges. 2998 proven. 8251 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2019-09-03 19:59:02,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:02,783 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-03 19:59:02,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:03,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:03,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:03,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-03 19:59:03,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:03,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 22053 backedges. 2997 proven. 8471 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2019-09-03 19:59:03,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:03,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 82] total 83 [2019-09-03 19:59:03,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 19:59:03,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 19:59:03,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3015, Invalid=3791, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:59:03,341 INFO L87 Difference]: Start difference. First operand 608 states and 609 transitions. Second operand 83 states. [2019-09-03 19:59:04,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:04,353 INFO L93 Difference]: Finished difference Result 617 states and 618 transitions. [2019-09-03 19:59:04,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 19:59:04,354 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 605 [2019-09-03 19:59:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:04,356 INFO L225 Difference]: With dead ends: 617 [2019-09-03 19:59:04,356 INFO L226 Difference]: Without dead ends: 615 [2019-09-03 19:59:04,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 676 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3028, Invalid=4112, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:59:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-09-03 19:59:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-09-03 19:59:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-03 19:59:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 616 transitions. [2019-09-03 19:59:04,383 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 616 transitions. Word has length 605 [2019-09-03 19:59:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:04,384 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 616 transitions. [2019-09-03 19:59:04,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 19:59:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 616 transitions. [2019-09-03 19:59:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-09-03 19:59:04,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:04,386 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:04,387 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:04,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:04,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1813093434, now seen corresponding path program 149 times [2019-09-03 19:59:04,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:04,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:04,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:04,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:04,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 22575 backedges. 8625 proven. 2850 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2019-09-03 19:59:10,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:10,765 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-03 19:59:10,775 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:11,134 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2019-09-03 19:59:11,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:11,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-03 19:59:11,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 22575 backedges. 8625 proven. 2850 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2019-09-03 19:59:11,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:11,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 155 [2019-09-03 19:59:11,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-09-03 19:59:11,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-09-03 19:59:11,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6007, Invalid=17863, Unknown=0, NotChecked=0, Total=23870 [2019-09-03 19:59:11,331 INFO L87 Difference]: Start difference. First operand 615 states and 616 transitions. Second operand 155 states. [2019-09-03 19:59:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:21,939 INFO L93 Difference]: Finished difference Result 852 states and 929 transitions. [2019-09-03 19:59:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-03 19:59:21,939 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 612 [2019-09-03 19:59:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:21,940 INFO L225 Difference]: With dead ends: 852 [2019-09-03 19:59:21,940 INFO L226 Difference]: Without dead ends: 616 [2019-09-03 19:59:21,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8625 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=12167, Invalid=41425, Unknown=0, NotChecked=0, Total=53592 [2019-09-03 19:59:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-03 19:59:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2019-09-03 19:59:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-03 19:59:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 617 transitions. [2019-09-03 19:59:21,969 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 617 transitions. Word has length 612 [2019-09-03 19:59:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:21,969 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 617 transitions. [2019-09-03 19:59:21,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-09-03 19:59:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 617 transitions. [2019-09-03 19:59:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-09-03 19:59:21,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:21,972 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:21,972 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2090187317, now seen corresponding path program 150 times [2019-09-03 19:59:21,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:21,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 22651 backedges. 3076 proven. 8475 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2019-09-03 19:59:24,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:24,457 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-03 19:59:24,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:24,874 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 76 check-sat command(s) [2019-09-03 19:59:24,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:24,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-03 19:59:24,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:25,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 22651 backedges. 3108 proven. 8665 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2019-09-03 19:59:25,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:25,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 83] total 84 [2019-09-03 19:59:25,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 19:59:25,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 19:59:25,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3093, Invalid=3879, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:59:25,305 INFO L87 Difference]: Start difference. First operand 616 states and 617 transitions. Second operand 84 states. [2019-09-03 19:59:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:26,457 INFO L93 Difference]: Finished difference Result 625 states and 626 transitions. [2019-09-03 19:59:26,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:59:26,458 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 613 [2019-09-03 19:59:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:26,460 INFO L225 Difference]: With dead ends: 625 [2019-09-03 19:59:26,460 INFO L226 Difference]: Without dead ends: 623 [2019-09-03 19:59:26,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 685 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3106, Invalid=4204, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:59:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-03 19:59:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-03 19:59:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-03 19:59:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 624 transitions. [2019-09-03 19:59:26,489 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 624 transitions. Word has length 613 [2019-09-03 19:59:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:26,489 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 624 transitions. [2019-09-03 19:59:26,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 19:59:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 624 transitions. [2019-09-03 19:59:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2019-09-03 19:59:26,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:26,492 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:26,492 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash 889007320, now seen corresponding path program 151 times [2019-09-03 19:59:26,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:26,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:26,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:26,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:26,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 23180 backedges. 8854 proven. 2926 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2019-09-03 19:59:33,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:33,066 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-03 19:59:33,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:33,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 156 conjunts are in the unsatisfiable core [2019-09-03 19:59:33,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23180 backedges. 8854 proven. 2926 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2019-09-03 19:59:33,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:33,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 157 [2019-09-03 19:59:33,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-03 19:59:33,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-03 19:59:33,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6163, Invalid=18329, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 19:59:33,500 INFO L87 Difference]: Start difference. First operand 623 states and 624 transitions. Second operand 157 states. [2019-09-03 19:59:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:44,649 INFO L93 Difference]: Finished difference Result 863 states and 941 transitions. [2019-09-03 19:59:44,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-03 19:59:44,649 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 620 [2019-09-03 19:59:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:44,650 INFO L225 Difference]: With dead ends: 863 [2019-09-03 19:59:44,650 INFO L226 Difference]: Without dead ends: 624 [2019-09-03 19:59:44,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8854 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=12481, Invalid=42509, Unknown=0, NotChecked=0, Total=54990 [2019-09-03 19:59:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-03 19:59:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-09-03 19:59:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-03 19:59:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 625 transitions. [2019-09-03 19:59:44,684 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 625 transitions. Word has length 620 [2019-09-03 19:59:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:44,684 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 625 transitions. [2019-09-03 19:59:44,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-03 19:59:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 625 transitions. [2019-09-03 19:59:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-09-03 19:59:44,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:44,687 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:44,687 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1671449239, now seen corresponding path program 152 times [2019-09-03 19:59:44,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:44,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:44,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:44,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:44,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 23257 backedges. 3155 proven. 8702 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2019-09-03 19:59:47,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:47,234 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-03 19:59:47,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:47,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:47,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:47,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 165 conjunts are in the unsatisfiable core [2019-09-03 19:59:47,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:47,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 23257 backedges. 3154 proven. 8928 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2019-09-03 19:59:47,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:47,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 84] total 85 [2019-09-03 19:59:47,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 19:59:47,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 19:59:47,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3172, Invalid=3968, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:59:47,909 INFO L87 Difference]: Start difference. First operand 624 states and 625 transitions. Second operand 85 states. [2019-09-03 19:59:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:49,012 INFO L93 Difference]: Finished difference Result 633 states and 634 transitions. [2019-09-03 19:59:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 19:59:49,013 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 621 [2019-09-03 19:59:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:49,016 INFO L225 Difference]: With dead ends: 633 [2019-09-03 19:59:49,016 INFO L226 Difference]: Without dead ends: 631 [2019-09-03 19:59:49,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 694 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3185, Invalid=4297, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 19:59:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-03 19:59:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-09-03 19:59:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-09-03 19:59:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 632 transitions. [2019-09-03 19:59:49,044 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 632 transitions. Word has length 621 [2019-09-03 19:59:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:49,045 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 632 transitions. [2019-09-03 19:59:49,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 19:59:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 632 transitions. [2019-09-03 19:59:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-09-03 19:59:49,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:49,049 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:49,049 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash -841576582, now seen corresponding path program 153 times [2019-09-03 19:59:49,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:49,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:49,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:49,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 23793 backedges. 9086 proven. 3003 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2019-09-03 19:59:55,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:55,725 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-03 19:59:55,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:59:56,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-09-03 19:59:56,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:56,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-03 19:59:56,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 23793 backedges. 9086 proven. 3003 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2019-09-03 19:59:56,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:56,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 159] total 159 [2019-09-03 19:59:56,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-03 19:59:56,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-03 19:59:56,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6321, Invalid=18801, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 19:59:56,432 INFO L87 Difference]: Start difference. First operand 631 states and 632 transitions. Second operand 159 states. [2019-09-03 20:00:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:02,094 INFO L93 Difference]: Finished difference Result 874 states and 953 transitions. [2019-09-03 20:00:02,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-03 20:00:02,094 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 628 [2019-09-03 20:00:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:02,095 INFO L225 Difference]: With dead ends: 874 [2019-09-03 20:00:02,095 INFO L226 Difference]: Without dead ends: 632 [2019-09-03 20:00:02,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9086 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=12799, Invalid=43607, Unknown=0, NotChecked=0, Total=56406 [2019-09-03 20:00:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-03 20:00:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-09-03 20:00:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-03 20:00:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 633 transitions. [2019-09-03 20:00:02,127 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 633 transitions. Word has length 628 [2019-09-03 20:00:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:02,127 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 633 transitions. [2019-09-03 20:00:02,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-03 20:00:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 633 transitions. [2019-09-03 20:00:02,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2019-09-03 20:00:02,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:02,130 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:02,131 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:02,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:02,131 INFO L82 PathProgramCache]: Analyzing trace with hash 150206219, now seen corresponding path program 154 times [2019-09-03 20:00:02,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:02,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:02,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:02,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:02,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 23871 backedges. 3235 proven. 8932 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2019-09-03 20:00:04,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:04,835 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-03 20:00:04,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:05,064 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:05,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:05,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 167 conjunts are in the unsatisfiable core [2019-09-03 20:00:05,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:05,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 23871 backedges. 3234 proven. 9161 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2019-09-03 20:00:05,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:05,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 85] total 86 [2019-09-03 20:00:05,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 20:00:05,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 20:00:05,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=4058, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:00:05,419 INFO L87 Difference]: Start difference. First operand 632 states and 633 transitions. Second operand 86 states. [2019-09-03 20:00:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:06,690 INFO L93 Difference]: Finished difference Result 641 states and 642 transitions. [2019-09-03 20:00:06,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 20:00:06,691 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 629 [2019-09-03 20:00:06,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:06,693 INFO L225 Difference]: With dead ends: 641 [2019-09-03 20:00:06,693 INFO L226 Difference]: Without dead ends: 639 [2019-09-03 20:00:06,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 703 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3265, Invalid=4391, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:00:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-03 20:00:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-03 20:00:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-03 20:00:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 640 transitions. [2019-09-03 20:00:06,723 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 640 transitions. Word has length 629 [2019-09-03 20:00:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:06,724 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 640 transitions. [2019-09-03 20:00:06,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 20:00:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 640 transitions. [2019-09-03 20:00:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2019-09-03 20:00:06,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:06,727 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:06,727 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:06,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:06,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1146776680, now seen corresponding path program 155 times [2019-09-03 20:00:06,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:06,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:06,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 24414 backedges. 9321 proven. 3081 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2019-09-03 20:00:13,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:13,528 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-03 20:00:13,538 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:00:13,906 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2019-09-03 20:00:13,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:13,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-03 20:00:13,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 24414 backedges. 9321 proven. 3081 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2019-09-03 20:00:14,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:14,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161, 161] total 161 [2019-09-03 20:00:14,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-03 20:00:14,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-03 20:00:14,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6481, Invalid=19279, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 20:00:14,116 INFO L87 Difference]: Start difference. First operand 639 states and 640 transitions. Second operand 161 states. [2019-09-03 20:00:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:23,004 INFO L93 Difference]: Finished difference Result 885 states and 965 transitions. [2019-09-03 20:00:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-03 20:00:23,005 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 636 [2019-09-03 20:00:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:23,006 INFO L225 Difference]: With dead ends: 885 [2019-09-03 20:00:23,006 INFO L226 Difference]: Without dead ends: 640 [2019-09-03 20:00:23,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9321 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13121, Invalid=44719, Unknown=0, NotChecked=0, Total=57840 [2019-09-03 20:00:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-03 20:00:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-09-03 20:00:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-03 20:00:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 641 transitions. [2019-09-03 20:00:23,038 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 641 transitions. Word has length 636 [2019-09-03 20:00:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:23,039 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 641 transitions. [2019-09-03 20:00:23,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-03 20:00:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 641 transitions. [2019-09-03 20:00:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2019-09-03 20:00:23,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:23,042 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:23,042 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:23,042 INFO L82 PathProgramCache]: Analyzing trace with hash 221174313, now seen corresponding path program 156 times [2019-09-03 20:00:23,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:23,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:23,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:23,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:23,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 24493 backedges. 3316 proven. 9165 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2019-09-03 20:00:25,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:25,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 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-03 20:00:25,743 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:00:26,148 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-03 20:00:26,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:26,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 169 conjunts are in the unsatisfiable core [2019-09-03 20:00:26,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:26,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 24493 backedges. 3348 proven. 9364 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2019-09-03 20:00:26,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:26,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 86] total 87 [2019-09-03 20:00:26,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 20:00:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 20:00:26,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3333, Invalid=4149, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:00:26,545 INFO L87 Difference]: Start difference. First operand 640 states and 641 transitions. Second operand 87 states. [2019-09-03 20:00:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:27,880 INFO L93 Difference]: Finished difference Result 649 states and 650 transitions. [2019-09-03 20:00:27,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 20:00:27,880 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 637 [2019-09-03 20:00:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:27,882 INFO L225 Difference]: With dead ends: 649 [2019-09-03 20:00:27,882 INFO L226 Difference]: Without dead ends: 647 [2019-09-03 20:00:27,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 712 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3346, Invalid=4486, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 20:00:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-03 20:00:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-09-03 20:00:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-03 20:00:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 648 transitions. [2019-09-03 20:00:27,911 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 648 transitions. Word has length 637 [2019-09-03 20:00:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:27,912 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 648 transitions. [2019-09-03 20:00:27,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 20:00:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 648 transitions. [2019-09-03 20:00:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2019-09-03 20:00:27,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:27,915 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:27,915 INFO L418 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:27,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:27,915 INFO L82 PathProgramCache]: Analyzing trace with hash 962106042, now seen corresponding path program 157 times [2019-09-03 20:00:27,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:27,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:27,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:27,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:27,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 25043 backedges. 9559 proven. 3160 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2019-09-03 20:00:35,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:35,030 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-03 20:00:35,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:35,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-03 20:00:35,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25043 backedges. 9559 proven. 3160 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2019-09-03 20:00:35,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:35,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163, 163] total 163 [2019-09-03 20:00:35,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-03 20:00:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-03 20:00:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6643, Invalid=19763, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 20:00:35,463 INFO L87 Difference]: Start difference. First operand 647 states and 648 transitions. Second operand 163 states. [2019-09-03 20:00:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:40,970 INFO L93 Difference]: Finished difference Result 896 states and 977 transitions. [2019-09-03 20:00:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-03 20:00:40,971 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 644 [2019-09-03 20:00:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:40,972 INFO L225 Difference]: With dead ends: 896 [2019-09-03 20:00:40,972 INFO L226 Difference]: Without dead ends: 648 [2019-09-03 20:00:40,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9559 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13447, Invalid=45845, Unknown=0, NotChecked=0, Total=59292 [2019-09-03 20:00:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-03 20:00:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-09-03 20:00:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-03 20:00:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 649 transitions. [2019-09-03 20:00:41,020 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 649 transitions. Word has length 644 [2019-09-03 20:00:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:41,021 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 649 transitions. [2019-09-03 20:00:41,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-03 20:00:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 649 transitions. [2019-09-03 20:00:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2019-09-03 20:00:41,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:41,025 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:41,025 INFO L418 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:41,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1560364981, now seen corresponding path program 158 times [2019-09-03 20:00:41,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:41,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 25123 backedges. 3398 proven. 9401 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2019-09-03 20:00:43,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:43,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 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-03 20:00:43,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:43,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:43,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:43,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1537 conjuncts, 171 conjunts are in the unsatisfiable core [2019-09-03 20:00:43,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:44,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 25123 backedges. 3397 proven. 9636 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2019-09-03 20:00:44,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:44,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 87] total 88 [2019-09-03 20:00:44,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 20:00:44,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 20:00:44,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3415, Invalid=4241, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:00:44,353 INFO L87 Difference]: Start difference. First operand 648 states and 649 transitions. Second operand 88 states. [2019-09-03 20:00:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:45,736 INFO L93 Difference]: Finished difference Result 657 states and 658 transitions. [2019-09-03 20:00:45,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:00:45,737 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 645 [2019-09-03 20:00:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:45,739 INFO L225 Difference]: With dead ends: 657 [2019-09-03 20:00:45,739 INFO L226 Difference]: Without dead ends: 655 [2019-09-03 20:00:45,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 721 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3428, Invalid=4582, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:00:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-03 20:00:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-09-03 20:00:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-03 20:00:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 656 transitions. [2019-09-03 20:00:45,773 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 656 transitions. Word has length 645 [2019-09-03 20:00:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:45,773 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 656 transitions. [2019-09-03 20:00:45,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 20:00:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 656 transitions. [2019-09-03 20:00:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-09-03 20:00:45,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:45,776 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:45,777 INFO L418 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:45,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1568336472, now seen corresponding path program 159 times [2019-09-03 20:00:45,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:45,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:45,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:45,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:45,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 25680 backedges. 9800 proven. 3240 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2019-09-03 20:00:52,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:52,943 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-03 20:00:52,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:53,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-09-03 20:00:53,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:53,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 164 conjunts are in the unsatisfiable core [2019-09-03 20:00:53,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 25680 backedges. 9800 proven. 3240 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2019-09-03 20:00:53,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:53,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165, 165] total 165 [2019-09-03 20:00:53,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-03 20:00:53,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-03 20:00:53,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6807, Invalid=20253, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:00:53,683 INFO L87 Difference]: Start difference. First operand 655 states and 656 transitions. Second operand 165 states. [2019-09-03 20:01:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:02,456 INFO L93 Difference]: Finished difference Result 907 states and 989 transitions. [2019-09-03 20:01:02,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-03 20:01:02,456 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 652 [2019-09-03 20:01:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:02,458 INFO L225 Difference]: With dead ends: 907 [2019-09-03 20:01:02,458 INFO L226 Difference]: Without dead ends: 656 [2019-09-03 20:01:02,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9800 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13777, Invalid=46985, Unknown=0, NotChecked=0, Total=60762 [2019-09-03 20:01:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-09-03 20:01:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-09-03 20:01:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-09-03 20:01:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 657 transitions. [2019-09-03 20:01:02,489 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 657 transitions. Word has length 652 [2019-09-03 20:01:02,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:02,490 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 657 transitions. [2019-09-03 20:01:02,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-03 20:01:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 657 transitions. [2019-09-03 20:01:02,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-09-03 20:01:02,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:02,493 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:02,493 INFO L418 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1611731223, now seen corresponding path program 160 times [2019-09-03 20:01:02,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:02,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:02,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:02,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:02,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 25761 backedges. 3481 proven. 9640 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2019-09-03 20:01:05,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:05,209 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-03 20:01:05,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:01:05,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:01:05,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:05,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 1556 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-03 20:01:05,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 25761 backedges. 3480 proven. 9878 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2019-09-03 20:01:05,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:05,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 88] total 89 [2019-09-03 20:01:05,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 20:01:05,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 20:01:05,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3498, Invalid=4334, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 20:01:05,865 INFO L87 Difference]: Start difference. First operand 656 states and 657 transitions. Second operand 89 states. [2019-09-03 20:01:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:07,014 INFO L93 Difference]: Finished difference Result 665 states and 666 transitions. [2019-09-03 20:01:07,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 20:01:07,014 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 653 [2019-09-03 20:01:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:07,016 INFO L225 Difference]: With dead ends: 665 [2019-09-03 20:01:07,016 INFO L226 Difference]: Without dead ends: 663 [2019-09-03 20:01:07,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 730 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3511, Invalid=4679, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:01:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-03 20:01:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-09-03 20:01:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-03 20:01:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 664 transitions. [2019-09-03 20:01:07,047 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 664 transitions. Word has length 653 [2019-09-03 20:01:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:07,047 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 664 transitions. [2019-09-03 20:01:07,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 20:01:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 664 transitions. [2019-09-03 20:01:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2019-09-03 20:01:07,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:07,050 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:07,050 INFO L418 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1896110598, now seen corresponding path program 161 times [2019-09-03 20:01:07,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:07,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:07,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:07,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:07,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 26325 backedges. 10044 proven. 3321 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2019-09-03 20:01:14,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:14,384 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-03 20:01:14,394 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:01:14,792 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 82 check-sat command(s) [2019-09-03 20:01:14,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:14,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 166 conjunts are in the unsatisfiable core [2019-09-03 20:01:14,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 26325 backedges. 10044 proven. 3321 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2019-09-03 20:01:15,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:15,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167, 167] total 167 [2019-09-03 20:01:15,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-09-03 20:01:15,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-09-03 20:01:15,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6973, Invalid=20749, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 20:01:15,017 INFO L87 Difference]: Start difference. First operand 663 states and 664 transitions. Second operand 167 states. [2019-09-03 20:01:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:24,113 INFO L93 Difference]: Finished difference Result 918 states and 1001 transitions. [2019-09-03 20:01:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-03 20:01:24,113 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 660 [2019-09-03 20:01:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:24,114 INFO L225 Difference]: With dead ends: 918 [2019-09-03 20:01:24,114 INFO L226 Difference]: Without dead ends: 664 [2019-09-03 20:01:24,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10044 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=14111, Invalid=48139, Unknown=0, NotChecked=0, Total=62250 [2019-09-03 20:01:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-03 20:01:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2019-09-03 20:01:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-03 20:01:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 665 transitions. [2019-09-03 20:01:24,145 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 665 transitions. Word has length 660 [2019-09-03 20:01:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:24,146 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 665 transitions. [2019-09-03 20:01:24,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-09-03 20:01:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 665 transitions. [2019-09-03 20:01:24,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-09-03 20:01:24,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:24,149 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:24,149 INFO L418 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:24,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:24,149 INFO L82 PathProgramCache]: Analyzing trace with hash 703498635, now seen corresponding path program 162 times [2019-09-03 20:01:24,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:24,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:24,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:24,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:24,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 26407 backedges. 3565 proven. 9882 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2019-09-03 20:01:26,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:26,907 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-03 20:01:26,917 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:01:27,352 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2019-09-03 20:01:27,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:27,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 175 conjunts are in the unsatisfiable core [2019-09-03 20:01:27,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:27,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 26407 backedges. 3600 proven. 10087 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2019-09-03 20:01:27,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:27,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 89] total 90 [2019-09-03 20:01:27,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 20:01:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 20:01:27,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3582, Invalid=4428, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:01:27,728 INFO L87 Difference]: Start difference. First operand 664 states and 665 transitions. Second operand 90 states. [2019-09-03 20:01:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:29,076 INFO L93 Difference]: Finished difference Result 673 states and 674 transitions. [2019-09-03 20:01:29,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:01:29,077 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 661 [2019-09-03 20:01:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:29,079 INFO L225 Difference]: With dead ends: 673 [2019-09-03 20:01:29,079 INFO L226 Difference]: Without dead ends: 671 [2019-09-03 20:01:29,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 739 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3595, Invalid=4777, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:01:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-09-03 20:01:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-09-03 20:01:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-09-03 20:01:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 672 transitions. [2019-09-03 20:01:29,112 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 672 transitions. Word has length 661 [2019-09-03 20:01:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:29,112 INFO L475 AbstractCegarLoop]: Abstraction has 671 states and 672 transitions. [2019-09-03 20:01:29,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 20:01:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 672 transitions. [2019-09-03 20:01:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-09-03 20:01:29,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:29,115 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:29,115 INFO L418 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:29,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:29,116 INFO L82 PathProgramCache]: Analyzing trace with hash -912707304, now seen corresponding path program 163 times [2019-09-03 20:01:29,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:29,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:29,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 26978 backedges. 10291 proven. 3403 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2019-09-03 20:01:36,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:36,842 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-03 20:01:36,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:37,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 168 conjunts are in the unsatisfiable core [2019-09-03 20:01:37,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 26978 backedges. 10291 proven. 3403 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2019-09-03 20:01:37,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:37,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169, 169] total 169 [2019-09-03 20:01:37,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-03 20:01:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-03 20:01:37,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7141, Invalid=21251, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 20:01:37,317 INFO L87 Difference]: Start difference. First operand 671 states and 672 transitions. Second operand 169 states. [2019-09-03 20:01:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:44,125 INFO L93 Difference]: Finished difference Result 929 states and 1013 transitions. [2019-09-03 20:01:44,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-09-03 20:01:44,126 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 668 [2019-09-03 20:01:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:44,127 INFO L225 Difference]: With dead ends: 929 [2019-09-03 20:01:44,127 INFO L226 Difference]: Without dead ends: 672 [2019-09-03 20:01:44,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10291 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=14449, Invalid=49307, Unknown=0, NotChecked=0, Total=63756 [2019-09-03 20:01:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-03 20:01:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2019-09-03 20:01:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-09-03 20:01:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 673 transitions. [2019-09-03 20:01:44,160 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 673 transitions. Word has length 668 [2019-09-03 20:01:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:44,160 INFO L475 AbstractCegarLoop]: Abstraction has 672 states and 673 transitions. [2019-09-03 20:01:44,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-03 20:01:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 673 transitions. [2019-09-03 20:01:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-09-03 20:01:44,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:44,164 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:44,164 INFO L418 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:44,164 INFO L82 PathProgramCache]: Analyzing trace with hash -71568471, now seen corresponding path program 164 times [2019-09-03 20:01:44,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:44,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:44,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 27061 backedges. 3650 proven. 10127 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2019-09-03 20:01:47,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:47,009 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-03 20:01:47,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:01:47,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:01:47,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:47,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 1594 conjuncts, 177 conjunts are in the unsatisfiable core [2019-09-03 20:01:47,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:47,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 27061 backedges. 3649 proven. 10371 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2019-09-03 20:01:47,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:47,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 90] total 91 [2019-09-03 20:01:47,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 20:01:47,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 20:01:47,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3667, Invalid=4523, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:01:47,611 INFO L87 Difference]: Start difference. First operand 672 states and 673 transitions. Second operand 91 states. [2019-09-03 20:01:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:48,987 INFO L93 Difference]: Finished difference Result 681 states and 682 transitions. [2019-09-03 20:01:48,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 20:01:48,987 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 669 [2019-09-03 20:01:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:48,989 INFO L225 Difference]: With dead ends: 681 [2019-09-03 20:01:48,989 INFO L226 Difference]: Without dead ends: 679 [2019-09-03 20:01:48,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 748 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3680, Invalid=4876, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:01:48,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-09-03 20:01:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2019-09-03 20:01:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-03 20:01:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 680 transitions. [2019-09-03 20:01:49,022 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 680 transitions. Word has length 669 [2019-09-03 20:01:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:49,023 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 680 transitions. [2019-09-03 20:01:49,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 20:01:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 680 transitions. [2019-09-03 20:01:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-09-03 20:01:49,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:49,026 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:49,026 INFO L418 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:49,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:49,026 INFO L82 PathProgramCache]: Analyzing trace with hash 807651642, now seen corresponding path program 165 times [2019-09-03 20:01:49,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:49,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:49,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:49,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:49,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 27639 backedges. 10541 proven. 3486 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2019-09-03 20:01:56,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:56,728 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-03 20:01:56,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:01:57,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-03 20:01:57,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:57,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-03 20:01:57,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 27639 backedges. 10541 proven. 3486 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2019-09-03 20:01:57,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:57,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171, 171] total 171 [2019-09-03 20:01:57,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-03 20:01:57,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-03 20:01:57,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7311, Invalid=21759, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 20:01:57,536 INFO L87 Difference]: Start difference. First operand 679 states and 680 transitions. Second operand 171 states. [2019-09-03 20:02:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:07,106 INFO L93 Difference]: Finished difference Result 940 states and 1025 transitions. [2019-09-03 20:02:07,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-09-03 20:02:07,106 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 676 [2019-09-03 20:02:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:07,107 INFO L225 Difference]: With dead ends: 940 [2019-09-03 20:02:07,108 INFO L226 Difference]: Without dead ends: 680 [2019-09-03 20:02:07,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10541 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14791, Invalid=50489, Unknown=0, NotChecked=0, Total=65280 [2019-09-03 20:02:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-03 20:02:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2019-09-03 20:02:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-03 20:02:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 681 transitions. [2019-09-03 20:02:07,142 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 681 transitions. Word has length 676 [2019-09-03 20:02:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:07,142 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 681 transitions. [2019-09-03 20:02:07,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-03 20:02:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 681 transitions. [2019-09-03 20:02:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-09-03 20:02:07,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:07,146 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:07,146 INFO L418 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash -148411701, now seen corresponding path program 166 times [2019-09-03 20:02:07,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:07,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:07,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat