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-acceleration/array_3-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:36:13,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:36:13,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:36:13,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:36:13,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:36:13,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:36:13,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:36:13,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:36:13,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:36:13,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:36:13,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:36:13,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:36:13,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:36:13,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:36:13,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:36:13,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:36:13,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:36:13,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:36:13,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:36:13,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:36:13,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:36:13,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:36:13,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:36:13,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:36:13,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:36:13,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:36:13,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:36:13,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:36:13,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:36:13,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:36:13,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:36:13,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:36:13,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:36:13,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:36:13,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:36:13,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:36:13,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:36:13,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:36:13,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:36:13,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:36:13,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:36:13,805 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:36:13,819 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:36:13,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:36:13,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:36:13,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:36:13,820 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:36:13,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:36:13,821 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:36:13,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:36:13,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:36:13,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:36:13,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:36:13,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:36:13,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:36:13,822 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:36:13,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:36:13,823 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:36:13,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:36:13,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:36:13,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:36:13,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:36:13,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:36:13,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:36:13,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:36:13,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:36:13,824 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:36:13,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:36:13,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:36:13,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:36:13,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:36:13,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:36:13,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:36:13,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:36:13,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:36:13,877 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:36:13,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-2.i [2019-09-05 11:36:13,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4ecbc1d/0af5ef63c6104b1fae8e9b8c149e2fef/FLAGcf2bfee21 [2019-09-05 11:36:14,396 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:36:14,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-2.i [2019-09-05 11:36:14,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4ecbc1d/0af5ef63c6104b1fae8e9b8c149e2fef/FLAGcf2bfee21 [2019-09-05 11:36:14,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4ecbc1d/0af5ef63c6104b1fae8e9b8c149e2fef [2019-09-05 11:36:14,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:36:14,830 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:36:14,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:36:14,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:36:14,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:36:14,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:36:14" (1/1) ... [2019-09-05 11:36:14,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa16274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:14, skipping insertion in model container [2019-09-05 11:36:14,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:36:14" (1/1) ... [2019-09-05 11:36:14,844 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:36:14,857 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:36:15,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:36:15,028 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:36:15,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:36:15,065 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:36:15,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:15 WrapperNode [2019-09-05 11:36:15,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:36:15,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:36:15,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:36:15,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:36:15,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:15" (1/1) ... [2019-09-05 11:36:15,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:15" (1/1) ... [2019-09-05 11:36:15,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:15" (1/1) ... [2019-09-05 11:36:15,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:15" (1/1) ... [2019-09-05 11:36:15,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:15" (1/1) ... [2019-09-05 11:36:15,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:15" (1/1) ... [2019-09-05 11:36:15,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:15" (1/1) ... [2019-09-05 11:36:15,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:36:15,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:36:15,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:36:15,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:36:15,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:36:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:36:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:36:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:36:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 11:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:36:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:36:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:36:15,452 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:36:15,452 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 11:36:15,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:36:15 BoogieIcfgContainer [2019-09-05 11:36:15,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:36:15,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:36:15,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:36:15,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:36:15,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:36:14" (1/3) ... [2019-09-05 11:36:15,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c57130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:36:15, skipping insertion in model container [2019-09-05 11:36:15,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:36:15" (2/3) ... [2019-09-05 11:36:15,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c57130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:36:15, skipping insertion in model container [2019-09-05 11:36:15,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:36:15" (3/3) ... [2019-09-05 11:36:15,461 INFO L109 eAbstractionObserver]: Analyzing ICFG array_3-2.i [2019-09-05 11:36:15,471 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:36:15,478 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:36:15,519 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:36:15,556 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:36:15,557 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:36:15,557 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:36:15,557 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:36:15,557 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:36:15,557 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:36:15,557 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:36:15,558 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:36:15,558 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:36:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-05 11:36:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:36:15,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:15,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:15,591 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1584649929, now seen corresponding path program 1 times [2019-09-05 11:36:15,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:15,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:15,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:15,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:36:15,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:36:15,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:36:15,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:36:15,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:36:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:36:15,739 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-05 11:36:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:15,757 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-05 11:36:15,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:36:15,758 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-05 11:36:15,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:15,766 INFO L225 Difference]: With dead ends: 42 [2019-09-05 11:36:15,766 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 11:36:15,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:36:15,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 11:36:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-05 11:36:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 11:36:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-05 11:36:15,808 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-09-05 11:36:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:15,809 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-05 11:36:15,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:36:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-05 11:36:15,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:36:15,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:15,812 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:15,812 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:15,813 INFO L82 PathProgramCache]: Analyzing trace with hash -963606854, now seen corresponding path program 1 times [2019-09-05 11:36:15,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:15,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:15,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:15,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:15,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:36:15,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:36:15,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:36:15,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:36:15,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:36:15,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:36:15,908 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-09-05 11:36:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:15,950 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-09-05 11:36:15,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:36:15,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-05 11:36:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:15,953 INFO L225 Difference]: With dead ends: 35 [2019-09-05 11:36:15,953 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 11:36:15,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:36:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 11:36:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-09-05 11:36:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 11:36:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-05 11:36:15,960 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-09-05 11:36:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:15,961 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-05 11:36:15,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:36:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-05 11:36:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:36:15,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:15,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:15,962 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:15,963 INFO L82 PathProgramCache]: Analyzing trace with hash -544788776, now seen corresponding path program 1 times [2019-09-05 11:36:15,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:15,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:15,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:15,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:15,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:36:16,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:36:16,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:36:16,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:36:16,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:36:16,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:36:16,046 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 5 states. [2019-09-05 11:36:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:16,107 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-09-05 11:36:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:36:16,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 11:36:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:16,109 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:36:16,110 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 11:36:16,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:36:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 11:36:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-09-05 11:36:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 11:36:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-05 11:36:16,116 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2019-09-05 11:36:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:16,117 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-05 11:36:16,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:36:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-05 11:36:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:36:16,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:16,118 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:16,119 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:16,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1315898579, now seen corresponding path program 1 times [2019-09-05 11:36:16,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:16,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:16,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:16,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:16,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 11:36:16,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:16,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:16,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:16,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-05 11:36:16,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 11:36:16,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:16,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 11:36:16,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:36:16,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:36:16,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:36:16,246 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2019-09-05 11:36:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:16,291 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-09-05 11:36:16,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:36:16,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-05 11:36:16,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:16,293 INFO L225 Difference]: With dead ends: 44 [2019-09-05 11:36:16,293 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:36:16,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:36:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:36:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-09-05 11:36:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 11:36:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-09-05 11:36:16,299 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 21 [2019-09-05 11:36:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:16,299 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-09-05 11:36:16,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:36:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-09-05 11:36:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 11:36:16,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:16,301 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:16,301 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:16,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1597858191, now seen corresponding path program 2 times [2019-09-05 11:36:16,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:16,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:16,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:16,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:16,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 11:36:16,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:16,357 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-05 11:36:16,374 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-05 11:36:16,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:36:16,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:16,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 11:36:16,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 11:36:16,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:16,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-05 11:36:16,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:36:16,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:36:16,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:36:16,426 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2019-09-05 11:36:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:16,483 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-09-05 11:36:16,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:36:16,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-05 11:36:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:16,485 INFO L225 Difference]: With dead ends: 51 [2019-09-05 11:36:16,485 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 11:36:16,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:36:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 11:36:16,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-09-05 11:36:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 11:36:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-05 11:36:16,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2019-09-05 11:36:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:16,492 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-05 11:36:16,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:36:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-05 11:36:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 11:36:16,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:16,493 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:16,493 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:16,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1399437169, now seen corresponding path program 3 times [2019-09-05 11:36:16,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:16,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:16,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:16,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 11:36:16,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:16,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:36:16,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:16,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 11:36:16,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:16,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:36:16,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:16,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 11:36:16,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:16,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-05 11:36:16,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:36:16,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:36:16,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:36:16,713 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 9 states. [2019-09-05 11:36:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:16,808 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2019-09-05 11:36:16,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:36:16,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-09-05 11:36:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:16,809 INFO L225 Difference]: With dead ends: 60 [2019-09-05 11:36:16,809 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 11:36:16,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:36:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 11:36:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-05 11:36:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 11:36:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-09-05 11:36:16,816 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 25 [2019-09-05 11:36:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:16,817 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-09-05 11:36:16,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:36:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-09-05 11:36:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 11:36:16,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:16,818 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:16,819 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:16,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:16,819 INFO L82 PathProgramCache]: Analyzing trace with hash 893709598, now seen corresponding path program 4 times [2019-09-05 11:36:16,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:16,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:16,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:16,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:16,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:16,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:16,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:36:16,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:16,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:36:16,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:16,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:36:16,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:16,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:16,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:36:16,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:36:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:36:16,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:36:16,999 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-09-05 11:36:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:17,066 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-09-05 11:36:17,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:36:17,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-09-05 11:36:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:17,068 INFO L225 Difference]: With dead ends: 74 [2019-09-05 11:36:17,068 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 11:36:17,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:36:17,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 11:36:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-09-05 11:36:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 11:36:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-09-05 11:36:17,075 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2019-09-05 11:36:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:17,075 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-09-05 11:36:17,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:36:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-09-05 11:36:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:36:17,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:17,077 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:17,077 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2087492412, now seen corresponding path program 5 times [2019-09-05 11:36:17,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:17,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:17,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:17,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:17,163 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-05 11:36:17,178 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-05 11:36:17,218 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-05 11:36:17,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:17,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:36:17,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:17,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:17,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-05 11:36:17,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:36:17,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:36:17,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:36:17,243 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 9 states. [2019-09-05 11:36:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:17,323 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2019-09-05 11:36:17,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:36:17,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-09-05 11:36:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:17,324 INFO L225 Difference]: With dead ends: 81 [2019-09-05 11:36:17,324 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 11:36:17,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:36:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 11:36:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2019-09-05 11:36:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 11:36:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-09-05 11:36:17,331 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 41 [2019-09-05 11:36:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:17,331 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-09-05 11:36:17,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:36:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-09-05 11:36:17,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 11:36:17,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:17,333 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:17,333 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1738458662, now seen corresponding path program 6 times [2019-09-05 11:36:17,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:17,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:17,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:17,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:17,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:36:17,449 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:17,487 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:36:17,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:17,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:36:17,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:17,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:17,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-05 11:36:17,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:36:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:36:17,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:36:17,527 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 10 states. [2019-09-05 11:36:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:17,619 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2019-09-05 11:36:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:36:17,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-09-05 11:36:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:17,620 INFO L225 Difference]: With dead ends: 88 [2019-09-05 11:36:17,620 INFO L226 Difference]: Without dead ends: 63 [2019-09-05 11:36:17,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:36:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-05 11:36:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2019-09-05 11:36:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 11:36:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-09-05 11:36:17,628 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 43 [2019-09-05 11:36:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:17,628 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-09-05 11:36:17,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:36:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-09-05 11:36:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-05 11:36:17,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:17,630 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:17,630 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:17,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1985435400, now seen corresponding path program 7 times [2019-09-05 11:36:17,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:17,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:17,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:17,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:17,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:17,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:17,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:17,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:17,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:36:17,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:17,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:17,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-05 11:36:17,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:36:17,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:36:17,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:36:17,849 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 11 states. [2019-09-05 11:36:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:17,929 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2019-09-05 11:36:17,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:36:17,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-09-05 11:36:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:17,931 INFO L225 Difference]: With dead ends: 95 [2019-09-05 11:36:17,931 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 11:36:17,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:36:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 11:36:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2019-09-05 11:36:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 11:36:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-09-05 11:36:17,937 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 45 [2019-09-05 11:36:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:17,937 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-09-05 11:36:17,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:36:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-09-05 11:36:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-05 11:36:17,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:17,939 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:17,939 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1188087958, now seen corresponding path program 8 times [2019-09-05 11:36:17,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:17,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:18,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:18,071 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-05 11:36:18,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:36:18,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:36:18,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:18,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:36:18,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:18,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:18,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-05 11:36:18,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:36:18,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:36:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:36:18,152 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 12 states. [2019-09-05 11:36:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:18,282 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2019-09-05 11:36:18,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:36:18,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-09-05 11:36:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:18,283 INFO L225 Difference]: With dead ends: 102 [2019-09-05 11:36:18,283 INFO L226 Difference]: Without dead ends: 77 [2019-09-05 11:36:18,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:36:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-05 11:36:18,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 50. [2019-09-05 11:36:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 11:36:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-09-05 11:36:18,293 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 47 [2019-09-05 11:36:18,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:18,293 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-09-05 11:36:18,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:36:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-09-05 11:36:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 11:36:18,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:18,296 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:18,296 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:18,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1517254836, now seen corresponding path program 9 times [2019-09-05 11:36:18,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:18,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:18,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:18,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:18,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:36:18,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:18,422 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) [2019-09-05 11:36:18,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:18,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 11:36:18,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:18,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:36:18,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:18,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 11:36:18,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:18,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2019-09-05 11:36:18,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:36:18,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:36:18,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:36:18,521 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 15 states. [2019-09-05 11:36:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:18,657 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2019-09-05 11:36:18,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:36:18,658 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2019-09-05 11:36:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:18,659 INFO L225 Difference]: With dead ends: 111 [2019-09-05 11:36:18,659 INFO L226 Difference]: Without dead ends: 78 [2019-09-05 11:36:18,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:36:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-05 11:36:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-05 11:36:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 11:36:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-09-05 11:36:18,668 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 49 [2019-09-05 11:36:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:18,669 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-09-05 11:36:18,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:36:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-09-05 11:36:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-05 11:36:18,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:18,670 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:18,670 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:18,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:18,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1277783220, now seen corresponding path program 10 times [2019-09-05 11:36:18,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:18,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:18,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:18,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:18,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:18,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:18,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:36:18,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:18,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:36:18,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:18,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:36:18,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:18,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:18,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-05 11:36:18,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:36:18,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:36:18,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:36:18,935 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 14 states. [2019-09-05 11:36:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:19,038 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2019-09-05 11:36:19,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:36:19,039 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2019-09-05 11:36:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:19,040 INFO L225 Difference]: With dead ends: 134 [2019-09-05 11:36:19,040 INFO L226 Difference]: Without dead ends: 85 [2019-09-05 11:36:19,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:36:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-05 11:36:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2019-09-05 11:36:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-05 11:36:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2019-09-05 11:36:19,046 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 75 [2019-09-05 11:36:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:19,047 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2019-09-05 11:36:19,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:36:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2019-09-05 11:36:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-05 11:36:19,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:19,048 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:19,048 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1422072878, now seen corresponding path program 11 times [2019-09-05 11:36:19,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:19,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:19,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:19,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:19,194 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:19,220 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:36:19,320 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-05 11:36:19,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:19,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:36:19,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:19,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:19,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-05 11:36:19,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:36:19,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:36:19,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:36:19,365 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 15 states. [2019-09-05 11:36:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:19,469 INFO L93 Difference]: Finished difference Result 141 states and 169 transitions. [2019-09-05 11:36:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:36:19,470 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 77 [2019-09-05 11:36:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:19,471 INFO L225 Difference]: With dead ends: 141 [2019-09-05 11:36:19,471 INFO L226 Difference]: Without dead ends: 92 [2019-09-05 11:36:19,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:36:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-05 11:36:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2019-09-05 11:36:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-05 11:36:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2019-09-05 11:36:19,477 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 77 [2019-09-05 11:36:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:19,477 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2019-09-05 11:36:19,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:36:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2019-09-05 11:36:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-05 11:36:19,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:19,479 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:19,479 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:19,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:19,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1823536272, now seen corresponding path program 12 times [2019-09-05 11:36:19,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:19,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:19,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:19,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:19,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:19,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:19,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:19,669 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:36:19,801 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:36:19,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:19,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:36:19,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:19,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:19,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-05 11:36:19,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:36:19,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:36:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:36:19,840 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 16 states. [2019-09-05 11:36:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:19,951 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2019-09-05 11:36:19,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:36:19,951 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2019-09-05 11:36:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:19,952 INFO L225 Difference]: With dead ends: 148 [2019-09-05 11:36:19,952 INFO L226 Difference]: Without dead ends: 99 [2019-09-05 11:36:19,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:36:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-05 11:36:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2019-09-05 11:36:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-05 11:36:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-09-05 11:36:19,958 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 79 [2019-09-05 11:36:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:19,958 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-09-05 11:36:19,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:36:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-09-05 11:36:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-05 11:36:19,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:19,960 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:19,960 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:19,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1082801266, now seen corresponding path program 13 times [2019-09-05 11:36:19,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:19,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:19,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:19,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:19,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:20,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:20,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:20,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:20,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:36:20,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:20,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:20,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-05 11:36:20,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:36:20,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:36:20,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:36:20,208 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 17 states. [2019-09-05 11:36:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:20,323 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2019-09-05 11:36:20,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:36:20,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-09-05 11:36:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:20,324 INFO L225 Difference]: With dead ends: 155 [2019-09-05 11:36:20,324 INFO L226 Difference]: Without dead ends: 106 [2019-09-05 11:36:20,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:36:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-05 11:36:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2019-09-05 11:36:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-05 11:36:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-09-05 11:36:20,329 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 81 [2019-09-05 11:36:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:20,330 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-09-05 11:36:20,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:36:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-09-05 11:36:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-05 11:36:20,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:20,331 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:20,331 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:20,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2093935660, now seen corresponding path program 14 times [2019-09-05 11:36:20,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:20,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:20,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:20,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:20,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:20,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:20,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:20,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:36:20,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:36:20,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:20,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 11:36:20,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:20,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:20,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-05 11:36:20,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:36:20,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:36:20,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:36:20,602 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 18 states. [2019-09-05 11:36:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:20,728 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2019-09-05 11:36:20,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:36:20,728 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2019-09-05 11:36:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:20,729 INFO L225 Difference]: With dead ends: 162 [2019-09-05 11:36:20,729 INFO L226 Difference]: Without dead ends: 113 [2019-09-05 11:36:20,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:36:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-05 11:36:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 86. [2019-09-05 11:36:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-05 11:36:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-09-05 11:36:20,741 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 83 [2019-09-05 11:36:20,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:20,741 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-09-05 11:36:20,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:36:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-09-05 11:36:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-05 11:36:20,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:20,743 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:20,744 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:20,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1216374090, now seen corresponding path program 15 times [2019-09-05 11:36:20,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:20,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:20,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:20,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:20,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 11:36:20,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:20,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:20,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:36:21,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-05 11:36:21,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:21,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:36:21,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:21,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-05 11:36:21,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:21,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 21 [2019-09-05 11:36:21,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:36:21,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:36:21,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:36:21,144 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 21 states. [2019-09-05 11:36:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:21,306 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2019-09-05 11:36:21,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:36:21,306 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2019-09-05 11:36:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:21,307 INFO L225 Difference]: With dead ends: 171 [2019-09-05 11:36:21,307 INFO L226 Difference]: Without dead ends: 114 [2019-09-05 11:36:21,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=283, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:36:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-05 11:36:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-09-05 11:36:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-05 11:36:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2019-09-05 11:36:21,312 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 85 [2019-09-05 11:36:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:21,312 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2019-09-05 11:36:21,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:36:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2019-09-05 11:36:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-05 11:36:21,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:21,314 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:21,314 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1858273206, now seen corresponding path program 16 times [2019-09-05 11:36:21,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:21,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:21,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:21,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:21,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:21,499 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-05 11:36:21,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:36:21,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:36:21,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:21,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 11:36:21,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:21,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:21,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-05 11:36:21,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:36:21,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:36:21,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:36:21,614 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 20 states. [2019-09-05 11:36:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:21,739 INFO L93 Difference]: Finished difference Result 194 states and 232 transitions. [2019-09-05 11:36:21,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:36:21,740 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2019-09-05 11:36:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:21,741 INFO L225 Difference]: With dead ends: 194 [2019-09-05 11:36:21,741 INFO L226 Difference]: Without dead ends: 121 [2019-09-05 11:36:21,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:36:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-05 11:36:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-09-05 11:36:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-05 11:36:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2019-09-05 11:36:21,746 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 111 [2019-09-05 11:36:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:21,747 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2019-09-05 11:36:21,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:36:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2019-09-05 11:36:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-05 11:36:21,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:21,748 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:21,748 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:21,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:21,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1942732904, now seen corresponding path program 17 times [2019-09-05 11:36:21,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:21,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:21,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:21,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:21,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:21,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:21,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:21,969 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:36:22,222 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-05 11:36:22,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:22,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:36:22,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:22,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:22,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-05 11:36:22,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:36:22,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:36:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:36:22,285 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 21 states. [2019-09-05 11:36:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:22,443 INFO L93 Difference]: Finished difference Result 201 states and 241 transitions. [2019-09-05 11:36:22,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:36:22,443 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 113 [2019-09-05 11:36:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:22,444 INFO L225 Difference]: With dead ends: 201 [2019-09-05 11:36:22,444 INFO L226 Difference]: Without dead ends: 128 [2019-09-05 11:36:22,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:36:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-05 11:36:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-09-05 11:36:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-05 11:36:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2019-09-05 11:36:22,450 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 113 [2019-09-05 11:36:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:22,450 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2019-09-05 11:36:22,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:36:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2019-09-05 11:36:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-05 11:36:22,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:22,452 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:22,452 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:22,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash -307564282, now seen corresponding path program 18 times [2019-09-05 11:36:22,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:22,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:22,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:22,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:36:22,727 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:23,415 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 11:36:23,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:23,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 11:36:23,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:23,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:23,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-05 11:36:23,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:36:23,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:36:23,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:36:23,471 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 22 states. [2019-09-05 11:36:23,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:23,631 INFO L93 Difference]: Finished difference Result 208 states and 250 transitions. [2019-09-05 11:36:23,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:36:23,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2019-09-05 11:36:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:23,633 INFO L225 Difference]: With dead ends: 208 [2019-09-05 11:36:23,633 INFO L226 Difference]: Without dead ends: 135 [2019-09-05 11:36:23,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:36:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-05 11:36:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2019-09-05 11:36:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-05 11:36:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2019-09-05 11:36:23,638 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 115 [2019-09-05 11:36:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:23,638 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2019-09-05 11:36:23,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:36:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2019-09-05 11:36:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-05 11:36:23,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:23,639 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:23,640 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:23,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1820357156, now seen corresponding path program 19 times [2019-09-05 11:36:23,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:23,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:23,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:23,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:23,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:36:23,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:23,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:36:23,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:24,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:24,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-05 11:36:24,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:36:24,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:36:24,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:36:24,007 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 23 states. [2019-09-05 11:36:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:24,169 INFO L93 Difference]: Finished difference Result 215 states and 259 transitions. [2019-09-05 11:36:24,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:36:24,171 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-09-05 11:36:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:24,172 INFO L225 Difference]: With dead ends: 215 [2019-09-05 11:36:24,172 INFO L226 Difference]: Without dead ends: 142 [2019-09-05 11:36:24,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:36:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-05 11:36:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 120. [2019-09-05 11:36:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-05 11:36:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2019-09-05 11:36:24,176 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 117 [2019-09-05 11:36:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:24,177 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2019-09-05 11:36:24,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:36:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2019-09-05 11:36:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-05 11:36:24,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:24,178 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:24,178 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:24,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:24,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1946541118, now seen corresponding path program 20 times [2019-09-05 11:36:24,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:24,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:24,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:24,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:24,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:24,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:36:24,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:36:24,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:24,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 11:36:24,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:24,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:24,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-05 11:36:24,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:36:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:36:24,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:36:24,593 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand 24 states. [2019-09-05 11:36:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:24,781 INFO L93 Difference]: Finished difference Result 222 states and 268 transitions. [2019-09-05 11:36:24,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:36:24,781 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 119 [2019-09-05 11:36:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:24,782 INFO L225 Difference]: With dead ends: 222 [2019-09-05 11:36:24,782 INFO L226 Difference]: Without dead ends: 149 [2019-09-05 11:36:24,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:36:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-05 11:36:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2019-09-05 11:36:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-05 11:36:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2019-09-05 11:36:24,788 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 119 [2019-09-05 11:36:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:24,788 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2019-09-05 11:36:24,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:36:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2019-09-05 11:36:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-05 11:36:24,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:24,789 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:24,793 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:24,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:24,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1278351904, now seen corresponding path program 21 times [2019-09-05 11:36:24,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:24,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:24,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:24,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-05 11:36:25,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:25,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:25,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:36:25,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-05 11:36:25,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:25,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:36:25,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:25,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-05 11:36:25,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:25,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 27 [2019-09-05 11:36:25,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:36:25,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:36:25,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:36:25,907 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 27 states. [2019-09-05 11:36:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:26,124 INFO L93 Difference]: Finished difference Result 231 states and 279 transitions. [2019-09-05 11:36:26,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:36:26,125 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 121 [2019-09-05 11:36:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:26,126 INFO L225 Difference]: With dead ends: 231 [2019-09-05 11:36:26,127 INFO L226 Difference]: Without dead ends: 150 [2019-09-05 11:36:26,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=448, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:36:26,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-05 11:36:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-05 11:36:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-05 11:36:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2019-09-05 11:36:26,133 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 121 [2019-09-05 11:36:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:26,133 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2019-09-05 11:36:26,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:36:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2019-09-05 11:36:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-05 11:36:26,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:26,134 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:26,134 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1942005728, now seen corresponding path program 22 times [2019-09-05 11:36:26,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:26,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:26,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:26,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:26,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:26,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:36:26,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:36:26,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:26,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 11:36:26,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:26,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:26,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-05 11:36:26,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:36:26,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:36:26,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:36:26,521 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand 26 states. [2019-09-05 11:36:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:26,731 INFO L93 Difference]: Finished difference Result 254 states and 304 transitions. [2019-09-05 11:36:26,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:36:26,731 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 147 [2019-09-05 11:36:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:26,733 INFO L225 Difference]: With dead ends: 254 [2019-09-05 11:36:26,733 INFO L226 Difference]: Without dead ends: 157 [2019-09-05 11:36:26,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:36:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-05 11:36:26,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2019-09-05 11:36:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-05 11:36:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2019-09-05 11:36:26,740 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 147 [2019-09-05 11:36:26,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:26,740 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2019-09-05 11:36:26,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:36:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2019-09-05 11:36:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-05 11:36:26,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:26,741 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:26,742 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:26,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:26,742 INFO L82 PathProgramCache]: Analyzing trace with hash -744869634, now seen corresponding path program 23 times [2019-09-05 11:36:26,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:26,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:26,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:26,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:26,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:27,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:27,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:27,080 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:36:27,664 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-05 11:36:27,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:27,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 11:36:27,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:27,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:27,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-05 11:36:27,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:36:27,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:36:27,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:36:27,702 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand 27 states. [2019-09-05 11:36:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:27,895 INFO L93 Difference]: Finished difference Result 261 states and 313 transitions. [2019-09-05 11:36:27,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:36:27,895 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 149 [2019-09-05 11:36:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:27,896 INFO L225 Difference]: With dead ends: 261 [2019-09-05 11:36:27,896 INFO L226 Difference]: Without dead ends: 164 [2019-09-05 11:36:27,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:36:27,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-05 11:36:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-09-05 11:36:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-05 11:36:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2019-09-05 11:36:27,901 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 149 [2019-09-05 11:36:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:27,901 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2019-09-05 11:36:27,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:36:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2019-09-05 11:36:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-05 11:36:27,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:27,902 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:27,903 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1556747620, now seen corresponding path program 24 times [2019-09-05 11:36:27,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:27,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:27,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:28,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:28,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 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-05 11:36:28,255 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:36:30,500 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-05 11:36:30,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:30,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 11:36:30,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:30,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:30,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-05 11:36:30,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:36:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:36:30,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:36:30,542 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand 28 states. [2019-09-05 11:36:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:30,717 INFO L93 Difference]: Finished difference Result 268 states and 322 transitions. [2019-09-05 11:36:30,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:36:30,718 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 151 [2019-09-05 11:36:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:30,720 INFO L225 Difference]: With dead ends: 268 [2019-09-05 11:36:30,720 INFO L226 Difference]: Without dead ends: 171 [2019-09-05 11:36:30,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:36:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-05 11:36:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2019-09-05 11:36:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-05 11:36:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2019-09-05 11:36:30,726 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 151 [2019-09-05 11:36:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:30,726 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2019-09-05 11:36:30,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:36:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2019-09-05 11:36:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-05 11:36:30,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:30,728 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:30,728 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash -87444294, now seen corresponding path program 25 times [2019-09-05 11:36:30,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:30,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:30,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:31,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:31,120 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) [2019-09-05 11:36:31,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:31,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:36:31,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:31,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:31,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-05 11:36:31,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:36:31,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:36:31,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:36:31,227 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 29 states. [2019-09-05 11:36:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:31,447 INFO L93 Difference]: Finished difference Result 275 states and 331 transitions. [2019-09-05 11:36:31,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:36:31,454 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 153 [2019-09-05 11:36:31,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:31,456 INFO L225 Difference]: With dead ends: 275 [2019-09-05 11:36:31,456 INFO L226 Difference]: Without dead ends: 178 [2019-09-05 11:36:31,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:36:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-05 11:36:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 156. [2019-09-05 11:36:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-05 11:36:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2019-09-05 11:36:31,462 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 153 [2019-09-05 11:36:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:31,463 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2019-09-05 11:36:31,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:36:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2019-09-05 11:36:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-05 11:36:31,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:31,464 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:31,465 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:31,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1131188392, now seen corresponding path program 26 times [2019-09-05 11:36:31,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:31,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:31,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:32,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:32,025 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-05 11:36:32,055 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-05 11:36:32,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:36:32,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:32,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 11:36:32,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:32,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:32,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-05 11:36:32,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:36:32,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:36:32,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:36:32,163 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 30 states. [2019-09-05 11:36:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:32,557 INFO L93 Difference]: Finished difference Result 282 states and 340 transitions. [2019-09-05 11:36:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:36:32,558 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 155 [2019-09-05 11:36:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:32,559 INFO L225 Difference]: With dead ends: 282 [2019-09-05 11:36:32,560 INFO L226 Difference]: Without dead ends: 185 [2019-09-05 11:36:32,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:36:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-05 11:36:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2019-09-05 11:36:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-05 11:36:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2019-09-05 11:36:32,570 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 155 [2019-09-05 11:36:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:32,571 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2019-09-05 11:36:32,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:36:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2019-09-05 11:36:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-05 11:36:32,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:32,573 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:32,573 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:32,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:32,574 INFO L82 PathProgramCache]: Analyzing trace with hash 853080694, now seen corresponding path program 27 times [2019-09-05 11:36:32,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:32,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:32,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 11:36:33,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:33,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:33,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:36:34,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-05 11:36:34,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:34,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:36:34,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:34,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-05 11:36:34,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:34,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 33 [2019-09-05 11:36:34,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:36:34,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:36:34,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=587, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:36:34,967 INFO L87 Difference]: Start difference. First operand 158 states and 182 transitions. Second operand 33 states. [2019-09-05 11:36:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:35,256 INFO L93 Difference]: Finished difference Result 291 states and 351 transitions. [2019-09-05 11:36:35,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:36:35,257 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 157 [2019-09-05 11:36:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:35,258 INFO L225 Difference]: With dead ends: 291 [2019-09-05 11:36:35,258 INFO L226 Difference]: Without dead ends: 186 [2019-09-05 11:36:35,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=473, Invalid=649, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:36:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-05 11:36:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-05 11:36:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-05 11:36:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions. [2019-09-05 11:36:35,266 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 157 [2019-09-05 11:36:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:35,267 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 214 transitions. [2019-09-05 11:36:35,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:36:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions. [2019-09-05 11:36:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-05 11:36:35,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:35,268 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:35,269 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:35,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:35,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1433756534, now seen corresponding path program 28 times [2019-09-05 11:36:35,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:35,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:35,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:35,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:35,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-05 11:36:35,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:35,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:35,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:36:35,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:36:35,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:35,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 11:36:35,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-05 11:36:35,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:35,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-05 11:36:35,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:36:35,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:36:35,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:36:35,942 INFO L87 Difference]: Start difference. First operand 184 states and 214 transitions. Second operand 32 states. [2019-09-05 11:36:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:36,170 INFO L93 Difference]: Finished difference Result 314 states and 376 transitions. [2019-09-05 11:36:36,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:36:36,170 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 183 [2019-09-05 11:36:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:36,172 INFO L225 Difference]: With dead ends: 314 [2019-09-05 11:36:36,172 INFO L226 Difference]: Without dead ends: 193 [2019-09-05 11:36:36,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:36:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-05 11:36:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 186. [2019-09-05 11:36:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-05 11:36:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 216 transitions. [2019-09-05 11:36:36,178 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 216 transitions. Word has length 183 [2019-09-05 11:36:36,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:36,179 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 216 transitions. [2019-09-05 11:36:36,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:36:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 216 transitions. [2019-09-05 11:36:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-05 11:36:36,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:36,180 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:36,181 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:36,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1700186732, now seen corresponding path program 29 times [2019-09-05 11:36:36,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:36,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:36,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:36,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-05 11:36:36,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:36,742 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-05 11:36:36,756 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-05 11:36:38,549 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-05 11:36:38,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:38,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:36:38,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:36:38,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:38,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-05 11:36:38,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:36:38,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:36:38,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:36:38,604 INFO L87 Difference]: Start difference. First operand 186 states and 216 transitions. Second operand 33 states. [2019-09-05 11:36:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:38,815 INFO L93 Difference]: Finished difference Result 321 states and 385 transitions. [2019-09-05 11:36:38,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:36:38,815 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 185 [2019-09-05 11:36:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:38,817 INFO L225 Difference]: With dead ends: 321 [2019-09-05 11:36:38,817 INFO L226 Difference]: Without dead ends: 200 [2019-09-05 11:36:38,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:36:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-05 11:36:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 188. [2019-09-05 11:36:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-05 11:36:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 218 transitions. [2019-09-05 11:36:38,824 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 218 transitions. Word has length 185 [2019-09-05 11:36:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:38,824 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 218 transitions. [2019-09-05 11:36:38,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:36:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 218 transitions. [2019-09-05 11:36:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-05 11:36:38,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:38,826 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:38,826 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:38,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:38,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1647376434, now seen corresponding path program 30 times [2019-09-05 11:36:38,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:38,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:38,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:38,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:38,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2496 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-05 11:36:39,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:39,472 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-05 11:36:39,491 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-05 11:36:46,838 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-05 11:36:46,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:46,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 11:36:46,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2496 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:36:46,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:46,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-05 11:36:46,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 11:36:46,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 11:36:46,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:36:46,896 INFO L87 Difference]: Start difference. First operand 188 states and 218 transitions. Second operand 34 states. [2019-09-05 11:36:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:47,142 INFO L93 Difference]: Finished difference Result 328 states and 394 transitions. [2019-09-05 11:36:47,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:36:47,142 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 187 [2019-09-05 11:36:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:47,143 INFO L225 Difference]: With dead ends: 328 [2019-09-05 11:36:47,143 INFO L226 Difference]: Without dead ends: 207 [2019-09-05 11:36:47,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:36:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-05 11:36:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2019-09-05 11:36:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-05 11:36:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2019-09-05 11:36:47,149 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 187 [2019-09-05 11:36:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:47,150 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2019-09-05 11:36:47,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 11:36:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2019-09-05 11:36:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-05 11:36:47,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:47,151 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:47,151 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1725074256, now seen corresponding path program 31 times [2019-09-05 11:36:47,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:47,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:47,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-05 11:36:47,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:47,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:36:47,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:47,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:36:47,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-05 11:36:47,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:47,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-05 11:36:47,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 11:36:47,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 11:36:47,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:36:47,836 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand 35 states. [2019-09-05 11:36:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:48,139 INFO L93 Difference]: Finished difference Result 335 states and 403 transitions. [2019-09-05 11:36:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 11:36:48,139 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2019-09-05 11:36:48,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:48,141 INFO L225 Difference]: With dead ends: 335 [2019-09-05 11:36:48,141 INFO L226 Difference]: Without dead ends: 214 [2019-09-05 11:36:48,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:36:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-05 11:36:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 192. [2019-09-05 11:36:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-05 11:36:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2019-09-05 11:36:48,148 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 189 [2019-09-05 11:36:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:48,148 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2019-09-05 11:36:48,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 11:36:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2019-09-05 11:36:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-05 11:36:48,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:48,150 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:48,150 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:48,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:48,150 INFO L82 PathProgramCache]: Analyzing trace with hash -916730130, now seen corresponding path program 32 times [2019-09-05 11:36:48,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:48,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:48,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:48,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:36:48,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2620 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-05 11:36:48,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:48,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:48,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:36:48,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:36:48,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:48,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:36:48,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2620 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-05 11:36:48,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:48,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-05 11:36:48,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:36:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:36:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:36:48,953 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 36 states. [2019-09-05 11:36:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:49,242 INFO L93 Difference]: Finished difference Result 342 states and 412 transitions. [2019-09-05 11:36:49,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 11:36:49,243 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 191 [2019-09-05 11:36:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:49,245 INFO L225 Difference]: With dead ends: 342 [2019-09-05 11:36:49,245 INFO L226 Difference]: Without dead ends: 221 [2019-09-05 11:36:49,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:36:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-05 11:36:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2019-09-05 11:36:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-05 11:36:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 224 transitions. [2019-09-05 11:36:49,252 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 224 transitions. Word has length 191 [2019-09-05 11:36:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:49,252 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 224 transitions. [2019-09-05 11:36:49,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:36:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 224 transitions. [2019-09-05 11:36:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-05 11:36:49,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:49,253 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:49,254 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:49,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1365073140, now seen corresponding path program 33 times [2019-09-05 11:36:49,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:49,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:49,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2685 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-09-05 11:36:49,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:49,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:49,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:36:55,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-05 11:36:55,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:55,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:36:55,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:55,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2685 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-05 11:36:55,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:55,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 39 [2019-09-05 11:36:55,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:36:55,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:36:55,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:36:55,527 INFO L87 Difference]: Start difference. First operand 194 states and 224 transitions. Second operand 39 states. [2019-09-05 11:36:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:55,833 INFO L93 Difference]: Finished difference Result 351 states and 423 transitions. [2019-09-05 11:36:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 11:36:55,833 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 193 [2019-09-05 11:36:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:55,835 INFO L225 Difference]: With dead ends: 351 [2019-09-05 11:36:55,835 INFO L226 Difference]: Without dead ends: 222 [2019-09-05 11:36:55,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=674, Invalid=886, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:36:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-05 11:36:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-09-05 11:36:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-05 11:36:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2019-09-05 11:36:55,843 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 193 [2019-09-05 11:36:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:55,844 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2019-09-05 11:36:55,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:36:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2019-09-05 11:36:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-05 11:36:55,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:55,845 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:55,846 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:55,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1251750668, now seen corresponding path program 34 times [2019-09-05 11:36:55,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:55,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:55,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:55,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:55,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-05 11:36:56,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:56,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:56,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:36:56,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:36:56,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:56,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 11:36:56,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:36:56,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:56,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-05 11:36:56,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 11:36:56,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 11:36:56,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:36:56,552 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand 38 states. [2019-09-05 11:36:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:56,810 INFO L93 Difference]: Finished difference Result 374 states and 448 transitions. [2019-09-05 11:36:56,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:36:56,810 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 219 [2019-09-05 11:36:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:56,811 INFO L225 Difference]: With dead ends: 374 [2019-09-05 11:36:56,811 INFO L226 Difference]: Without dead ends: 229 [2019-09-05 11:36:56,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:36:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-05 11:36:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 222. [2019-09-05 11:36:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-05 11:36:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 258 transitions. [2019-09-05 11:36:56,818 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 258 transitions. Word has length 219 [2019-09-05 11:36:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:56,818 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 258 transitions. [2019-09-05 11:36:56,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 11:36:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 258 transitions. [2019-09-05 11:36:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-05 11:36:56,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:56,820 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:56,820 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:56,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:56,820 INFO L82 PathProgramCache]: Analyzing trace with hash 729402922, now seen corresponding path program 35 times [2019-09-05 11:36:56,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:56,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:56,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:56,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:56,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3571 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-05 11:36:57,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:57,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:57,426 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:37:00,427 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-05 11:37:00,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:00,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:37:00,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3571 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-05 11:37:00,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:00,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-05 11:37:00,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:37:00,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:37:00,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:37:00,488 INFO L87 Difference]: Start difference. First operand 222 states and 258 transitions. Second operand 39 states. [2019-09-05 11:37:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:00,781 INFO L93 Difference]: Finished difference Result 381 states and 457 transitions. [2019-09-05 11:37:00,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 11:37:00,781 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 221 [2019-09-05 11:37:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:00,783 INFO L225 Difference]: With dead ends: 381 [2019-09-05 11:37:00,783 INFO L226 Difference]: Without dead ends: 236 [2019-09-05 11:37:00,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:37:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-05 11:37:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 224. [2019-09-05 11:37:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-05 11:37:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 260 transitions. [2019-09-05 11:37:00,790 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 260 transitions. Word has length 221 [2019-09-05 11:37:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:00,790 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 260 transitions. [2019-09-05 11:37:00,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:37:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 260 transitions. [2019-09-05 11:37:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-05 11:37:00,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:00,792 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:00,792 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1264392648, now seen corresponding path program 36 times [2019-09-05 11:37:00,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:00,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:00,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:00,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:00,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-05 11:37:01,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:01,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:01,384 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:37:36,675 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-05 11:37:36,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:36,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:37:36,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-05 11:37:36,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:36,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-05 11:37:36,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 11:37:36,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 11:37:36,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:37:36,780 INFO L87 Difference]: Start difference. First operand 224 states and 260 transitions. Second operand 40 states. [2019-09-05 11:37:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:37,075 INFO L93 Difference]: Finished difference Result 388 states and 466 transitions. [2019-09-05 11:37:37,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 11:37:37,076 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 223 [2019-09-05 11:37:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:37,077 INFO L225 Difference]: With dead ends: 388 [2019-09-05 11:37:37,077 INFO L226 Difference]: Without dead ends: 243 [2019-09-05 11:37:37,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:37:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-05 11:37:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 226. [2019-09-05 11:37:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-05 11:37:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 262 transitions. [2019-09-05 11:37:37,084 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 262 transitions. Word has length 223 [2019-09-05 11:37:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:37,084 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 262 transitions. [2019-09-05 11:37:37,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 11:37:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 262 transitions. [2019-09-05 11:37:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-05 11:37:37,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:37,086 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:37,086 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:37,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:37,087 INFO L82 PathProgramCache]: Analyzing trace with hash -6556186, now seen corresponding path program 37 times [2019-09-05 11:37:37,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:37,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:37,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:37,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:37,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3715 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-05 11:37:37,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:37,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:37,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:37:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:37,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:37:37,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3715 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:37:38,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:38,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-05 11:37:38,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 11:37:38,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 11:37:38,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:37:38,006 INFO L87 Difference]: Start difference. First operand 226 states and 262 transitions. Second operand 41 states. [2019-09-05 11:37:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:38,303 INFO L93 Difference]: Finished difference Result 395 states and 475 transitions. [2019-09-05 11:37:38,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 11:37:38,304 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 225 [2019-09-05 11:37:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:38,305 INFO L225 Difference]: With dead ends: 395 [2019-09-05 11:37:38,305 INFO L226 Difference]: Without dead ends: 250 [2019-09-05 11:37:38,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:37:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-05 11:37:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 228. [2019-09-05 11:37:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-05 11:37:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 264 transitions. [2019-09-05 11:37:38,311 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 264 transitions. Word has length 225 [2019-09-05 11:37:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:38,312 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 264 transitions. [2019-09-05 11:37:38,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 11:37:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 264 transitions. [2019-09-05 11:37:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-05 11:37:38,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:38,313 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:38,314 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:38,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1617673596, now seen corresponding path program 38 times [2019-09-05 11:37:38,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:38,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:38,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:38,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:37:38,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3790 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-05 11:37:38,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:38,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:39,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:37:39,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:37:39,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:39,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-05 11:37:39,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3790 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:37:39,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:39,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-05 11:37:39,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 11:37:39,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 11:37:39,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 11:37:39,138 INFO L87 Difference]: Start difference. First operand 228 states and 264 transitions. Second operand 42 states. [2019-09-05 11:37:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:39,461 INFO L93 Difference]: Finished difference Result 402 states and 484 transitions. [2019-09-05 11:37:39,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 11:37:39,462 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 227 [2019-09-05 11:37:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:39,464 INFO L225 Difference]: With dead ends: 402 [2019-09-05 11:37:39,464 INFO L226 Difference]: Without dead ends: 257 [2019-09-05 11:37:39,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 11:37:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-05 11:37:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 230. [2019-09-05 11:37:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-05 11:37:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 266 transitions. [2019-09-05 11:37:39,471 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 266 transitions. Word has length 227 [2019-09-05 11:37:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:39,471 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 266 transitions. [2019-09-05 11:37:39,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 11:37:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 266 transitions. [2019-09-05 11:37:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-05 11:37:39,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:39,473 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:39,473 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:39,474 INFO L82 PathProgramCache]: Analyzing trace with hash 581689250, now seen corresponding path program 39 times [2019-09-05 11:37:39,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:39,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:39,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:39,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3867 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-09-05 11:37:40,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:40,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:37:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:53,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-05 11:37:53,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:53,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:37:53,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:53,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:37:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3867 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-09-05 11:37:53,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:53,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 39] total 45 [2019-09-05 11:37:53,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 11:37:53,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 11:37:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=1073, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:37:53,920 INFO L87 Difference]: Start difference. First operand 230 states and 266 transitions. Second operand 45 states. [2019-09-05 11:37:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:54,291 INFO L93 Difference]: Finished difference Result 411 states and 495 transitions. [2019-09-05 11:37:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 11:37:54,291 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 229 [2019-09-05 11:37:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:54,293 INFO L225 Difference]: With dead ends: 411 [2019-09-05 11:37:54,293 INFO L226 Difference]: Without dead ends: 258 [2019-09-05 11:37:54,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=911, Invalid=1159, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:37:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-05 11:37:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-05 11:37:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-05 11:37:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 298 transitions. [2019-09-05 11:37:54,300 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 298 transitions. Word has length 229 [2019-09-05 11:37:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:54,300 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 298 transitions. [2019-09-05 11:37:54,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 11:37:54,300 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 298 transitions. [2019-09-05 11:37:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-05 11:37:54,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:54,302 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:54,302 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:54,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:54,303 INFO L82 PathProgramCache]: Analyzing trace with hash -638183774, now seen corresponding path program 40 times [2019-09-05 11:37:54,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:54,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:54,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:54,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:54,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4840 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-05 11:37:55,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:55,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:55,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:37:55,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:37:55,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:55,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 11:37:55,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4840 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-05 11:37:55,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:55,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-05 11:37:55,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 11:37:55,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 11:37:55,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:37:55,197 INFO L87 Difference]: Start difference. First operand 256 states and 298 transitions. Second operand 44 states. [2019-09-05 11:37:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:55,517 INFO L93 Difference]: Finished difference Result 434 states and 520 transitions. [2019-09-05 11:37:55,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 11:37:55,518 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 255 [2019-09-05 11:37:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:55,519 INFO L225 Difference]: With dead ends: 434 [2019-09-05 11:37:55,519 INFO L226 Difference]: Without dead ends: 265 [2019-09-05 11:37:55,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:37:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-05 11:37:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 258. [2019-09-05 11:37:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-05 11:37:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 300 transitions. [2019-09-05 11:37:55,526 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 300 transitions. Word has length 255 [2019-09-05 11:37:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:55,526 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 300 transitions. [2019-09-05 11:37:55,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 11:37:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 300 transitions. [2019-09-05 11:37:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-05 11:37:55,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:55,528 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:55,528 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:55,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash 990706368, now seen corresponding path program 41 times [2019-09-05 11:37:55,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:55,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:55,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-05 11:37:56,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:56,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:56,296 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:37:59,484 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-05 11:37:59,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:59,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:37:59,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-05 11:37:59,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:59,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-05 11:37:59,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 11:37:59,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 11:37:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:37:59,551 INFO L87 Difference]: Start difference. First operand 258 states and 300 transitions. Second operand 45 states. [2019-09-05 11:37:59,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:59,959 INFO L93 Difference]: Finished difference Result 441 states and 529 transitions. [2019-09-05 11:37:59,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 11:37:59,961 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 257 [2019-09-05 11:37:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:59,962 INFO L225 Difference]: With dead ends: 441 [2019-09-05 11:37:59,962 INFO L226 Difference]: Without dead ends: 272 [2019-09-05 11:37:59,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:37:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-05 11:37:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-05 11:37:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-05 11:37:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 302 transitions. [2019-09-05 11:37:59,970 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 302 transitions. Word has length 257 [2019-09-05 11:37:59,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:59,970 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 302 transitions. [2019-09-05 11:37:59,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 11:37:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 302 transitions. [2019-09-05 11:37:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-05 11:37:59,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:59,972 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:59,972 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1308930210, now seen corresponding path program 42 times [2019-09-05 11:37:59,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:59,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:59,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:38:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5004 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-05 11:38:00,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:38:00,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:38:00,999 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:39:04,522 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-05 11:39:04,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:39:04,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 11:39:04,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5004 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-05 11:39:04,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:04,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-05 11:39:04,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 11:39:04,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 11:39:04,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:39:04,637 INFO L87 Difference]: Start difference. First operand 260 states and 302 transitions. Second operand 46 states. [2019-09-05 11:39:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:04,984 INFO L93 Difference]: Finished difference Result 448 states and 538 transitions. [2019-09-05 11:39:04,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 11:39:04,985 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 259 [2019-09-05 11:39:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:04,986 INFO L225 Difference]: With dead ends: 448 [2019-09-05 11:39:04,986 INFO L226 Difference]: Without dead ends: 279 [2019-09-05 11:39:04,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:39:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-05 11:39:04,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 262. [2019-09-05 11:39:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-05 11:39:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 304 transitions. [2019-09-05 11:39:04,992 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 304 transitions. Word has length 259 [2019-09-05 11:39:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:04,992 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 304 transitions. [2019-09-05 11:39:04,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 11:39:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 304 transitions. [2019-09-05 11:39:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-05 11:39:04,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:04,994 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:04,994 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:04,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:04,995 INFO L82 PathProgramCache]: Analyzing trace with hash 648475772, now seen corresponding path program 43 times [2019-09-05 11:39:04,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:04,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:04,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:04,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:04,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5089 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-05 11:39:05,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:05,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:05,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:39:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:06,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 11:39:06,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5089 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 3240 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-05 11:39:06,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:06,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-05 11:39:06,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 11:39:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 11:39:06,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:39:06,099 INFO L87 Difference]: Start difference. First operand 262 states and 304 transitions. Second operand 47 states. [2019-09-05 11:39:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:06,533 INFO L93 Difference]: Finished difference Result 455 states and 547 transitions. [2019-09-05 11:39:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 11:39:06,533 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 261 [2019-09-05 11:39:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:06,535 INFO L225 Difference]: With dead ends: 455 [2019-09-05 11:39:06,535 INFO L226 Difference]: Without dead ends: 286 [2019-09-05 11:39:06,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:39:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-05 11:39:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 264. [2019-09-05 11:39:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-05 11:39:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 306 transitions. [2019-09-05 11:39:06,542 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 306 transitions. Word has length 261 [2019-09-05 11:39:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:06,542 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 306 transitions. [2019-09-05 11:39:06,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 11:39:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 306 transitions. [2019-09-05 11:39:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-05 11:39:06,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:06,544 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:06,544 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:06,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:06,545 INFO L82 PathProgramCache]: Analyzing trace with hash 519948826, now seen corresponding path program 44 times [2019-09-05 11:39:06,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:06,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:06,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:06,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:39:06,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5176 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-05 11:39:07,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:07,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:07,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:39:07,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:39:07,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:39:07,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 11:39:07,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5176 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-05 11:39:07,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:07,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-05 11:39:07,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-05 11:39:07,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-05 11:39:07,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 11:39:07,595 INFO L87 Difference]: Start difference. First operand 264 states and 306 transitions. Second operand 48 states. [2019-09-05 11:39:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:07,986 INFO L93 Difference]: Finished difference Result 462 states and 556 transitions. [2019-09-05 11:39:07,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 11:39:07,987 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 263 [2019-09-05 11:39:07,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:07,988 INFO L225 Difference]: With dead ends: 462 [2019-09-05 11:39:07,988 INFO L226 Difference]: Without dead ends: 293 [2019-09-05 11:39:07,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 11:39:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-05 11:39:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 266. [2019-09-05 11:39:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-05 11:39:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 308 transitions. [2019-09-05 11:39:07,993 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 308 transitions. Word has length 263 [2019-09-05 11:39:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:07,994 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 308 transitions. [2019-09-05 11:39:07,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-05 11:39:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 308 transitions. [2019-09-05 11:39:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-05 11:39:07,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:07,996 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:07,996 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:07,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:07,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1559605304, now seen corresponding path program 45 times [2019-09-05 11:39:07,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:07,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:07,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:07,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:07,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-05 11:39:09,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:09,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:09,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:39:40,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-09-05 11:39:40,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:39:40,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 11:39:40,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:40,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-05 11:39:40,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:40,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 45] total 50 [2019-09-05 11:39:40,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 11:39:40,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 11:39:40,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:39:40,614 INFO L87 Difference]: Start difference. First operand 266 states and 308 transitions. Second operand 50 states. [2019-09-05 11:39:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:41,040 INFO L93 Difference]: Finished difference Result 471 states and 567 transitions. [2019-09-05 11:39:41,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-05 11:39:41,041 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 265 [2019-09-05 11:39:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:41,042 INFO L225 Difference]: With dead ends: 471 [2019-09-05 11:39:41,043 INFO L226 Difference]: Without dead ends: 294 [2019-09-05 11:39:41,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1136, Invalid=1414, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 11:39:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-05 11:39:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-09-05 11:39:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-05 11:39:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 340 transitions. [2019-09-05 11:39:41,050 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 340 transitions. Word has length 265 [2019-09-05 11:39:41,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:41,051 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 340 transitions. [2019-09-05 11:39:41,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 11:39:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 340 transitions. [2019-09-05 11:39:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-05 11:39:41,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:41,053 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:41,053 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1128001992, now seen corresponding path program 46 times [2019-09-05 11:39:41,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:41,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:41,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:41,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:41,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-05 11:39:42,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:42,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:42,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:39:42,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:39:42,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:39:42,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 11:39:42,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 4278 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-05 11:39:42,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:42,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-05 11:39:42,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 11:39:42,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 11:39:42,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:39:42,260 INFO L87 Difference]: Start difference. First operand 292 states and 340 transitions. Second operand 50 states. [2019-09-05 11:39:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:42,723 INFO L93 Difference]: Finished difference Result 494 states and 592 transitions. [2019-09-05 11:39:42,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 11:39:42,723 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 291 [2019-09-05 11:39:42,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:42,726 INFO L225 Difference]: With dead ends: 494 [2019-09-05 11:39:42,726 INFO L226 Difference]: Without dead ends: 301 [2019-09-05 11:39:42,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:39:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-05 11:39:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 294. [2019-09-05 11:39:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-05 11:39:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 342 transitions. [2019-09-05 11:39:42,742 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 342 transitions. Word has length 291 [2019-09-05 11:39:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:42,743 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 342 transitions. [2019-09-05 11:39:42,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 11:39:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 342 transitions. [2019-09-05 11:39:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-05 11:39:42,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:42,746 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:42,747 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1864123562, now seen corresponding path program 47 times [2019-09-05 11:39:42,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:42,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:42,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6487 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-05 11:39:43,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:43,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:43,793 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:39:58,480 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-05 11:39:58,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:39:58,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:39:58,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6487 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-05 11:39:58,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:58,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-05 11:39:58,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 11:39:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 11:39:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 11:39:58,573 INFO L87 Difference]: Start difference. First operand 294 states and 342 transitions. Second operand 51 states. [2019-09-05 11:39:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:59,187 INFO L93 Difference]: Finished difference Result 501 states and 601 transitions. [2019-09-05 11:39:59,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-05 11:39:59,188 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 293 [2019-09-05 11:39:59,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:59,189 INFO L225 Difference]: With dead ends: 501 [2019-09-05 11:39:59,190 INFO L226 Difference]: Without dead ends: 308 [2019-09-05 11:39:59,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 11:39:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-05 11:39:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 296. [2019-09-05 11:39:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-05 11:39:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 344 transitions. [2019-09-05 11:39:59,196 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 344 transitions. Word has length 293 [2019-09-05 11:39:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:59,196 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 344 transitions. [2019-09-05 11:39:59,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 11:39:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 344 transitions. [2019-09-05 11:39:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-05 11:39:59,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:59,199 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:59,199 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:59,200 INFO L82 PathProgramCache]: Analyzing trace with hash -607348492, now seen corresponding path program 48 times [2019-09-05 11:39:59,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:59,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:59,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:59,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:59,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:40:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-05 11:40:00,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:40:00,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:40:00,330 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:40:52,995 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-05 11:40:52,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:40:53,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 11:40:53,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:40:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (49)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:40:53,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:40:53,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-05 11:40:53,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 11:40:53,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 11:40:53,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 11:40:53,138 INFO L87 Difference]: Start difference. First operand 296 states and 344 transitions. Second operand 52 states. [2019-09-05 11:40:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:40:53,663 INFO L93 Difference]: Finished difference Result 508 states and 610 transitions. [2019-09-05 11:40:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 11:40:53,664 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 295 [2019-09-05 11:40:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:40:53,665 INFO L225 Difference]: With dead ends: 508 [2019-09-05 11:40:53,665 INFO L226 Difference]: Without dead ends: 315 [2019-09-05 11:40:53,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 11:40:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-05 11:40:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 298. [2019-09-05 11:40:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-05 11:40:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 346 transitions. [2019-09-05 11:40:53,673 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 346 transitions. Word has length 295 [2019-09-05 11:40:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:40:53,673 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 346 transitions. [2019-09-05 11:40:53,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 11:40:53,675 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 346 transitions. [2019-09-05 11:40:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-05 11:40:53,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:40:53,676 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:40:53,677 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:40:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:40:53,677 INFO L82 PathProgramCache]: Analyzing trace with hash 267683602, now seen corresponding path program 49 times [2019-09-05 11:40:53,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:40:53,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:40:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:40:53,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:40:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:40:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:40:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6679 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-05 11:40:54,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:40:54,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:40:54,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:40:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:40:55,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 11:40:55,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:40:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6679 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-05 11:40:55,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:40:55,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-05 11:40:55,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 11:40:55,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 11:40:55,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:40:55,125 INFO L87 Difference]: Start difference. First operand 298 states and 346 transitions. Second operand 53 states. [2019-09-05 11:40:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:40:55,585 INFO L93 Difference]: Finished difference Result 515 states and 619 transitions. [2019-09-05 11:40:55,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 11:40:55,586 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 297 [2019-09-05 11:40:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:40:55,588 INFO L225 Difference]: With dead ends: 515 [2019-09-05 11:40:55,588 INFO L226 Difference]: Without dead ends: 322 [2019-09-05 11:40:55,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:40:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-05 11:40:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 300. [2019-09-05 11:40:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-05 11:40:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 348 transitions. [2019-09-05 11:40:55,594 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 348 transitions. Word has length 297 [2019-09-05 11:40:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:40:55,595 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 348 transitions. [2019-09-05 11:40:55,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 11:40:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 348 transitions. [2019-09-05 11:40:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-05 11:40:55,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:40:55,597 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:40:55,597 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:40:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:40:55,597 INFO L82 PathProgramCache]: Analyzing trace with hash -640064080, now seen corresponding path program 50 times [2019-09-05 11:40:55,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:40:55,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:40:55,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:40:55,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:40:55,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:40:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:40:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6778 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-05 11:40:56,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:40:56,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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:40:56,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:40:56,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:40:56,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:40:56,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-05 11:40:56,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:40:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6778 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-05 11:40:56,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:40:56,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-05 11:40:56,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-05 11:40:56,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-05 11:40:56,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 11:40:56,903 INFO L87 Difference]: Start difference. First operand 300 states and 348 transitions. Second operand 54 states. [2019-09-05 11:40:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:40:57,371 INFO L93 Difference]: Finished difference Result 522 states and 628 transitions. [2019-09-05 11:40:57,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 11:40:57,371 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 299 [2019-09-05 11:40:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:40:57,376 INFO L225 Difference]: With dead ends: 522 [2019-09-05 11:40:57,376 INFO L226 Difference]: Without dead ends: 329 [2019-09-05 11:40:57,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 11:40:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-05 11:40:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 302. [2019-09-05 11:40:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-05 11:40:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 350 transitions. [2019-09-05 11:40:57,401 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 350 transitions. Word has length 299 [2019-09-05 11:40:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:40:57,402 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 350 transitions. [2019-09-05 11:40:57,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-05 11:40:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 350 transitions. [2019-09-05 11:40:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-05 11:40:57,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:40:57,404 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:40:57,404 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:40:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:40:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1107225394, now seen corresponding path program 51 times [2019-09-05 11:40:57,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:40:57,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:40:57,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:40:57,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:40:57,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:40:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:40:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6879 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-09-05 11:40:58,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:40:58,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:40:58,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:41:42,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-09-05 11:41:42,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:42,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 11:41:42,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:42,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:41:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6879 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-09-05 11:41:43,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:43,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 51] total 57 [2019-09-05 11:41:43,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 11:41:43,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 11:41:43,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1489, Invalid=1703, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:41:43,083 INFO L87 Difference]: Start difference. First operand 302 states and 350 transitions. Second operand 57 states. [2019-09-05 11:41:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:43,629 INFO L93 Difference]: Finished difference Result 531 states and 639 transitions. [2019-09-05 11:41:43,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-05 11:41:43,629 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 301 [2019-09-05 11:41:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:43,632 INFO L225 Difference]: With dead ends: 531 [2019-09-05 11:41:43,632 INFO L226 Difference]: Without dead ends: 330 [2019-09-05 11:41:43,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1493, Invalid=1813, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 11:41:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-05 11:41:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-09-05 11:41:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-05 11:41:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 382 transitions. [2019-09-05 11:41:43,639 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 382 transitions. Word has length 301 [2019-09-05 11:41:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:43,640 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 382 transitions. [2019-09-05 11:41:43,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-05 11:41:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 382 transitions. [2019-09-05 11:41:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-05 11:41:43,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:43,642 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:43,642 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:43,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1631118898, now seen corresponding path program 52 times [2019-09-05 11:41:43,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:43,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:43,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:43,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:43,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8164 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-05 11:41:44,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:44,758 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-05 11:41:44,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:41:44,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:41:44,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:44,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 11:41:44,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8164 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-05 11:41:44,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:44,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-05 11:41:44,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-05 11:41:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-05 11:41:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 11:41:44,972 INFO L87 Difference]: Start difference. First operand 328 states and 382 transitions. Second operand 56 states. [2019-09-05 11:41:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:45,536 INFO L93 Difference]: Finished difference Result 554 states and 664 transitions. [2019-09-05 11:41:45,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 11:41:45,537 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 327 [2019-09-05 11:41:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:45,538 INFO L225 Difference]: With dead ends: 554 [2019-09-05 11:41:45,538 INFO L226 Difference]: Without dead ends: 337 [2019-09-05 11:41:45,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 11:41:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-05 11:41:45,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 330. [2019-09-05 11:41:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-05 11:41:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 384 transitions. [2019-09-05 11:41:45,545 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 384 transitions. Word has length 327 [2019-09-05 11:41:45,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:45,545 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 384 transitions. [2019-09-05 11:41:45,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-05 11:41:45,545 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 384 transitions. [2019-09-05 11:41:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-05 11:41:45,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:45,547 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:45,547 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:45,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:45,548 INFO L82 PathProgramCache]: Analyzing trace with hash -956362772, now seen corresponding path program 53 times [2019-09-05 11:41:45,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:45,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:45,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:45,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:45,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8269 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-05 11:41:46,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:46,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:46,730 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:42:09,651 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-05 11:42:09,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:09,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 11:42:09,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8269 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-05 11:42:09,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:09,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-05 11:42:09,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 11:42:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 11:42:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:42:09,748 INFO L87 Difference]: Start difference. First operand 330 states and 384 transitions. Second operand 57 states. [2019-09-05 11:42:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:10,282 INFO L93 Difference]: Finished difference Result 561 states and 673 transitions. [2019-09-05 11:42:10,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-05 11:42:10,283 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 329 [2019-09-05 11:42:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:10,284 INFO L225 Difference]: With dead ends: 561 [2019-09-05 11:42:10,284 INFO L226 Difference]: Without dead ends: 344 [2019-09-05 11:42:10,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:42:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-05 11:42:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 332. [2019-09-05 11:42:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-05 11:42:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 386 transitions. [2019-09-05 11:42:10,290 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 386 transitions. Word has length 329 [2019-09-05 11:42:10,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:10,290 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 386 transitions. [2019-09-05 11:42:10,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-05 11:42:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 386 transitions. [2019-09-05 11:42:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-05 11:42:10,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:10,293 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:10,293 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:10,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1055787382, now seen corresponding path program 54 times [2019-09-05 11:42:10,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:10,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:10,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:10,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:10,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8376 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-05 11:42:11,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:11,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:11,578 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:43:54,862 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-05 11:43:54,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:54,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 11:43:54,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8376 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-05 11:43:54,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:54,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-05 11:43:54,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-05 11:43:54,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-05 11:43:54,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 11:43:54,976 INFO L87 Difference]: Start difference. First operand 332 states and 386 transitions. Second operand 58 states. [2019-09-05 11:43:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:55,551 INFO L93 Difference]: Finished difference Result 568 states and 682 transitions. [2019-09-05 11:43:55,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 11:43:55,551 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 331 [2019-09-05 11:43:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:55,553 INFO L225 Difference]: With dead ends: 568 [2019-09-05 11:43:55,553 INFO L226 Difference]: Without dead ends: 351 [2019-09-05 11:43:55,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 11:43:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-05 11:43:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 334. [2019-09-05 11:43:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-05 11:43:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 388 transitions. [2019-09-05 11:43:55,559 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 388 transitions. Word has length 331 [2019-09-05 11:43:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:55,559 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 388 transitions. [2019-09-05 11:43:55,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-05 11:43:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 388 transitions. [2019-09-05 11:43:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-05 11:43:55,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:55,561 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:55,562 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2113557080, now seen corresponding path program 55 times [2019-09-05 11:43:55,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:55,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:55,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8485 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-05 11:43:56,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:56,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:56,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:56,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 11:43:56,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8485 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-05 11:43:57,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:57,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-09-05 11:43:57,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-05 11:43:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-05 11:43:57,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 11:43:57,016 INFO L87 Difference]: Start difference. First operand 334 states and 388 transitions. Second operand 59 states. [2019-09-05 11:43:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:57,684 INFO L93 Difference]: Finished difference Result 575 states and 691 transitions. [2019-09-05 11:43:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-05 11:43:57,684 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 333 [2019-09-05 11:43:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:57,686 INFO L225 Difference]: With dead ends: 575 [2019-09-05 11:43:57,686 INFO L226 Difference]: Without dead ends: 358 [2019-09-05 11:43:57,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 11:43:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-05 11:43:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 336. [2019-09-05 11:43:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-05 11:43:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 390 transitions. [2019-09-05 11:43:57,691 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 390 transitions. Word has length 333 [2019-09-05 11:43:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:57,692 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 390 transitions. [2019-09-05 11:43:57,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-05 11:43:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 390 transitions. [2019-09-05 11:43:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-05 11:43:57,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:57,694 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:57,694 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash -722987706, now seen corresponding path program 56 times [2019-09-05 11:43:57,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:57,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:57,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:57,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:57,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8596 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-05 11:43:59,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:59,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:59,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:43:59,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:59,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:59,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-05 11:43:59,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8596 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (57)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:43:59,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:59,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-09-05 11:43:59,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-05 11:43:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-05 11:43:59,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 11:43:59,260 INFO L87 Difference]: Start difference. First operand 336 states and 390 transitions. Second operand 60 states. [2019-09-05 11:43:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:59,888 INFO L93 Difference]: Finished difference Result 582 states and 700 transitions. [2019-09-05 11:43:59,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 11:43:59,889 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 335 [2019-09-05 11:43:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:59,891 INFO L225 Difference]: With dead ends: 582 [2019-09-05 11:43:59,891 INFO L226 Difference]: Without dead ends: 365 [2019-09-05 11:43:59,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 11:43:59,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-05 11:43:59,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 338. [2019-09-05 11:43:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-05 11:43:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 392 transitions. [2019-09-05 11:43:59,898 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 392 transitions. Word has length 335 [2019-09-05 11:43:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:59,898 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 392 transitions. [2019-09-05 11:43:59,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-05 11:43:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 392 transitions. [2019-09-05 11:43:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-05 11:43:59,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:59,901 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:59,902 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:59,902 INFO L82 PathProgramCache]: Analyzing trace with hash -120648348, now seen corresponding path program 57 times [2019-09-05 11:43:59,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:59,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:59,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8709 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-09-05 11:44:01,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:44:01,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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:44:01,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:45:12,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-05 11:45:12,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:45:12,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 11:45:12,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:45:12,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:45:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8709 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-05 11:45:12,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:45:12,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 57] total 63 [2019-09-05 11:45:12,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 11:45:12,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 11:45:12,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 11:45:12,184 INFO L87 Difference]: Start difference. First operand 338 states and 392 transitions. Second operand 63 states. [2019-09-05 11:45:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:45:12,756 INFO L93 Difference]: Finished difference Result 591 states and 711 transitions. [2019-09-05 11:45:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-05 11:45:12,756 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 337 [2019-09-05 11:45:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:45:12,759 INFO L225 Difference]: With dead ends: 591 [2019-09-05 11:45:12,759 INFO L226 Difference]: Without dead ends: 366 [2019-09-05 11:45:12,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1838, Invalid=2194, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 11:45:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-05 11:45:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2019-09-05 11:45:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-05 11:45:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 424 transitions. [2019-09-05 11:45:12,766 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 424 transitions. Word has length 337 [2019-09-05 11:45:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:45:12,766 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 424 transitions. [2019-09-05 11:45:12,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 11:45:12,767 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 424 transitions. [2019-09-05 11:45:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-09-05 11:45:12,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:45:12,769 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:45:12,769 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:45:12,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:45:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash -566216348, now seen corresponding path program 58 times [2019-09-05 11:45:12,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:45:12,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:45:12,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:12,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:45:12,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10150 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:45:14,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:45:14,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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:45:14,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:45:14,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:45:14,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:45:14,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-05 11:45:14,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:45:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10150 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:45:14,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:45:14,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-09-05 11:45:14,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-05 11:45:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-05 11:45:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 11:45:14,413 INFO L87 Difference]: Start difference. First operand 364 states and 424 transitions. Second operand 62 states. [2019-09-05 11:45:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:45:14,983 INFO L93 Difference]: Finished difference Result 614 states and 736 transitions. [2019-09-05 11:45:14,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-05 11:45:14,983 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 363 [2019-09-05 11:45:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:45:14,985 INFO L225 Difference]: With dead ends: 614 [2019-09-05 11:45:14,985 INFO L226 Difference]: Without dead ends: 373 [2019-09-05 11:45:14,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 11:45:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-05 11:45:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 366. [2019-09-05 11:45:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-05 11:45:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 426 transitions. [2019-09-05 11:45:14,990 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 426 transitions. Word has length 363 [2019-09-05 11:45:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:45:14,990 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 426 transitions. [2019-09-05 11:45:14,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-05 11:45:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 426 transitions. [2019-09-05 11:45:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-05 11:45:14,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:45:14,993 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:45:14,993 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:45:14,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:45:14,993 INFO L82 PathProgramCache]: Analyzing trace with hash 165673090, now seen corresponding path program 59 times [2019-09-05 11:45:14,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:45:14,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:45:14,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:14,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:45:14,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10267 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:45:16,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:45:16,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:45:16,422 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:45:38,683 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-05 11:45:38,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:45:38,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 11:45:38,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:45:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10267 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:45:38,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:45:38,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-09-05 11:45:38,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 11:45:38,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 11:45:38,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 11:45:38,812 INFO L87 Difference]: Start difference. First operand 366 states and 426 transitions. Second operand 63 states. [2019-09-05 11:45:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:45:39,456 INFO L93 Difference]: Finished difference Result 621 states and 745 transitions. [2019-09-05 11:45:39,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-05 11:45:39,456 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 365 [2019-09-05 11:45:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:45:39,458 INFO L225 Difference]: With dead ends: 621 [2019-09-05 11:45:39,458 INFO L226 Difference]: Without dead ends: 380 [2019-09-05 11:45:39,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 11:45:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-05 11:45:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 368. [2019-09-05 11:45:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-05 11:45:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 428 transitions. [2019-09-05 11:45:39,465 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 428 transitions. Word has length 365 [2019-09-05 11:45:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:45:39,465 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 428 transitions. [2019-09-05 11:45:39,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 11:45:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 428 transitions. [2019-09-05 11:45:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-05 11:45:39,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:45:39,468 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:45:39,468 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:45:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:45:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash -863213536, now seen corresponding path program 60 times [2019-09-05 11:45:39,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:45:39,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:45:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:39,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:45:39,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10386 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:45:41,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:45:41,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:45:41,016 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:49:39,027 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-05 11:49:39,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:39,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 11:49:39,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10386 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:49:39,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:39,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-09-05 11:49:39,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-05 11:49:39,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-05 11:49:39,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 11:49:39,235 INFO L87 Difference]: Start difference. First operand 368 states and 428 transitions. Second operand 64 states. [2019-09-05 11:49:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:40,036 INFO L93 Difference]: Finished difference Result 628 states and 754 transitions. [2019-09-05 11:49:40,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-05 11:49:40,037 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 367 [2019-09-05 11:49:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:40,038 INFO L225 Difference]: With dead ends: 628 [2019-09-05 11:49:40,038 INFO L226 Difference]: Without dead ends: 387 [2019-09-05 11:49:40,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 11:49:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-05 11:49:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 370. [2019-09-05 11:49:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-05 11:49:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 430 transitions. [2019-09-05 11:49:40,043 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 430 transitions. Word has length 367 [2019-09-05 11:49:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:40,044 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 430 transitions. [2019-09-05 11:49:40,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-05 11:49:40,044 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 430 transitions. [2019-09-05 11:49:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-05 11:49:40,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:40,046 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:40,046 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1780783042, now seen corresponding path program 61 times [2019-09-05 11:49:40,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:40,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:40,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:49:41,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:41,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:41,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:49:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:41,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 11:49:41,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:49:41,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:41,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-09-05 11:49:41,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-05 11:49:41,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-05 11:49:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 11:49:41,740 INFO L87 Difference]: Start difference. First operand 370 states and 430 transitions. Second operand 65 states. [2019-09-05 11:49:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:42,518 INFO L93 Difference]: Finished difference Result 635 states and 763 transitions. [2019-09-05 11:49:42,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-05 11:49:42,519 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 369 [2019-09-05 11:49:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:42,520 INFO L225 Difference]: With dead ends: 635 [2019-09-05 11:49:42,520 INFO L226 Difference]: Without dead ends: 394 [2019-09-05 11:49:42,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 11:49:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-05 11:49:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 372. [2019-09-05 11:49:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-05 11:49:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 432 transitions. [2019-09-05 11:49:42,526 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 432 transitions. Word has length 369 [2019-09-05 11:49:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:42,526 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 432 transitions. [2019-09-05 11:49:42,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-05 11:49:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 432 transitions. [2019-09-05 11:49:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-05 11:49:42,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:42,528 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:42,529 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:42,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:42,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1198184668, now seen corresponding path program 62 times [2019-09-05 11:49:42,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:42,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:42,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:42,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:49:42,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10630 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:49:44,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:44,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:44,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:49:44,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:49:44,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:44,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-05 11:49:44,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10630 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:49:44,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:44,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-09-05 11:49:44,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-05 11:49:44,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-05 11:49:44,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 11:49:44,249 INFO L87 Difference]: Start difference. First operand 372 states and 432 transitions. Second operand 66 states. [2019-09-05 11:49:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:44,985 INFO L93 Difference]: Finished difference Result 642 states and 772 transitions. [2019-09-05 11:49:44,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-05 11:49:44,985 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 371 [2019-09-05 11:49:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:44,986 INFO L225 Difference]: With dead ends: 642 [2019-09-05 11:49:44,986 INFO L226 Difference]: Without dead ends: 401 [2019-09-05 11:49:44,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 11:49:44,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-09-05 11:49:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 374. [2019-09-05 11:49:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-05 11:49:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 434 transitions. [2019-09-05 11:49:44,992 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 434 transitions. Word has length 371 [2019-09-05 11:49:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:44,993 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 434 transitions. [2019-09-05 11:49:44,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-05 11:49:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 434 transitions. [2019-09-05 11:49:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-05 11:49:44,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:44,995 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:44,995 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash -757032454, now seen corresponding path program 63 times [2019-09-05 11:49:44,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:44,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:44,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10755 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2019-09-05 11:49:46,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:46,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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:46,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2