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/const_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:37:39,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:37:39,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:37:39,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:37:39,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:37:39,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:37:39,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:37:39,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:37:39,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:37:39,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:37:39,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:37:39,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:37:39,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:37:39,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:37:39,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:37:39,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:37:39,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:37:39,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:37:39,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:37:39,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:37:39,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:37:39,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:37:39,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:37:39,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:37:39,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:37:39,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:37:39,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:37:39,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:37:39,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:37:39,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:37:39,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:37:39,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:37:39,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:37:39,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:37:39,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:37:39,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:37:39,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:37:39,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:37:39,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:37:39,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:37:39,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:37:39,076 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-08 02:37:39,105 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:37:39,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:37:39,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:37:39,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:37:39,109 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:37:39,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:37:39,109 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:37:39,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:37:39,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:37:39,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:37:39,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:37:39,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:37:39,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:37:39,112 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:37:39,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:37:39,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:37:39,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:37:39,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:37:39,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:37:39,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:37:39,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:37:39,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:37:39,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:37:39,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:37:39,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:37:39,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:37:39,115 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:37:39,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:37:39,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:37:39,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:37:39,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:37:39,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:37:39,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:37:39,195 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:37:39,196 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_1-2.c [2019-09-08 02:37:39,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc80d39e/8aa3a24ab3884cd285e5a5a114dfaf43/FLAGd2e89ce1a [2019-09-08 02:37:39,718 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:37:39,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c [2019-09-08 02:37:39,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc80d39e/8aa3a24ab3884cd285e5a5a114dfaf43/FLAGd2e89ce1a [2019-09-08 02:37:40,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc80d39e/8aa3a24ab3884cd285e5a5a114dfaf43 [2019-09-08 02:37:40,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:37:40,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:37:40,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:37:40,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:37:40,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:37:40,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa3d82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40, skipping insertion in model container [2019-09-08 02:37:40,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,126 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:37:40,145 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:37:40,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:37:40,344 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:37:40,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:37:40,371 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:37:40,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40 WrapperNode [2019-09-08 02:37:40,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:37:40,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:37:40,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:37:40,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:37:40,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:37:40,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:37:40,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:37:40,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:37:40,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40" (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-08 02:37:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:37:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:37:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:37:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:37:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:37:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:37:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:37:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:37:40,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:37:40,699 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:37:40,700 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 02:37:40,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:37:40 BoogieIcfgContainer [2019-09-08 02:37:40,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:37:40,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:37:40,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:37:40,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:37:40,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:37:40" (1/3) ... [2019-09-08 02:37:40,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1874f2e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:37:40, skipping insertion in model container [2019-09-08 02:37:40,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40" (2/3) ... [2019-09-08 02:37:40,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1874f2e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:37:40, skipping insertion in model container [2019-09-08 02:37:40,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:37:40" (3/3) ... [2019-09-08 02:37:40,709 INFO L109 eAbstractionObserver]: Analyzing ICFG const_1-2.c [2019-09-08 02:37:40,717 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:37:40,723 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:37:40,741 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:37:40,772 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:37:40,773 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:37:40,773 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:37:40,773 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:37:40,773 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:37:40,774 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:37:40,774 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:37:40,774 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:37:40,774 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:37:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-08 02:37:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 02:37:40,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:40,799 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:40,802 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:40,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-08 02:37:40,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:40,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:40,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:40,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:40,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:41,015 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-08 02:37:41,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:37:41,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:37:41,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:37:41,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:37:41,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:37:41,055 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-08 02:37:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:41,100 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-08 02:37:41,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:37:41,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-08 02:37:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:41,111 INFO L225 Difference]: With dead ends: 29 [2019-09-08 02:37:41,112 INFO L226 Difference]: Without dead ends: 12 [2019-09-08 02:37:41,115 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-08 02:37:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-08 02:37:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-08 02:37:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-08 02:37:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-08 02:37:41,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-08 02:37:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:41,175 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-08 02:37:41,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:37:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-08 02:37:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-08 02:37:41,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:41,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:41,177 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:41,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:41,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-08 02:37:41,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:41,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:41,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:41,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:41,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:41,283 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-08 02:37:41,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:41,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 02:37:41,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:41,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:41,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 02:37:41,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:37:41,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:37:41,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:37:41,383 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-08 02:37:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:41,410 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-08 02:37:41,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:37:41,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-08 02:37:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:41,412 INFO L225 Difference]: With dead ends: 18 [2019-09-08 02:37:41,413 INFO L226 Difference]: Without dead ends: 13 [2019-09-08 02:37:41,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:37:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-08 02:37:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-08 02:37:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-08 02:37:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-08 02:37:41,422 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-08 02:37:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:41,423 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-08 02:37:41,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:37:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-08 02:37:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:37:41,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:41,424 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:41,424 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:41,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-08 02:37:41,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:41,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:41,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:41,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:41,523 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-08 02:37:41,541 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-08 02:37:41,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:37:41,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:41,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 02:37:41,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:41,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:41,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 02:37:41,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:37:41,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:37:41,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:37:41,593 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-08 02:37:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:41,639 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-08 02:37:41,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:37:41,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-08 02:37:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:41,641 INFO L225 Difference]: With dead ends: 19 [2019-09-08 02:37:41,642 INFO L226 Difference]: Without dead ends: 14 [2019-09-08 02:37:41,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:37:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-08 02:37:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-08 02:37:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-08 02:37:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-08 02:37:41,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-08 02:37:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:41,652 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-08 02:37:41,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:37:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-08 02:37:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 02:37:41,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:41,653 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:41,654 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:41,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:41,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-08 02:37:41,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:41,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:41,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:41,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:41,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:41,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:37:41,778 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-08 02:37:41,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 02:37:41,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:41,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 02:37:41,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 02:37:41,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:37:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:37:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:37:41,844 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-08 02:37:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:41,887 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-08 02:37:41,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:37:41,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-08 02:37:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:41,889 INFO L225 Difference]: With dead ends: 20 [2019-09-08 02:37:41,889 INFO L226 Difference]: Without dead ends: 15 [2019-09-08 02:37:41,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:37:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-08 02:37:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-08 02:37:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-08 02:37:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-08 02:37:41,895 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-08 02:37:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:41,896 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-08 02:37:41,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:37:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-08 02:37:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:37:41,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:41,897 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:41,897 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:41,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-08 02:37:41,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:41,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:42,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:42,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:37:42,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:37:42,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:42,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 02:37:42,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:42,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 02:37:42,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:37:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:37:42,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:37:42,103 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-08 02:37:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:42,170 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-08 02:37:42,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:37:42,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-08 02:37:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:42,171 INFO L225 Difference]: With dead ends: 21 [2019-09-08 02:37:42,171 INFO L226 Difference]: Without dead ends: 16 [2019-09-08 02:37:42,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:37:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-08 02:37:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-08 02:37:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-08 02:37:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-08 02:37:42,176 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-08 02:37:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:42,177 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-08 02:37:42,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:37:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-08 02:37:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:37:42,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:42,178 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:42,178 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:42,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:42,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-08 02:37:42,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:42,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:42,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:42,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:42,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:42,311 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:37:42,331 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-08 02:37:42,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:42,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 02:37:42,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:42,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-08 02:37:42,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:37:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:37:42,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:37:42,389 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-08 02:37:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:42,449 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-08 02:37:42,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:37:42,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-08 02:37:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:42,450 INFO L225 Difference]: With dead ends: 22 [2019-09-08 02:37:42,450 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 02:37:42,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:37:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 02:37:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 02:37:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 02:37:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-08 02:37:42,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-08 02:37:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:42,456 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-08 02:37:42,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:37:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-08 02:37:42,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:37:42,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:42,457 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:42,457 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:42,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-08 02:37:42,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:42,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:42,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:42,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:42,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:42,665 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:37:42,685 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-08 02:37:42,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:42,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 02:37:42,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:42,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 02:37:42,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:37:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:37:42,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:37:42,727 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-08 02:37:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:42,798 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-08 02:37:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:37:42,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-08 02:37:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:42,801 INFO L225 Difference]: With dead ends: 23 [2019-09-08 02:37:42,802 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 02:37:42,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:37:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 02:37:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-08 02:37:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 02:37:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-08 02:37:42,809 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-08 02:37:42,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:42,809 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-08 02:37:42,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:37:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-08 02:37:42,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:37:42,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:42,811 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:42,812 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:42,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:42,812 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-08 02:37:42,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:42,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:42,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:42,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:43,007 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-08 02:37:43,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:43,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 02:37:43,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:43,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 02:37:43,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:37:43,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:37:43,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:37:43,081 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-08 02:37:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:43,150 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-08 02:37:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:37:43,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-08 02:37:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:43,151 INFO L225 Difference]: With dead ends: 24 [2019-09-08 02:37:43,151 INFO L226 Difference]: Without dead ends: 19 [2019-09-08 02:37:43,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:37:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-08 02:37:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-08 02:37:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 02:37:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-08 02:37:43,156 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-08 02:37:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:43,157 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-08 02:37:43,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:37:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-08 02:37:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:37:43,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:43,158 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:43,158 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:43,159 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-08 02:37:43,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:43,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:43,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:37:43,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:43,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:37:43,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:43,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 02:37:43,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:43,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 02:37:43,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:37:43,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:37:43,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:37:43,400 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-08 02:37:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:43,514 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-08 02:37:43,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:37:43,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-08 02:37:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:43,516 INFO L225 Difference]: With dead ends: 25 [2019-09-08 02:37:43,517 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 02:37:43,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:37:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 02:37:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-08 02:37:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-08 02:37:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-08 02:37:43,525 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-08 02:37:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:43,525 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-08 02:37:43,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:37:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-08 02:37:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 02:37:43,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:43,527 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:43,527 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-08 02:37:43,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:43,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:43,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:43,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:43,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:37:43,720 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-08 02:37:43,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-08 02:37:43,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:43,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 02:37:43,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:43,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 02:37:43,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:37:43,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:37:43,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:37:43,881 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-08 02:37:43,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:43,980 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-08 02:37:43,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:37:43,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-08 02:37:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:43,981 INFO L225 Difference]: With dead ends: 26 [2019-09-08 02:37:43,982 INFO L226 Difference]: Without dead ends: 21 [2019-09-08 02:37:43,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:37:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-08 02:37:43,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-08 02:37:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 02:37:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-08 02:37:43,990 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-08 02:37:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:43,991 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-08 02:37:43,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:37:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-08 02:37:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:37:43,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:43,992 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:43,992 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:43,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-08 02:37:43,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:43,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:43,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:43,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:44,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:44,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:37:44,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:37:44,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:44,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 02:37:44,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:44,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:44,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 02:37:44,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:37:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:37:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:37:44,274 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-08 02:37:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:44,390 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-08 02:37:44,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:37:44,391 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-08 02:37:44,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:44,391 INFO L225 Difference]: With dead ends: 27 [2019-09-08 02:37:44,391 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 02:37:44,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:37:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 02:37:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-08 02:37:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 02:37:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-08 02:37:44,397 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-08 02:37:44,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:44,397 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-08 02:37:44,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:37:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-08 02:37:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:37:44,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:44,398 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:44,399 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:44,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-08 02:37:44,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:44,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:44,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:44,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:44,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:44,600 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-08 02:37:44,619 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:37:44,688 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-08 02:37:44,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:44,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 02:37:44,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:44,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:44,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-08 02:37:44,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:37:44,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:37:44,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:37:44,731 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-08 02:37:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:44,864 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-08 02:37:44,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:37:44,869 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-08 02:37:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:44,870 INFO L225 Difference]: With dead ends: 28 [2019-09-08 02:37:44,871 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 02:37:44,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:37:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 02:37:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-08 02:37:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 02:37:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-08 02:37:44,875 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-08 02:37:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:44,876 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-08 02:37:44,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:37:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-08 02:37:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 02:37:44,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:44,877 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:44,877 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:44,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-08 02:37:44,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:44,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:44,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:44,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:45,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:45,129 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) [2019-09-08 02:37:45,147 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:45,194 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 02:37:45,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:45,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 02:37:45,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:45,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:45,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-08 02:37:45,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:37:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:37:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:37:45,233 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-08 02:37:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:45,366 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-08 02:37:45,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:37:45,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-08 02:37:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:45,372 INFO L225 Difference]: With dead ends: 29 [2019-09-08 02:37:45,372 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 02:37:45,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:37:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 02:37:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-08 02:37:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 02:37:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-08 02:37:45,383 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-08 02:37:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:45,383 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-08 02:37:45,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:37:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-08 02:37:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 02:37:45,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:45,384 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:45,385 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:45,385 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-08 02:37:45,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:45,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:45,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:45,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:45,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:45,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:45,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:37:45,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:45,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 02:37:45,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:45,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:45,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-08 02:37:45,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 02:37:45,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 02:37:45,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:37:45,671 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-08 02:37:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:45,832 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-08 02:37:45,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 02:37:45,833 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-08 02:37:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:45,833 INFO L225 Difference]: With dead ends: 30 [2019-09-08 02:37:45,833 INFO L226 Difference]: Without dead ends: 25 [2019-09-08 02:37:45,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:37:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-08 02:37:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-08 02:37:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 02:37:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-08 02:37:45,839 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-08 02:37:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:45,839 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-08 02:37:45,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 02:37:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-08 02:37:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:37:45,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:45,840 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:45,840 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-08 02:37:45,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:45,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:46,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:46,047 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-08 02:37:46,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:37:46,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:37:46,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:46,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 02:37:46,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:46,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:46,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-08 02:37:46,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:37:46,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:37:46,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:37:46,135 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-08 02:37:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:46,316 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-08 02:37:46,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 02:37:46,316 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-08 02:37:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:46,317 INFO L225 Difference]: With dead ends: 31 [2019-09-08 02:37:46,317 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 02:37:46,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:37:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 02:37:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-08 02:37:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:37:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-08 02:37:46,322 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-08 02:37:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:46,322 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-08 02:37:46,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:37:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-08 02:37:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 02:37:46,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:46,323 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:46,324 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-08 02:37:46,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:46,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:46,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:46,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:46,564 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-08 02:37:46,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:37:46,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-08 02:37:46,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:46,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 02:37:46,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:46,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:46,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-08 02:37:46,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 02:37:46,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 02:37:46,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:37:46,900 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-08 02:37:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:47,103 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-08 02:37:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 02:37:47,103 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-08 02:37:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:47,104 INFO L225 Difference]: With dead ends: 32 [2019-09-08 02:37:47,104 INFO L226 Difference]: Without dead ends: 27 [2019-09-08 02:37:47,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:37:47,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-08 02:37:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-08 02:37:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 02:37:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-08 02:37:47,109 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-08 02:37:47,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:47,109 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-08 02:37:47,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 02:37:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-08 02:37:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 02:37:47,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:47,110 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:47,111 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-08 02:37:47,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:47,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:47,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:47,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:47,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:47,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:47,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:37:47,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:37:47,402 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:37:47,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:47,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 02:37:47,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:47,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:47,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-08 02:37:47,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:37:47,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:37:47,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:37:47,464 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-08 02:37:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:47,684 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-08 02:37:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:37:47,685 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-08 02:37:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:47,685 INFO L225 Difference]: With dead ends: 33 [2019-09-08 02:37:47,685 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 02:37:47,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:37:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 02:37:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-08 02:37:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 02:37:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-08 02:37:47,690 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-08 02:37:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:47,691 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-08 02:37:47,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:37:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-08 02:37:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 02:37:47,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:47,692 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:47,692 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-08 02:37:47,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:47,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:47,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:47,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:47,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:37:47,993 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:38:04,635 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-08 02:38:04,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:04,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 02:38:04,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:04,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:04,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-08 02:38:04,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:38:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:38:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:38:04,695 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-08 02:38:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:04,952 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-08 02:38:04,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:38:04,952 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-08 02:38:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:04,953 INFO L225 Difference]: With dead ends: 34 [2019-09-08 02:38:04,953 INFO L226 Difference]: Without dead ends: 29 [2019-09-08 02:38:04,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:38:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-08 02:38:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-08 02:38:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 02:38:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-08 02:38:04,958 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-08 02:38:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:04,959 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-08 02:38:04,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:38:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-08 02:38:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 02:38:04,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:04,960 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:04,960 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:04,960 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-08 02:38:04,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:04,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:04,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:04,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:05,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:05,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:05,285 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:38:05,531 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-08 02:38:05,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:05,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 02:38:05,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:05,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:05,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-08 02:38:05,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 02:38:05,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 02:38:05,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:38:05,607 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-08 02:38:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:05,900 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-08 02:38:05,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:38:05,900 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-08 02:38:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:05,901 INFO L225 Difference]: With dead ends: 35 [2019-09-08 02:38:05,901 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 02:38:05,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:38:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 02:38:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-08 02:38:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 02:38:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-08 02:38:05,908 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-08 02:38:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:05,908 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-08 02:38:05,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 02:38:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-08 02:38:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 02:38:05,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:05,909 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:05,909 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-08 02:38:05,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:05,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:05,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:05,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:05,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:06,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:06,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:06,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:38:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:06,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:38:06,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:06,314 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:06,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:06,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-08 02:38:06,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 02:38:06,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 02:38:06,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:38:06,320 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-08 02:38:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:06,593 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-08 02:38:06,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 02:38:06,594 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-08 02:38:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:06,594 INFO L225 Difference]: With dead ends: 36 [2019-09-08 02:38:06,594 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 02:38:06,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:38:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 02:38:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-08 02:38:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 02:38:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-08 02:38:06,599 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-08 02:38:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:06,599 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-08 02:38:06,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 02:38:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-08 02:38:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 02:38:06,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:06,600 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:06,601 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:06,601 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-08 02:38:06,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:06,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:06,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:06,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:38:06,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:06,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:06,933 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-08 02:38:06,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:38:06,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:38:06,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:06,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:38:06,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:07,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:07,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-08 02:38:07,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:38:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:38:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:38:07,045 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-08 02:38:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:07,378 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-08 02:38:07,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 02:38:07,379 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-08 02:38:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:07,379 INFO L225 Difference]: With dead ends: 37 [2019-09-08 02:38:07,379 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:38:07,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:38:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:38:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-08 02:38:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 02:38:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-08 02:38:07,383 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-08 02:38:07,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:07,383 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-08 02:38:07,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:38:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-08 02:38:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 02:38:07,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:07,384 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:07,385 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:07,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:07,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-08 02:38:07,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:07,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:07,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:07,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:07,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:07,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:07,840 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-08 02:38:07,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:38:08,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-08 02:38:08,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:08,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 02:38:08,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:08,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:08,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-08 02:38:08,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:38:08,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:38:08,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:38:08,808 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-08 02:38:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:09,155 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-08 02:38:09,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 02:38:09,157 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-08 02:38:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:09,157 INFO L225 Difference]: With dead ends: 38 [2019-09-08 02:38:09,158 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 02:38:09,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:38:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 02:38:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-08 02:38:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:38:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-08 02:38:09,163 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-08 02:38:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:09,163 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-08 02:38:09,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:38:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-08 02:38:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 02:38:09,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:09,164 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:09,164 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:09,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-08 02:38:09,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:09,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:09,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:09,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:09,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:09,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:09,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:38:09,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:09,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:38:09,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:09,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 02:38:09,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:09,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:09,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-08 02:38:09,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:38:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:38:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:38:09,690 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-08 02:38:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:10,049 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-08 02:38:10,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:38:10,050 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-08 02:38:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:10,050 INFO L225 Difference]: With dead ends: 39 [2019-09-08 02:38:10,050 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 02:38:10,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:38:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 02:38:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-08 02:38:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-08 02:38:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-08 02:38:10,058 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-08 02:38:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:10,059 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-08 02:38:10,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:38:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-08 02:38:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 02:38:10,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:10,060 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:10,060 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-08 02:38:10,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:10,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:10,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:10,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:10,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:10,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:10,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 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-08 02:38:10,516 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:38:31,295 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-08 02:38:31,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:31,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 02:38:31,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:31,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:31,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-08 02:38:31,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:38:31,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:38:31,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:38:31,375 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-08 02:38:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:31,788 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-08 02:38:31,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:38:31,789 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-08 02:38:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:31,790 INFO L225 Difference]: With dead ends: 40 [2019-09-08 02:38:31,790 INFO L226 Difference]: Without dead ends: 35 [2019-09-08 02:38:31,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:38:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-08 02:38:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-08 02:38:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 02:38:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-08 02:38:31,794 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-08 02:38:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:31,794 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-08 02:38:31,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:38:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-08 02:38:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 02:38:31,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:31,795 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:31,795 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-08 02:38:31,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:31,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:31,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:31,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:31,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:32,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:32,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:38:32,397 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:38:37,328 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 02:38:37,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:37,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 02:38:37,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:37,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:37,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-08 02:38:37,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:38:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:38:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:38:37,384 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-08 02:38:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:37,829 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-08 02:38:37,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:38:37,829 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-08 02:38:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:37,830 INFO L225 Difference]: With dead ends: 41 [2019-09-08 02:38:37,830 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 02:38:37,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:38:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 02:38:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-08 02:38:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-08 02:38:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-08 02:38:37,835 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-08 02:38:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:37,836 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-08 02:38:37,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:38:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-08 02:38:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-08 02:38:37,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:37,837 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:37,837 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:37,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-08 02:38:37,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:37,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:37,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:37,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:38,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:38,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:38,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:38:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:38,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 02:38:38,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:38,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:38,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-08 02:38:38,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:38:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:38:38,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:38:38,482 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-08 02:38:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:38,978 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-08 02:38:38,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 02:38:38,979 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-08 02:38:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:38,980 INFO L225 Difference]: With dead ends: 42 [2019-09-08 02:38:38,980 INFO L226 Difference]: Without dead ends: 37 [2019-09-08 02:38:38,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:38:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-08 02:38:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-08 02:38:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 02:38:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-08 02:38:38,986 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-08 02:38:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:38,986 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-08 02:38:38,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:38:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-08 02:38:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:38:38,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:38,987 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:38,987 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:38,988 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-08 02:38:38,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:38,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:38,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:38,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:38:38,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:39,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:39,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:39,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:38:39,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:38:39,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:39,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 02:38:39,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:39,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:39,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-08 02:38:39,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 02:38:39,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 02:38:39,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:38:39,600 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-08 02:38:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:40,109 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-08 02:38:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:38:40,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-08 02:38:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:40,111 INFO L225 Difference]: With dead ends: 43 [2019-09-08 02:38:40,111 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 02:38:40,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:38:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 02:38:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-08 02:38:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-08 02:38:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-08 02:38:40,117 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-08 02:38:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:40,117 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-08 02:38:40,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 02:38:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-08 02:38:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 02:38:40,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:40,118 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:40,119 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:40,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-08 02:38:40,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:40,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:40,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:40,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:40,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:40,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:40,779 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) [2019-09-08 02:38:40,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:43,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-08 02:38:43,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:43,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 02:38:43,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:43,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:43,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-08 02:38:43,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 02:38:43,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 02:38:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:38:43,326 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-08 02:38:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:43,876 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-08 02:38:43,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 02:38:43,877 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-08 02:38:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:43,878 INFO L225 Difference]: With dead ends: 44 [2019-09-08 02:38:43,878 INFO L226 Difference]: Without dead ends: 39 [2019-09-08 02:38:43,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:38:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-08 02:38:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-08 02:38:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 02:38:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-08 02:38:43,881 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-08 02:38:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:43,881 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-08 02:38:43,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 02:38:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-08 02:38:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 02:38:43,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:43,882 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:43,882 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:43,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-08 02:38:43,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:43,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:44,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:44,464 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-08 02:38:44,475 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:38:44,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:38:44,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:44,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 02:38:44,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:44,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:44,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-08 02:38:44,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:38:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:38:44,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:38:44,549 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-08 02:38:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:45,143 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-08 02:38:45,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 02:38:45,143 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-08 02:38:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:45,144 INFO L225 Difference]: With dead ends: 45 [2019-09-08 02:38:45,144 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 02:38:45,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:38:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 02:38:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-08 02:38:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-08 02:38:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-08 02:38:45,148 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-08 02:38:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:45,149 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-08 02:38:45,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:38:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-08 02:38:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 02:38:45,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:45,149 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:45,150 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:45,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-08 02:38:45,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:45,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:45,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:45,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:45,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:45,733 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:40:14,845 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-08 02:40:14,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:40:15,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 02:40:15,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:40:15,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:15,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-08 02:40:15,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 02:40:15,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 02:40:15,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:40:15,142 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-08 02:40:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:15,780 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-08 02:40:15,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 02:40:15,781 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-08 02:40:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:15,781 INFO L225 Difference]: With dead ends: 46 [2019-09-08 02:40:15,781 INFO L226 Difference]: Without dead ends: 41 [2019-09-08 02:40:15,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:40:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-08 02:40:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-08 02:40:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 02:40:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-08 02:40:15,787 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-08 02:40:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:15,787 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-08 02:40:15,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 02:40:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-08 02:40:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 02:40:15,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:15,788 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:15,789 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:15,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:15,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-08 02:40:15,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:15,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:15,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:15,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:40:15,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:40:16,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:16,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:40:16,587 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:41:07,386 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-08 02:41:07,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:07,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 02:41:07,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:07,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:07,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-08 02:41:07,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 02:41:07,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 02:41:07,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:41:07,540 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-08 02:41:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:08,217 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-08 02:41:08,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 02:41:08,217 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-08 02:41:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:08,219 INFO L225 Difference]: With dead ends: 47 [2019-09-08 02:41:08,219 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 02:41:08,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:41:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 02:41:08,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-08 02:41:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 02:41:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-08 02:41:08,223 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-08 02:41:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:08,224 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-08 02:41:08,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 02:41:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-08 02:41:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 02:41:08,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:08,225 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:08,225 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-08 02:41:08,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:08,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:08,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:08,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:08,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:08,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:08,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:08,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 02:41:08,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:08,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:08,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-08 02:41:08,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 02:41:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 02:41:08,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:41:08,990 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-08 02:41:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:09,718 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-08 02:41:09,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 02:41:09,727 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-08 02:41:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:09,727 INFO L225 Difference]: With dead ends: 48 [2019-09-08 02:41:09,728 INFO L226 Difference]: Without dead ends: 43 [2019-09-08 02:41:09,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:41:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-08 02:41:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-08 02:41:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 02:41:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-08 02:41:09,734 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-08 02:41:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:09,734 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-08 02:41:09,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 02:41:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-08 02:41:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 02:41:09,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:09,735 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:09,735 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:09,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:09,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-08 02:41:09,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:09,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:09,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:09,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:09,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:10,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:10,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:41:10,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:41:10,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:41:10,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:10,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 02:41:10,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:10,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:10,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-08 02:41:10,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:41:10,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:41:10,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:41:10,620 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-08 02:41:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:11,383 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-08 02:41:11,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 02:41:11,383 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-08 02:41:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:11,384 INFO L225 Difference]: With dead ends: 49 [2019-09-08 02:41:11,385 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 02:41:11,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:41:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 02:41:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-08 02:41:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 02:41:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-08 02:41:11,389 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-08 02:41:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:11,389 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-08 02:41:11,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:41:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-08 02:41:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 02:41:11,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:11,390 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:11,390 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:11,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:11,391 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-08 02:41:11,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:11,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:11,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:12,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:12,069 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-08 02:41:12,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:41:36,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-08 02:41:36,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:36,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 02:41:36,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:36,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:36,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-08 02:41:36,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 02:41:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 02:41:36,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:41:36,627 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-08 02:41:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:37,430 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-08 02:41:37,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 02:41:37,431 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-08 02:41:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:37,432 INFO L225 Difference]: With dead ends: 50 [2019-09-08 02:41:37,432 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 02:41:37,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:41:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 02:41:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-08 02:41:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 02:41:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-08 02:41:37,435 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-08 02:41:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:37,435 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-08 02:41:37,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 02:41:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-08 02:41:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 02:41:37,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:37,436 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:37,436 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:37,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:37,436 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-08 02:41:37,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:37,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:37,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:37,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:37,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:38,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:38,214 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) [2019-09-08 02:41:38,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:38,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:41:38,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:38,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 02:41:38,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:38,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:38,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-08 02:41:38,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 02:41:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 02:41:38,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:41:38,324 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-08 02:41:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:39,147 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-08 02:41:39,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:41:39,148 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-08 02:41:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:39,149 INFO L225 Difference]: With dead ends: 51 [2019-09-08 02:41:39,149 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 02:41:39,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:41:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 02:41:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-08 02:41:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 02:41:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-08 02:41:39,153 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-08 02:41:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:39,154 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-08 02:41:39,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 02:41:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-08 02:41:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 02:41:39,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:39,154 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:39,155 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:39,155 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-08 02:41:39,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:39,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:39,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:39,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:39,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:40,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:40,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:41:40,328 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:43:22,372 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-08 02:43:22,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:43:22,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-08 02:43:22,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:43:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:22,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:43:22,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-08 02:43:22,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 02:43:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 02:43:22,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:43:22,466 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 39 states. [2019-09-08 02:43:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:43:23,377 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-08 02:43:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 02:43:23,377 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 45 [2019-09-08 02:43:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:43:23,378 INFO L225 Difference]: With dead ends: 52 [2019-09-08 02:43:23,378 INFO L226 Difference]: Without dead ends: 47 [2019-09-08 02:43:23,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:43:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-08 02:43:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-08 02:43:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 02:43:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-08 02:43:23,384 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-09-08 02:43:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:43:23,384 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-08 02:43:23,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 02:43:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-08 02:43:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 02:43:23,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:43:23,385 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:43:23,385 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:43:23,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:43:23,385 INFO L82 PathProgramCache]: Analyzing trace with hash -792870402, now seen corresponding path program 36 times [2019-09-08 02:43:23,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:43:23,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:43:23,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:23,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:43:23,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:43:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:24,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:43:24,213 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-08 02:43:24,224 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:43:54,615 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 02:43:54,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:43:54,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 02:43:54,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:43:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:54,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:43:54,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-08 02:43:54,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 02:43:54,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 02:43:54,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:43:54,744 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 40 states. [2019-09-08 02:43:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:43:55,674 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-08 02:43:55,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 02:43:55,675 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 46 [2019-09-08 02:43:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:43:55,675 INFO L225 Difference]: With dead ends: 53 [2019-09-08 02:43:55,676 INFO L226 Difference]: Without dead ends: 48 [2019-09-08 02:43:55,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:43:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-08 02:43:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-08 02:43:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 02:43:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-09-08 02:43:55,679 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-09-08 02:43:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:43:55,679 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-09-08 02:43:55,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 02:43:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-09-08 02:43:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 02:43:55,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:43:55,680 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:43:55,680 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:43:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:43:55,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1227282577, now seen corresponding path program 37 times [2019-09-08 02:43:55,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:43:55,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:43:55,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:55,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:43:55,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:43:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:56,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:43:56,626 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-08 02:43:56,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:43:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:43:56,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-08 02:43:56,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:43:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:56,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:43:56,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-08 02:43:56,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 02:43:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 02:43:56,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:43:56,753 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 41 states. [2019-09-08 02:43:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:43:57,706 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-08 02:43:57,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 02:43:57,707 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 47 [2019-09-08 02:43:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:43:57,708 INFO L225 Difference]: With dead ends: 54 [2019-09-08 02:43:57,708 INFO L226 Difference]: Without dead ends: 49 [2019-09-08 02:43:57,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:43:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-08 02:43:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-08 02:43:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-08 02:43:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-08 02:43:57,712 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-09-08 02:43:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:43:57,713 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-08 02:43:57,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 02:43:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-08 02:43:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 02:43:57,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:43:57,714 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:43:57,714 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:43:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:43:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash -572484514, now seen corresponding path program 38 times [2019-09-08 02:43:57,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:43:57,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:43:57,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:57,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:43:57,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:43:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:58,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:43:58,676 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-08 02:43:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:43:58,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:43:58,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:43:58,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-08 02:43:58,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:43:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:43:58,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:43:58,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-08 02:43:58,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 02:43:58,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 02:43:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:43:58,816 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 42 states. [2019-09-08 02:43:59,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:43:59,845 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-08 02:43:59,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 02:43:59,845 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 48 [2019-09-08 02:43:59,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:43:59,846 INFO L225 Difference]: With dead ends: 55 [2019-09-08 02:43:59,847 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 02:43:59,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:43:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 02:43:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-08 02:43:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-08 02:43:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-09-08 02:43:59,852 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-09-08 02:43:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:43:59,852 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-09-08 02:43:59,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 02:43:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-09-08 02:43:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 02:43:59,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:43:59,853 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:43:59,853 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:43:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:43:59,854 INFO L82 PathProgramCache]: Analyzing trace with hash -530689487, now seen corresponding path program 39 times [2019-09-08 02:43:59,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:43:59,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:43:59,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:59,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:43:59,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:44:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:44:00,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:44:00,756 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-08 02:44:00,775 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-08 02:44:38,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-08 02:44:38,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:44:38,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-08 02:44:38,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:44:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:44:38,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:44:38,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-08 02:44:38,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 02:44:38,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 02:44:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:44:38,365 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 43 states. [2019-09-08 02:44:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:44:39,467 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-08 02:44:39,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 02:44:39,467 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 49 [2019-09-08 02:44:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:44:39,469 INFO L225 Difference]: With dead ends: 56 [2019-09-08 02:44:39,469 INFO L226 Difference]: Without dead ends: 51 [2019-09-08 02:44:39,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:44:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-08 02:44:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-08 02:44:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 02:44:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-08 02:44:39,472 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-09-08 02:44:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:44:39,473 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-08 02:44:39,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 02:44:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-08 02:44:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 02:44:39,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:44:39,474 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:44:39,474 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:44:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:44:39,474 INFO L82 PathProgramCache]: Analyzing trace with hash 764956350, now seen corresponding path program 40 times [2019-09-08 02:44:39,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:44:39,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:44:39,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:39,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:44:39,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:44:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:44:40,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:44:40,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:44:40,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:44:40,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:44:40,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:44:40,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-08 02:44:40,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:44:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:44:40,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:44:40,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-08 02:44:40,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 02:44:40,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 02:44:40,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:44:40,678 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 44 states. [2019-09-08 02:44:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:44:41,831 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-08 02:44:41,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 02:44:41,832 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 50 [2019-09-08 02:44:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:44:41,833 INFO L225 Difference]: With dead ends: 57 [2019-09-08 02:44:41,833 INFO L226 Difference]: Without dead ends: 52 [2019-09-08 02:44:41,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:44:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-08 02:44:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-08 02:44:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-08 02:44:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-09-08 02:44:41,838 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-09-08 02:44:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:44:41,838 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-09-08 02:44:41,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 02:44:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-09-08 02:44:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 02:44:41,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:44:41,839 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:44:41,840 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:44:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:44:41,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2019695663, now seen corresponding path program 41 times [2019-09-08 02:44:41,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:44:41,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:44:41,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:41,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:44:41,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:44:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:44:42,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:44:42,819 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-08 02:44:42,830 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:46:57,539 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-08 02:46:57,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:46:59,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-08 02:46:59,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:46:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:46:59,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:46:59,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-08 02:46:59,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 02:46:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 02:46:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:46:59,083 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 45 states. [2019-09-08 02:47:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:47:00,258 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-09-08 02:47:00,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 02:47:00,258 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 51 [2019-09-08 02:47:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:47:00,259 INFO L225 Difference]: With dead ends: 58 [2019-09-08 02:47:00,259 INFO L226 Difference]: Without dead ends: 53 [2019-09-08 02:47:00,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:47:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-08 02:47:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-09-08 02:47:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 02:47:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-08 02:47:00,263 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-09-08 02:47:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:47:00,264 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-08 02:47:00,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 02:47:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-08 02:47:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 02:47:00,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:47:00,265 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:47:00,265 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:47:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:47:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1850405150, now seen corresponding path program 42 times [2019-09-08 02:47:00,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:47:00,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:47:00,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:47:00,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:47:00,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:47:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:47:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:47:01,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:47:01,278 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-08 02:47:01,288 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:48:25,850 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-08 02:48:25,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:26,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-08 02:48:26,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:26,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:26,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-08 02:48:26,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 02:48:26,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 02:48:26,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:48:26,528 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 46 states. [2019-09-08 02:48:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:27,782 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-08 02:48:27,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 02:48:27,784 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2019-09-08 02:48:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:27,785 INFO L225 Difference]: With dead ends: 59 [2019-09-08 02:48:27,785 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 02:48:27,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:48:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 02:48:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-08 02:48:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-08 02:48:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-09-08 02:48:27,788 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-09-08 02:48:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:27,789 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-09-08 02:48:27,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 02:48:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-09-08 02:48:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 02:48:27,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:27,789 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:27,790 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1564446065, now seen corresponding path program 43 times [2019-09-08 02:48:27,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:27,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:27,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:27,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:28,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:28,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 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-08 02:48:28,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:48:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:28,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-08 02:48:28,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:28,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:28,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-08 02:48:28,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 02:48:28,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 02:48:28,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:48:28,930 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 47 states. [2019-09-08 02:48:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:30,197 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-08 02:48:30,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 02:48:30,198 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 53 [2019-09-08 02:48:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:30,199 INFO L225 Difference]: With dead ends: 60 [2019-09-08 02:48:30,199 INFO L226 Difference]: Without dead ends: 55 [2019-09-08 02:48:30,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:48:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-08 02:48:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-08 02:48:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 02:48:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-08 02:48:30,202 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-09-08 02:48:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:30,203 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-08 02:48:30,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 02:48:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-08 02:48:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 02:48:30,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:30,203 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:30,203 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1289649022, now seen corresponding path program 44 times [2019-09-08 02:48:30,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:30,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:30,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:30,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:48:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:31,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:31,319 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-08 02:48:31,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:48:31,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:48:31,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:31,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-08 02:48:31,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:31,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:31,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-08 02:48:31,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 02:48:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 02:48:31,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:48:31,433 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 48 states. [2019-09-08 02:48:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:32,809 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-08 02:48:32,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 02:48:32,809 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2019-09-08 02:48:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:32,810 INFO L225 Difference]: With dead ends: 61 [2019-09-08 02:48:32,810 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 02:48:32,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:48:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 02:48:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-08 02:48:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-08 02:48:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-09-08 02:48:32,813 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-09-08 02:48:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:32,814 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-09-08 02:48:32,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 02:48:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-09-08 02:48:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 02:48:32,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:32,814 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:32,815 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:32,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:32,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1360875281, now seen corresponding path program 45 times [2019-09-08 02:48:32,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:32,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:32,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:32,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:32,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:34,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:34,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:48:34,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:03,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-08 02:49:03,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:03,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-08 02:49:03,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:03,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:03,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-08 02:49:03,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 02:49:03,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 02:49:03,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 02:49:03,948 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 49 states. [2019-09-08 02:49:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:05,352 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-08 02:49:05,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 02:49:05,352 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 55 [2019-09-08 02:49:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:05,353 INFO L225 Difference]: With dead ends: 62 [2019-09-08 02:49:05,353 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 02:49:05,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 02:49:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 02:49:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-08 02:49:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 02:49:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-08 02:49:05,357 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-09-08 02:49:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:05,358 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-08 02:49:05,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 02:49:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-08 02:49:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 02:49:05,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:05,358 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:05,359 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:05,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:05,359 INFO L82 PathProgramCache]: Analyzing trace with hash -726077986, now seen corresponding path program 46 times [2019-09-08 02:49:05,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:05,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:05,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:06,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:06,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:49:06,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:49:06,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:49:06,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:06,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-08 02:49:06,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:06,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:06,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-08 02:49:06,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 02:49:06,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 02:49:06,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:49:06,827 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 50 states. [2019-09-08 02:49:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:08,388 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-08 02:49:08,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 02:49:08,388 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 56 [2019-09-08 02:49:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:08,389 INFO L225 Difference]: With dead ends: 63 [2019-09-08 02:49:08,389 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 02:49:08,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:49:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 02:49:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-08 02:49:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 02:49:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-09-08 02:49:08,395 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-09-08 02:49:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:08,395 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-09-08 02:49:08,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 02:49:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-09-08 02:49:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 02:49:08,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:08,395 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:08,396 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash -997119823, now seen corresponding path program 47 times [2019-09-08 02:49:08,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:08,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:08,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:08,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:08,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:09,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:09,883 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-08 02:49:09,894 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:52:03,528 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-08 02:52:03,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:52:04,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-08 02:52:04,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:52:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:04,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:52:04,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-08 02:52:04,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 02:52:04,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 02:52:04,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:52:04,122 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 51 states. [2019-09-08 02:52:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:05,660 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-09-08 02:52:05,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 02:52:05,666 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 57 [2019-09-08 02:52:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:05,667 INFO L225 Difference]: With dead ends: 64 [2019-09-08 02:52:05,667 INFO L226 Difference]: Without dead ends: 59 [2019-09-08 02:52:05,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:52:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-08 02:52:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-08 02:52:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 02:52:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-08 02:52:05,671 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-09-08 02:52:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:05,671 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-08 02:52:05,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 02:52:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-08 02:52:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 02:52:05,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:05,672 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:05,672 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash -809482178, now seen corresponding path program 48 times [2019-09-08 02:52:05,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:05,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:05,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:52:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:06,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:52:06,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:52:06,959 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE