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/simple_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:48:54,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:48:54,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:48:54,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:48:54,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:48:54,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:48:54,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:48:54,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:48:54,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:48:54,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:48:54,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:48:54,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:48:54,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:48:54,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:48:54,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:48:54,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:48:54,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:48:54,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:48:54,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:48:54,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:48:54,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:48:54,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:48:54,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:48:54,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:48:54,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:48:54,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:48:54,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:48:54,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:48:54,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:48:54,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:48:54,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:48:54,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:48:54,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:48:54,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:48:54,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:48:54,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:48:54,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:48:54,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:48:54,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:48:54,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:48:54,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:48:54,738 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:48:54,751 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:48:54,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:48:54,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:48:54,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:48:54,753 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:48:54,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:48:54,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:48:54,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:48:54,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:48:54,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:48:54,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:48:54,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:48:54,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:48:54,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:48:54,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:48:54,755 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:48:54,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:48:54,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:48:54,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:48:54,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:48:54,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:48:54,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:48:54,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:48:54,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:48:54,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:48:54,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:48:54,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:48:54,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:48:54,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:48:54,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:48:54,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:48:54,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:48:54,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:48:54,806 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:48:54,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_4-1.c [2019-09-05 11:48:54,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70bd5b636/5b53be6f357f4e8186b56c29e089f4ad/FLAG69dd13784 [2019-09-05 11:48:55,296 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:48:55,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_4-1.c [2019-09-05 11:48:55,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70bd5b636/5b53be6f357f4e8186b56c29e089f4ad/FLAG69dd13784 [2019-09-05 11:48:55,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70bd5b636/5b53be6f357f4e8186b56c29e089f4ad [2019-09-05 11:48:55,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:48:55,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:48:55,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:48:55,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:48:55,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:48:55,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:48:55" (1/1) ... [2019-09-05 11:48:55,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fbd674b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55, skipping insertion in model container [2019-09-05 11:48:55,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:48:55" (1/1) ... [2019-09-05 11:48:55,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:48:55,747 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:48:55,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:48:55,904 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:48:55,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:48:55,928 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:48:55,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55 WrapperNode [2019-09-05 11:48:55,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:48:55,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:48:55,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:48:55,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:48:56,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55" (1/1) ... [2019-09-05 11:48:56,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55" (1/1) ... [2019-09-05 11:48:56,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55" (1/1) ... [2019-09-05 11:48:56,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55" (1/1) ... [2019-09-05 11:48:56,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55" (1/1) ... [2019-09-05 11:48:56,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55" (1/1) ... [2019-09-05 11:48:56,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55" (1/1) ... [2019-09-05 11:48:56,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:48:56,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:48:56,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:48:56,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:48:56,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:48:56,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:48:56,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:48:56,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:48:56,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:48:56,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:48:56,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:48:56,079 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:48:56,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:48:56,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:48:56,230 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:48:56,230 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 11:48:56,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:48:56 BoogieIcfgContainer [2019-09-05 11:48:56,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:48:56,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:48:56,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:48:56,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:48:56,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:48:55" (1/3) ... [2019-09-05 11:48:56,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280f9c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:48:56, skipping insertion in model container [2019-09-05 11:48:56,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:48:55" (2/3) ... [2019-09-05 11:48:56,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280f9c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:48:56, skipping insertion in model container [2019-09-05 11:48:56,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:48:56" (3/3) ... [2019-09-05 11:48:56,239 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_4-1.c [2019-09-05 11:48:56,248 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:48:56,254 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:48:56,269 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:48:56,299 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:48:56,300 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:48:56,300 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:48:56,301 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:48:56,301 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:48:56,302 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:48:56,302 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:48:56,302 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:48:56,302 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:48:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-05 11:48:56,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:48:56,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:56,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:56,331 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:56,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:56,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-05 11:48:56,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:56,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:56,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:48:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:56,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:48:56,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:48:56,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:48:56,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:48:56,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:48:56,560 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-05 11:48:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:56,627 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-05 11:48:56,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:48:56,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 11:48:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:56,644 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:48:56,645 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 11:48:56,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:48:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 11:48:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 11:48:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 11:48:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-05 11:48:56,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-05 11:48:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:56,733 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-05 11:48:56,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:48:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-05 11:48:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 11:48:56,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:56,735 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:56,735 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:56,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-05 11:48:56,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:56,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:56,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:48:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:56,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:56,862 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) [2019-09-05 11:48:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:48:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:56,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:48:56,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:56,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:56,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 11:48:56,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:48:56,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:48:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:48:56,957 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-05 11:48:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:56,977 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-05 11:48:56,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:48:56,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-05 11:48:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:56,979 INFO L225 Difference]: With dead ends: 18 [2019-09-05 11:48:56,979 INFO L226 Difference]: Without dead ends: 13 [2019-09-05 11:48:56,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:48:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-05 11:48:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-05 11:48:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 11:48:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-05 11:48:56,985 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-05 11:48:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:56,986 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-05 11:48:56,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:48:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-05 11:48:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:48:56,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:56,987 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:56,988 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:56,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:56,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-05 11:48:56,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:56,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:56,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:56,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:48:56,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:57,075 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-05 11:48:57,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:57,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:48:57,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:48:57,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:48:57,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:48:57,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:48:57,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:57,133 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-05 11:48:57,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:57,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-05 11:48:57,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:48:57,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:48:57,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:48:57,139 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-05 11:48:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:57,170 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-05 11:48:57,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:48:57,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-05 11:48:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:57,171 INFO L225 Difference]: With dead ends: 19 [2019-09-05 11:48:57,171 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 11:48:57,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:48:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 11:48:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 11:48:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 11:48:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-05 11:48:57,176 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-05 11:48:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:57,177 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-05 11:48:57,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:48:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-05 11:48:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:48:57,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:57,178 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:57,178 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-05 11:48:57,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:57,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:57,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:57,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:48:57,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:57,290 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-05 11:48:57,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:57,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:48:57,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:48:57,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:48:57,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:48:57,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:48:57,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:57,363 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-05 11:48:57,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:57,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-05 11:48:57,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:48:57,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:48:57,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:48:57,369 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-05 11:48:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:57,418 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-05 11:48:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:48:57,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-05 11:48:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:57,420 INFO L225 Difference]: With dead ends: 20 [2019-09-05 11:48:57,420 INFO L226 Difference]: Without dead ends: 15 [2019-09-05 11:48:57,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:48:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-05 11:48:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-05 11:48:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 11:48:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-05 11:48:57,430 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-05 11:48:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:57,432 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-05 11:48:57,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:48:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-05 11:48:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:48:57,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:57,433 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:57,434 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-05 11:48:57,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:57,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:57,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:48:57,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:57,576 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-05 11:48:57,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:57,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:48:57,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:48:57,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:48:57,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:48:57,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:48:57,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:57,649 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-05 11:48:57,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:57,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:48:57,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:48:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:48:57,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:48:57,655 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-05 11:48:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:57,692 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-05 11:48:57,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:48:57,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-05 11:48:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:57,693 INFO L225 Difference]: With dead ends: 21 [2019-09-05 11:48:57,694 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 11:48:57,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:48:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 11:48:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 11:48:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 11:48:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-05 11:48:57,698 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-05 11:48:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:57,699 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-05 11:48:57,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:48:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-05 11:48:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:48:57,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:57,700 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:57,700 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:57,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:57,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-05 11:48:57,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:57,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:57,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:57,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:48:57,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:57,814 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-05 11:48:57,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:57,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:48:57,830 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:49:10,579 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-05 11:49:10,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:10,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:49:10,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:10,629 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-05 11:49:10,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:10,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-05 11:49:10,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:49:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:49:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:49:10,637 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-05 11:49:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:10,690 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-05 11:49:10,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:49:10,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-05 11:49:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:10,693 INFO L225 Difference]: With dead ends: 22 [2019-09-05 11:49:10,693 INFO L226 Difference]: Without dead ends: 17 [2019-09-05 11:49:10,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:49:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-05 11:49:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-05 11:49:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 11:49:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-05 11:49:10,698 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-05 11:49:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:10,698 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-05 11:49:10,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:49:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-05 11:49:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:49:10,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:10,699 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:10,700 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:10,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-05 11:49:10,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:10,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:10,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:10,862 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-05 11:49:10,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:10,863 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-05 11:49:10,881 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:49:10,899 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-05 11:49:10,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:10,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:49:10,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:10,927 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-05 11:49:10,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:10,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-05 11:49:10,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:49:10,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:49:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:49:10,932 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-05 11:49:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:11,007 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-05 11:49:11,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:49:11,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-05 11:49:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:11,008 INFO L225 Difference]: With dead ends: 23 [2019-09-05 11:49:11,008 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 11:49:11,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:49:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 11:49:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-05 11:49:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 11:49:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-05 11:49:11,017 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-05 11:49:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:11,017 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-05 11:49:11,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:49:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-05 11:49:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:49:11,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:11,019 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:11,019 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:11,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-05 11:49:11,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:11,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:11,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:11,179 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-05 11:49:11,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:11,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:11,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:49:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:11,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 11:49:11,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:11,237 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-05 11:49:11,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:11,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-05 11:49:11,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:49:11,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:49:11,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:49:11,242 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-05 11:49:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:11,321 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-05 11:49:11,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:49:11,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-05 11:49:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:11,323 INFO L225 Difference]: With dead ends: 24 [2019-09-05 11:49:11,323 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 11:49:11,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:49:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 11:49:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 11:49:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 11:49:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-05 11:49:11,331 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-05 11:49:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:11,332 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-05 11:49:11,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:49:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-05 11:49:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:49:11,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:11,341 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:11,341 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:11,341 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-05 11:49:11,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:11,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:11,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:11,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:49:11,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:11,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:11,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:49:11,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:11,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:49:11,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:11,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:49:11,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:11,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:11,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-05 11:49:11,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:49:11,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:49:11,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:49:11,578 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-05 11:49:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:11,658 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-05 11:49:11,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:49:11,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-05 11:49:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:11,661 INFO L225 Difference]: With dead ends: 25 [2019-09-05 11:49:11,661 INFO L226 Difference]: Without dead ends: 20 [2019-09-05 11:49:11,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:49:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-05 11:49:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-05 11:49:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 11:49:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-05 11:49:11,668 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-05 11:49:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:11,668 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-05 11:49:11,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:49:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-05 11:49:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:49:11,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:11,669 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:11,669 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:11,669 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-05 11:49:11,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:11,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:11,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:11,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:11,871 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-05 11:49:11,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:11,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:49:11,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:11,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:49:11,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:11,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:49:11,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:12,019 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-05 11:49:12,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:12,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-05 11:49:12,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:49:12,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:49:12,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:49:12,025 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-05 11:49:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:12,127 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-05 11:49:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:49:12,129 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-05 11:49:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:12,129 INFO L225 Difference]: With dead ends: 26 [2019-09-05 11:49:12,129 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 11:49:12,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:49:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 11:49:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-05 11:49:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 11:49:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-05 11:49:12,138 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-05 11:49:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:12,139 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-05 11:49:12,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:49:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-05 11:49:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:49:12,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:12,144 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:12,144 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-05 11:49:12,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:12,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:12,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:12,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:12,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:12,319 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-05 11:49:12,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:12,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 11:49:12,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:49:12,346 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:49:12,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:12,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 11:49:12,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:12,378 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-05 11:49:12,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:12,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-05 11:49:12,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:49:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:49:12,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:49:12,383 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-05 11:49:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:12,472 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-05 11:49:12,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:49:12,472 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-05 11:49:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:12,473 INFO L225 Difference]: With dead ends: 27 [2019-09-05 11:49:12,473 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 11:49:12,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:49:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 11:49:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-05 11:49:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 11:49:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-05 11:49:12,478 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-05 11:49:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:12,478 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-05 11:49:12,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:49:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-05 11:49:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:49:12,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:12,479 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:12,479 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-05 11:49:12,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:12,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:12,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:12,642 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-05 11:49:12,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:12,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:12,663 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:50:05,860 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-05 11:50:05,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:05,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 11:50:05,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:05,963 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-05 11:50:05,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:05,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-05 11:50:05,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:50:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:50:05,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:50:05,972 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-05 11:50:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:06,104 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-05 11:50:06,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:50:06,106 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-05 11:50:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:06,107 INFO L225 Difference]: With dead ends: 28 [2019-09-05 11:50:06,107 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 11:50:06,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:50:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 11:50:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-05 11:50:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 11:50:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-05 11:50:06,112 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-05 11:50:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:06,112 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-05 11:50:06,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:50:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-05 11:50:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:50:06,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:06,113 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:06,114 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:06,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-05 11:50:06,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:06,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:06,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:06,439 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-05 11:50:06,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:06,439 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-05 11:50:06,454 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-05 11:50:06,539 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:50:06,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:06,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:50:06,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:06,580 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-05 11:50:06,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:06,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-05 11:50:06,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:50:06,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:50:06,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:50:06,587 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-05 11:50:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:06,724 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-05 11:50:06,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:50:06,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-05 11:50:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:06,725 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:50:06,726 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 11:50:06,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:50:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 11:50:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-05 11:50:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 11:50:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-05 11:50:06,730 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-05 11:50:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:06,730 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-05 11:50:06,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:50:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-05 11:50:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 11:50:06,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:06,731 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:06,731 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-05 11:50:06,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:06,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:06,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:06,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:06,934 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-05 11:50:06,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:06,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:06,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:50:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:06,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:50:06,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:07,012 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-05 11:50:07,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:07,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-05 11:50:07,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:50:07,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:50:07,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:50:07,017 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-05 11:50:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:07,182 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-05 11:50:07,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:50:07,182 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-05 11:50:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:07,183 INFO L225 Difference]: With dead ends: 30 [2019-09-05 11:50:07,183 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 11:50:07,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:50:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 11:50:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-05 11:50:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 11:50:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-05 11:50:07,188 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-05 11:50:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:07,189 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-05 11:50:07,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:50:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-05 11:50:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:50:07,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:07,190 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:07,190 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:07,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:07,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-05 11:50:07,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:07,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:07,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:07,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:50:07,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:07,402 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-05 11:50:07,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:07,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:07,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:50:07,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:50:07,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:07,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:50:07,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:07,475 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-05 11:50:07,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:07,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-05 11:50:07,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:50:07,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:50:07,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:50:07,480 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-05 11:50:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:07,667 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-05 11:50:07,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:50:07,667 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-05 11:50:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:07,668 INFO L225 Difference]: With dead ends: 31 [2019-09-05 11:50:07,668 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 11:50:07,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:50:07,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 11:50:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-05 11:50:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 11:50:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-05 11:50:07,672 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-05 11:50:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:07,672 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-05 11:50:07,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:50:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-05 11:50:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 11:50:07,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:07,674 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:07,674 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:07,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:07,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-05 11:50:07,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:07,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:07,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:07,921 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-05 11:50:07,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:07,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:07,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:50:20,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 11:50:20,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:20,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:50:20,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:20,300 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-05 11:50:20,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:20,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-05 11:50:20,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:50:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:50:20,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:50:20,305 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-05 11:50:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:20,526 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-05 11:50:20,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:50:20,527 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-05 11:50:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:20,527 INFO L225 Difference]: With dead ends: 32 [2019-09-05 11:50:20,528 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 11:50:20,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:50:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 11:50:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-05 11:50:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 11:50:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-05 11:50:20,532 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-05 11:50:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:20,532 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-05 11:50:20,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:50:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-05 11:50:20,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:50:20,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:20,533 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:20,533 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:20,533 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-05 11:50:20,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:20,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:20,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:20,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:20,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:20,791 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-05 11:50:20,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:20,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:50:20,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:20,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:50:20,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:20,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:50:20,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:20,869 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-05 11:50:20,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:20,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-05 11:50:20,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:50:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:50:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:50:20,874 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-05 11:50:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:21,139 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-05 11:50:21,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:50:21,139 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-05 11:50:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:21,140 INFO L225 Difference]: With dead ends: 33 [2019-09-05 11:50:21,140 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 11:50:21,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:50:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 11:50:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-05 11:50:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 11:50:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-05 11:50:21,145 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-05 11:50:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:21,145 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-05 11:50:21,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:50:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-05 11:50:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 11:50:21,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:21,146 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:21,146 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-05 11:50:21,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:21,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:21,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:21,436 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-05 11:50:21,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:21,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:50:21,453 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:51:37,863 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-05 11:51:37,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:51:38,237 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:51:38,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:51:38,290 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-05 11:51:38,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:51:38,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-05 11:51:38,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:51:38,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:51:38,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:51:38,297 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-05 11:51:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:51:38,538 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-05 11:51:38,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:51:38,538 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-05 11:51:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:51:38,539 INFO L225 Difference]: With dead ends: 34 [2019-09-05 11:51:38,540 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 11:51:38,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:51:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 11:51:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-05 11:51:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 11:51:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-05 11:51:38,545 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-05 11:51:38,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:51:38,546 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-05 11:51:38,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:51:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-05 11:51:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:51:38,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:51:38,547 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:51:38,547 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:51:38,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:51:38,547 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-05 11:51:38,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:51:38,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:51:38,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:38,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:51:38,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:38,986 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-05 11:51:38,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:51:38,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:51:39,014 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:52:26,075 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-05 11:52:26,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:52:26,588 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:52:26,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:52:26,629 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-05 11:52:26,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:52:26,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-05 11:52:26,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:52:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:52:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:52:26,634 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-05 11:52:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:52:26,883 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-05 11:52:26,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:52:26,883 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-05 11:52:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:52:26,884 INFO L225 Difference]: With dead ends: 35 [2019-09-05 11:52:26,884 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 11:52:26,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:52:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 11:52:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-05 11:52:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:52:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-05 11:52:26,888 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-05 11:52:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:52:26,889 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-05 11:52:26,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:52:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-05 11:52:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 11:52:26,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:52:26,890 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:52:26,890 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:52:26,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:52:26,890 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-05 11:52:26,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:52:26,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:52:26,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:26,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:52:26,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:52:27,193 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-05 11:52:27,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:52:27,193 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-05 11:52:27,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:52:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:52:27,221 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:52:27,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:52:27,268 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-05 11:52:27,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:52:27,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-05 11:52:27,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:52:27,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:52:27,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:52:27,274 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-05 11:52:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:52:27,516 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-05 11:52:27,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:52:27,517 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-05 11:52:27,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:52:27,517 INFO L225 Difference]: With dead ends: 36 [2019-09-05 11:52:27,517 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:52:27,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:52:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:52:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 11:52:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:52:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-05 11:52:27,524 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-05 11:52:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:52:27,524 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-05 11:52:27,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:52:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-05 11:52:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:52:27,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:52:27,525 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:52:27,526 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:52:27,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:52:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-05 11:52:27,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:52:27,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:52:27,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:27,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:52:27,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:52:27,836 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-05 11:52:27,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:52:27,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:52:27,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:52:27,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:52:27,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:52:27,870 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:52:27,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:52:27,932 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-05 11:52:27,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:52:27,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-05 11:52:27,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:52:27,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:52:27,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:52:27,936 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-05 11:52:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:52:28,263 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-05 11:52:28,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:52:28,268 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-05 11:52:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:52:28,269 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:52:28,269 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 11:52:28,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:52:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 11:52:28,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-05 11:52:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 11:52:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-05 11:52:28,274 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-05 11:52:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:52:28,274 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-05 11:52:28,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:52:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-05 11:52:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 11:52:28,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:52:28,275 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:52:28,275 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:52:28,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:52:28,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-05 11:52:28,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:52:28,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:52:28,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:28,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:52:28,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:52:28,669 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-05 11:52:28,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:52:28,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:52:28,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:52:35,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 11:52:35,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:52:35,853 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 11:52:35,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:52:35,892 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-05 11:52:35,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:52:35,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-05 11:52:35,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:52:35,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:52:35,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:52:35,899 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-05 11:52:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:52:36,235 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-05 11:52:36,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:52:36,240 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-05 11:52:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:52:36,241 INFO L225 Difference]: With dead ends: 38 [2019-09-05 11:52:36,241 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:52:36,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:52:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:52:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 11:52:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:52:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-05 11:52:36,246 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-05 11:52:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:52:36,246 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-05 11:52:36,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:52:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-05 11:52:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:52:36,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:52:36,247 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:52:36,247 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:52:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:52:36,248 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-05 11:52:36,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:52:36,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:52:36,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:36,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:52:36,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:52:36,687 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-05 11:52:36,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:52:36,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:52:36,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:52:36,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:52:36,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:52:36,718 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 11:52:36,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:52:36,755 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-05 11:52:36,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:52:36,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-05 11:52:36,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:52:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:52:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:52:36,760 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-05 11:52:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:52:37,116 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-05 11:52:37,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:52:37,117 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-05 11:52:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:52:37,117 INFO L225 Difference]: With dead ends: 39 [2019-09-05 11:52:37,118 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 11:52:37,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:52:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 11:52:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-05 11:52:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 11:52:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-05 11:52:37,124 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-05 11:52:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:52:37,124 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-05 11:52:37,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:52:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-05 11:52:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 11:52:37,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:52:37,125 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:52:37,125 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:52:37,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:52:37,126 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-05 11:52:37,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:52:37,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:52:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:37,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:52:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:52:37,664 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-05 11:52:37,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:52:37,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:52:37,700 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:54:06,105 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-05 11:54:06,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:54:06,496 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:54:06,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:06,534 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-05 11:54:06,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:06,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-05 11:54:06,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:54:06,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:54:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:54:06,542 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-05 11:54:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:06,896 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-05 11:54:06,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:54:06,896 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-05 11:54:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:06,897 INFO L225 Difference]: With dead ends: 40 [2019-09-05 11:54:06,897 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 11:54:06,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:54:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 11:54:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 11:54:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 11:54:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-05 11:54:06,911 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-05 11:54:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:06,911 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-05 11:54:06,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:54:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-05 11:54:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 11:54:06,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:06,912 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:06,913 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:06,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:06,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-05 11:54:06,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:06,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:06,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:06,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:54:06,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:07,345 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-05 11:54:07,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:07,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:54:07,357 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:55:10,439 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:55:10,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:55:10,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 11:55:10,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:55:10,663 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-05 11:55:10,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:55:10,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-05 11:55:10,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:55:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:55:10,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:55:10,671 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-05 11:55:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:55:11,051 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-05 11:55:11,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:55:11,052 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-05 11:55:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:55:11,053 INFO L225 Difference]: With dead ends: 41 [2019-09-05 11:55:11,053 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 11:55:11,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:55:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 11:55:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-05 11:55:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 11:55:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-05 11:55:11,059 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-05 11:55:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:55:11,059 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-05 11:55:11,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:55:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-05 11:55:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 11:55:11,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:55:11,060 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:55:11,061 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:55:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:55:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-05 11:55:11,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:55:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:55:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:11,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:55:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:11,521 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-05 11:55:11,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:55:11,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:55:11,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:55:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:11,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 11:55:11,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:55:11,586 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-05 11:55:11,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:55:11,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-05 11:55:11,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:55:11,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:55:11,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:55:11,591 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-05 11:55:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:55:12,070 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-05 11:55:12,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:55:12,071 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-05 11:55:12,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:55:12,072 INFO L225 Difference]: With dead ends: 42 [2019-09-05 11:55:12,072 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 11:55:12,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:55:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 11:55:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 11:55:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 11:55:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-05 11:55:12,077 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-05 11:55:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:55:12,078 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-05 11:55:12,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:55:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-05 11:55:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:55:12,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:55:12,079 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:55:12,079 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:55:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:55:12,079 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-05 11:55:12,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:55:12,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:55:12,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:12,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:55:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:12,552 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-05 11:55:12,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:55:12,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:55:12,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:55:12,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:55:12,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:55:12,584 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 11:55:12,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:55:12,653 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-05 11:55:12,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:55:12,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-05 11:55:12,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:55:12,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:55:12,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:55:12,659 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-05 11:55:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:55:13,149 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-05 11:55:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:55:13,150 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-05 11:55:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:55:13,150 INFO L225 Difference]: With dead ends: 43 [2019-09-05 11:55:13,151 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 11:55:13,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:55:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 11:55:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-05 11:55:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-05 11:55:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-05 11:55:13,155 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-05 11:55:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:55:13,156 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-05 11:55:13,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:55:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-05 11:55:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 11:55:13,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:55:13,157 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:55:13,157 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:55:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:55:13,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-05 11:55:13,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:55:13,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:55:13,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:13,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:55:13,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:13,637 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-05 11:55:13,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:55:13,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:55:13,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:55:16,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 11:55:16,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:55:16,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 11:55:16,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:55:16,657 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-05 11:55:16,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:55:16,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-05 11:55:16,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:55:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:55:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:55:16,664 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-05 11:55:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:55:17,200 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-05 11:55:17,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:55:17,201 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-05 11:55:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:55:17,202 INFO L225 Difference]: With dead ends: 44 [2019-09-05 11:55:17,202 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 11:55:17,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:55:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 11:55:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-05 11:55:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 11:55:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-05 11:55:17,210 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-05 11:55:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:55:17,210 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-05 11:55:17,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:55:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-05 11:55:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:55:17,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:55:17,211 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:55:17,212 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:55:17,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:55:17,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-05 11:55:17,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:55:17,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:55:17,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:17,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:55:17,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:17,752 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-05 11:55:17,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:55:17,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:55:17,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:55:17,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:55:17,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:55:17,784 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 11:55:17,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:55:17,830 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-05 11:55:17,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:55:17,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-05 11:55:17,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:55:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:55:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:55:17,836 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-05 11:55:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:55:18,421 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-05 11:55:18,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:55:18,421 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-05 11:55:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:55:18,422 INFO L225 Difference]: With dead ends: 45 [2019-09-05 11:55:18,422 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 11:55:18,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:55:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 11:55:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-05 11:55:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 11:55:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-05 11:55:18,432 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-05 11:55:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:55:18,433 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-05 11:55:18,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:55:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-05 11:55:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 11:55:18,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:55:18,434 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:55:18,434 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:55:18,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:55:18,434 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-05 11:55:18,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:55:18,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:55:18,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:18,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:55:18,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:19,056 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-05 11:55:19,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:55:19,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:55:19,067 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:57:51,182 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-05 11:57:51,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:57:51,407 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 11:57:51,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:57:51,452 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-05 11:57:51,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:57:51,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-05 11:57:51,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:57:51,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:57:51,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:57:51,461 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-05 11:57:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:57:52,088 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-05 11:57:52,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:57:52,089 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-05 11:57:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:57:52,090 INFO L225 Difference]: With dead ends: 46 [2019-09-05 11:57:52,090 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 11:57:52,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:57:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 11:57:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 11:57:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 11:57:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-05 11:57:52,096 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-05 11:57:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:57:52,096 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-05 11:57:52,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:57:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-05 11:57:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:57:52,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:52,098 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:57:52,098 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:52,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:52,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-05 11:57:52,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:52,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:52,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:52,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:57:52,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:52,726 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-05 11:57:52,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:57:52,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:57:52,738 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:59:56,978 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-05 11:59:56,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:00,059 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 12:00:00,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:00,105 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-05 12:00:00,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:00,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-05 12:00:00,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 12:00:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 12:00:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:00:00,113 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-05 12:00:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:00,785 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-05 12:00:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 12:00:00,785 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-05 12:00:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:00,786 INFO L225 Difference]: With dead ends: 47 [2019-09-05 12:00:00,786 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 12:00:00,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:00:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 12:00:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-05 12:00:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 12:00:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-05 12:00:00,790 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-05 12:00:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:00,790 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-05 12:00:00,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 12:00:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-05 12:00:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 12:00:00,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:00,791 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:00,791 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:00,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-05 12:00:00,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:00,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:00,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:00,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:00,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:01,435 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-05 12:00:01,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:01,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:01,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:01,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 12:00:01,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:01,550 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-05 12:00:01,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:01,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-05 12:00:01,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 12:00:01,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 12:00:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:00:01,557 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-05 12:00:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:02,258 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-05 12:00:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 12:00:02,263 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-05 12:00:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:02,264 INFO L225 Difference]: With dead ends: 48 [2019-09-05 12:00:02,264 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 12:00:02,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:00:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 12:00:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 12:00:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 12:00:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-05 12:00:02,268 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-05 12:00:02,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:02,268 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-05 12:00:02,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 12:00:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-05 12:00:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 12:00:02,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:02,269 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:02,269 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:02,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-05 12:00:02,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:02,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:02,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:02,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:02,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:02,895 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-05 12:00:02,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:02,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:02,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:00:02,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:02,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:02,929 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-05 12:00:02,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:02,979 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-05 12:00:02,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:02,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-05 12:00:02,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 12:00:02,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 12:00:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 12:00:02,983 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-05 12:00:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:03,737 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-05 12:00:03,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 12:00:03,738 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-05 12:00:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:03,739 INFO L225 Difference]: With dead ends: 49 [2019-09-05 12:00:03,739 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 12:00:03,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 12:00:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 12:00:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-05 12:00:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:00:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-05 12:00:03,743 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-05 12:00:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:03,744 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-05 12:00:03,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 12:00:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-05 12:00:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 12:00:03,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:03,744 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:03,747 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-05 12:00:03,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:03,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:03,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:03,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:03,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:04,503 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-05 12:00:04,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:04,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:04,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:00:48,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 12:00:48,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:48,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-05 12:00:48,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:48,676 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-05 12:00:48,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:48,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-05 12:00:48,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 12:00:48,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 12:00:48,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:00:48,685 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-05 12:00:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:49,488 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-05 12:00:49,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 12:00:49,488 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-05 12:00:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:49,489 INFO L225 Difference]: With dead ends: 50 [2019-09-05 12:00:49,489 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 12:00:49,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:00:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 12:00:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-05 12:00:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 12:00:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-05 12:00:49,493 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-05 12:00:49,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:49,493 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-05 12:00:49,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 12:00:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-05 12:00:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 12:00:49,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:49,494 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:49,494 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:49,495 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-05 12:00:49,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:49,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:49,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:49,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:49,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:50,230 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-05 12:00:50,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:50,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:50,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:00:50,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:00:50,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:50,262 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 12:00:50,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:50,301 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-05 12:00:50,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:50,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-05 12:00:50,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 12:00:50,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 12:00:50,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:00:50,306 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-05 12:00:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:51,127 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-05 12:00:51,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 12:00:51,128 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-05 12:00:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:51,129 INFO L225 Difference]: With dead ends: 51 [2019-09-05 12:00:51,129 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 12:00:51,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:00:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 12:00:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-05 12:00:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 12:00:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-05 12:00:51,131 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-05 12:00:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:51,132 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-05 12:00:51,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 12:00:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-05 12:00:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-05 12:00:51,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:51,132 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:51,132 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:51,133 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-05 12:00:51,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:51,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:51,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:51,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:51,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:51,944 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-05 12:00:51,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:51,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:51,958 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1