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/diamond_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:37:39,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:37:39,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:37:39,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:37:39,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:37:39,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:37:39,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:37:39,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:37:39,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:37:39,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:37:39,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:37:39,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:37:39,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:37:39,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:37:39,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:37:39,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:37:39,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:37:39,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:37:39,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:37:39,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:37:39,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:37:39,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:37:39,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:37:39,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:37:39,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:37:39,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:37:39,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:37:39,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:37:39,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:37:39,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:37:39,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:37:39,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:37:39,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:37:39,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:37:39,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:37:39,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:37:39,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:37:39,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:37:39,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:37:39,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:37:39,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:37:39,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:37:39,955 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:37:39,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:37:39,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:37:39,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:37:39,957 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:37:39,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:37:39,958 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:37:39,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:37:39,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:37:39,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:37:39,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:37:39,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:37:39,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:37:39,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:37:39,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:37:39,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:37:39,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:37:39,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:37:39,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:37:39,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:37:39,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:37:39,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:37:39,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:37:39,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:37:39,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:37:39,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:37:39,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:37:39,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:37:39,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:37:39,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:37:40,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:37:40,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:37:40,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:37:40,014 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:37:40,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2019-09-08 02:37:40,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5ad4a5a/163a575922b84d4eaf5e6ef8f9f4c339/FLAGf0894ffa2 [2019-09-08 02:37:40,511 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:37:40,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2019-09-08 02:37:40,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5ad4a5a/163a575922b84d4eaf5e6ef8f9f4c339/FLAGf0894ffa2 [2019-09-08 02:37:40,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5ad4a5a/163a575922b84d4eaf5e6ef8f9f4c339 [2019-09-08 02:37:40,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:37:40,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:37:40,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:37:40,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:37:40,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:37:40,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fda517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:40, skipping insertion in model container [2019-09-08 02:37:40,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:37:40" (1/1) ... [2019-09-08 02:37:40,953 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:37:40,971 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:37:41,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:37:41,164 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:37:41,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:37:41,195 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:37:41,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:41 WrapperNode [2019-09-08 02:37:41,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:37:41,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:37:41,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:37:41,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:37:41,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:41" (1/1) ... [2019-09-08 02:37:41,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:41" (1/1) ... [2019-09-08 02:37:41,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:41" (1/1) ... [2019-09-08 02:37:41,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:41" (1/1) ... [2019-09-08 02:37:41,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:41" (1/1) ... [2019-09-08 02:37:41,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:41" (1/1) ... [2019-09-08 02:37:41,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:41" (1/1) ... [2019-09-08 02:37:41,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:37:41,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:37:41,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:37:41,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:37:41,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:37:41,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:37:41,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:37:41,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:37:41,380 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:37:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:37:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 02:37:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:37:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:37:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:37:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:37:41,548 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:37:41,548 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 02:37:41,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:37:41 BoogieIcfgContainer [2019-09-08 02:37:41,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:37:41,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:37:41,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:37:41,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:37:41,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:37:40" (1/3) ... [2019-09-08 02:37:41,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d39596b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:37:41, skipping insertion in model container [2019-09-08 02:37:41,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:37:41" (2/3) ... [2019-09-08 02:37:41,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d39596b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:37:41, skipping insertion in model container [2019-09-08 02:37:41,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:37:41" (3/3) ... [2019-09-08 02:37:41,557 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2019-09-08 02:37:41,566 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:37:41,574 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:37:41,589 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:37:41,615 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:37:41,615 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:37:41,616 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:37:41,616 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:37:41,616 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:37:41,616 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:37:41,616 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:37:41,616 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:37:41,617 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:37:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-08 02:37:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 02:37:41,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:41,638 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:41,640 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:41,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:41,645 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-08 02:37:41,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:41,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:41,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:37:41,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:37:41,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:37:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:37:41,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:37:41,760 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-08 02:37:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:41,782 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-08 02:37:41,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:37:41,784 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-08 02:37:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:41,792 INFO L225 Difference]: With dead ends: 29 [2019-09-08 02:37:41,792 INFO L226 Difference]: Without dead ends: 12 [2019-09-08 02:37:41,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:37:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-08 02:37:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-08 02:37:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-08 02:37:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-08 02:37:41,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-08 02:37:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:41,831 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-08 02:37:41,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:37:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-08 02:37:41,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 02:37:41,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:41,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:41,833 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:41,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:41,833 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-08 02:37:41,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:41,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:41,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:41,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:41,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:37:41,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:37:41,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:37:41,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:37:41,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:37:41,960 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-08 02:37:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:42,019 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-09-08 02:37:42,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:37:42,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-08 02:37:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:42,023 INFO L225 Difference]: With dead ends: 19 [2019-09-08 02:37:42,023 INFO L226 Difference]: Without dead ends: 14 [2019-09-08 02:37:42,025 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-08 02:37:42,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-08 02:37:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-08 02:37:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-08 02:37:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-08 02:37:42,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-08 02:37:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:42,032 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-08 02:37:42,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:37:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-08 02:37:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:37:42,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:42,033 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:42,033 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:42,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-08 02:37:42,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:42,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:42,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:42,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:42,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:42,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:42,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 02:37:42,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:42,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 02:37:42,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:37:42,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:37:42,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:37:42,298 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-09-08 02:37:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:42,364 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-09-08 02:37:42,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:37:42,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-08 02:37:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:42,366 INFO L225 Difference]: With dead ends: 23 [2019-09-08 02:37:42,366 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 02:37:42,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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-08 02:37:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 02:37:42,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-09-08 02:37:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-08 02:37:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-08 02:37:42,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-08 02:37:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:42,373 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-08 02:37:42,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:37:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-08 02:37:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:37:42,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:42,375 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:42,375 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:42,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:42,376 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-08 02:37:42,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:42,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:42,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:42,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:42,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:42,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:37:42,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:37:42,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:42,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 02:37:42,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:42,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 02:37:42,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:37:42,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:37:42,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:37:42,589 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2019-09-08 02:37:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:42,672 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-09-08 02:37:42,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:37:42,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-08 02:37:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:42,675 INFO L225 Difference]: With dead ends: 26 [2019-09-08 02:37:42,675 INFO L226 Difference]: Without dead ends: 21 [2019-09-08 02:37:42,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 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-08 02:37:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-08 02:37:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-09-08 02:37:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 02:37:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-09-08 02:37:42,687 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2019-09-08 02:37:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:42,687 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-09-08 02:37:42,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:37:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-09-08 02:37:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:37:42,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:42,690 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:42,690 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:42,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash -976494032, now seen corresponding path program 1 times [2019-09-08 02:37:42,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:42,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:42,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:42,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:42,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:42,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 02:37:42,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:42,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:37:42,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 02:37:42,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:37:42,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:37:42,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:37:42,868 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2019-09-08 02:37:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:42,979 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2019-09-08 02:37:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:37:42,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-08 02:37:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:42,982 INFO L225 Difference]: With dead ends: 32 [2019-09-08 02:37:42,982 INFO L226 Difference]: Without dead ends: 25 [2019-09-08 02:37:42,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:37:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-08 02:37:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-09-08 02:37:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 02:37:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-08 02:37:42,989 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-09-08 02:37:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:42,990 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-08 02:37:42,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:37:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-08 02:37:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:37:42,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:42,991 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:42,991 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2019-09-08 02:37:42,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:42,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:42,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:43,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:37:43,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:43,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:37:43,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:43,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 02:37:43,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:43,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 02:37:43,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:37:43,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:37:43,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:37:43,155 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 7 states. [2019-09-08 02:37:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:43,250 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-09-08 02:37:43,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:37:43,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-08 02:37:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:43,252 INFO L225 Difference]: With dead ends: 33 [2019-09-08 02:37:43,252 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 02:37:43,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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-08 02:37:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 02:37:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-09-08 02:37:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 02:37:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-09-08 02:37:43,267 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2019-09-08 02:37:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:43,268 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-09-08 02:37:43,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:37:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-09-08 02:37:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:37:43,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:43,269 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:43,270 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:43,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:43,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1391623509, now seen corresponding path program 2 times [2019-09-08 02:37:43,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:43,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:43,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:43,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:43,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:43,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:37:43,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:37:43,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:43,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 02:37:43,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:37:43,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:37:43,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 02:37:43,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:37:43,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:37:43,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:37:43,453 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 7 states. [2019-09-08 02:37:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:43,533 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-09-08 02:37:43,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:37:43,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-08 02:37:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:43,535 INFO L225 Difference]: With dead ends: 33 [2019-09-08 02:37:43,535 INFO L226 Difference]: Without dead ends: 25 [2019-09-08 02:37:43,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:37:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-08 02:37:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-08 02:37:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 02:37:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-08 02:37:43,545 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-09-08 02:37:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:43,545 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-08 02:37:43,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:37:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-08 02:37:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:37:43,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:43,547 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:43,547 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:43,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:43,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1784650519, now seen corresponding path program 1 times [2019-09-08 02:37:43,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:43,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:43,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:43,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:43,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:43,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 02:37:43,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:43,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 02:37:43,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:37:43,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:37:43,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:37:43,730 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-09-08 02:37:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:43,802 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-09-08 02:37:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:37:43,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-08 02:37:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:43,804 INFO L225 Difference]: With dead ends: 32 [2019-09-08 02:37:43,804 INFO L226 Difference]: Without dead ends: 27 [2019-09-08 02:37:43,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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-08 02:37:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-08 02:37:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-08 02:37:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:37:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-08 02:37:43,813 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-09-08 02:37:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:43,814 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-08 02:37:43,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:37:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-08 02:37:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:37:43,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:43,815 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:43,816 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash 662342572, now seen corresponding path program 4 times [2019-09-08 02:37:43,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:43,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:43,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:43,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:43,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:43,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:37:43,953 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:37:43,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:43,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 02:37:43,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:43,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:43,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 02:37:43,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:37:43,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:37:43,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:37:43,986 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2019-09-08 02:37:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:44,063 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-08 02:37:44,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:37:44,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-08 02:37:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:44,066 INFO L225 Difference]: With dead ends: 34 [2019-09-08 02:37:44,066 INFO L226 Difference]: Without dead ends: 29 [2019-09-08 02:37:44,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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-08 02:37:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-08 02:37:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-08 02:37:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 02:37:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-08 02:37:44,080 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2019-09-08 02:37:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:44,080 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-08 02:37:44,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:37:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-08 02:37:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:37:44,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:44,082 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:44,082 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash -224607324, now seen corresponding path program 2 times [2019-09-08 02:37:44,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:44,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:44,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:44,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:44,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:37:44,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:44,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:37:44,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:44,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 02:37:44,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:44,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:44,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 02:37:44,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:37:44,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:37:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:37:44,260 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2019-09-08 02:37:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:44,353 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-08 02:37:44,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:37:44,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-08 02:37:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:44,354 INFO L225 Difference]: With dead ends: 36 [2019-09-08 02:37:44,354 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 02:37:44,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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-08 02:37:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 02:37:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-08 02:37:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 02:37:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-08 02:37:44,365 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2019-09-08 02:37:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:44,366 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-08 02:37:44,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:37:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-08 02:37:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:37:44,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:44,368 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:44,368 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:44,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1931383913, now seen corresponding path program 5 times [2019-09-08 02:37:44,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:44,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:44,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:44,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:37:44,525 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:44,587 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 02:37:44,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:44,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 02:37:44,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:44,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:44,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-08 02:37:44,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:37:44,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:37:44,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:37:44,620 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2019-09-08 02:37:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:44,697 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-08 02:37:44,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:37:44,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-08 02:37:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:44,698 INFO L225 Difference]: With dead ends: 38 [2019-09-08 02:37:44,698 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 02:37:44,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:37:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 02:37:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-08 02:37:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 02:37:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-08 02:37:44,703 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-09-08 02:37:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:44,704 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-08 02:37:44,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:37:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-08 02:37:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:37:44,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:44,705 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:44,705 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash 33316767, now seen corresponding path program 3 times [2019-09-08 02:37:44,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:44,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:44,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:44,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:44,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:37:44,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 02:37:44,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:44,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 02:37:44,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:45,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:37:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 02:37:45,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:37:45,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2019-09-08 02:37:45,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:37:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:37:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:37:45,265 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 13 states. [2019-09-08 02:37:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:45,615 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-09-08 02:37:45,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 02:37:45,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-09-08 02:37:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:45,616 INFO L225 Difference]: With dead ends: 44 [2019-09-08 02:37:45,617 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 02:37:45,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:37:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 02:37:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-08 02:37:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 02:37:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-08 02:37:45,623 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-08 02:37:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:45,624 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-08 02:37:45,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:37:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-08 02:37:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 02:37:45,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:45,626 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:45,626 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:45,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1709400550, now seen corresponding path program 6 times [2019-09-08 02:37:45,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:45,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:45,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:45,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:45,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:45,763 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:37:45,790 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 02:37:45,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:45,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 02:37:45,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:45,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:45,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 02:37:45,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:37:45,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:37:45,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:37:45,825 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2019-09-08 02:37:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:45,917 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-08 02:37:45,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:37:45,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-08 02:37:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:45,919 INFO L225 Difference]: With dead ends: 31 [2019-09-08 02:37:45,919 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 02:37:45,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 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-08 02:37:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 02:37:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-08 02:37:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 02:37:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-08 02:37:45,926 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-08 02:37:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:45,927 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-08 02:37:45,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:37:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-08 02:37:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:37:45,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:45,928 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:45,928 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1163213789, now seen corresponding path program 7 times [2019-09-08 02:37:45,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:45,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:45,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:45,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:46,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:46,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:46,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:46,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 02:37:46,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:46,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:46,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 02:37:46,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:37:46,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:37:46,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:37:46,127 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 11 states. [2019-09-08 02:37:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:46,240 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-08 02:37:46,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:37:46,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-08 02:37:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:46,241 INFO L225 Difference]: With dead ends: 33 [2019-09-08 02:37:46,241 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 02:37:46,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 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-08 02:37:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 02:37:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-08 02:37:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 02:37:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-08 02:37:46,245 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-08 02:37:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:46,245 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-08 02:37:46,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:37:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-08 02:37:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 02:37:46,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:46,246 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:46,247 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash -81622240, now seen corresponding path program 8 times [2019-09-08 02:37:46,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:46,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:46,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:46,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:46,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:46,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:46,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:37:46,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:46,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:37:46,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:46,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 02:37:46,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:46,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:46,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 02:37:46,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:37:46,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:37:46,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:37:46,434 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 12 states. [2019-09-08 02:37:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:46,567 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-08 02:37:46,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:37:46,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-08 02:37:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:46,568 INFO L225 Difference]: With dead ends: 35 [2019-09-08 02:37:46,568 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 02:37:46,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 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-08 02:37:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 02:37:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-08 02:37:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 02:37:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-08 02:37:46,575 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-08 02:37:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:46,576 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-08 02:37:46,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:37:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-08 02:37:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 02:37:46,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:46,577 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:46,577 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash -54229283, now seen corresponding path program 9 times [2019-09-08 02:37:46,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:46,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:46,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:46,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:46,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:46,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:46,769 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) [2019-09-08 02:37:46,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:46,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 02:37:46,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:46,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 02:37:46,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:47,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:47,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 02:37:47,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:37:47,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:37:47,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:37:47,011 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 13 states. [2019-09-08 02:37:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:47,164 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-08 02:37:47,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:37:47,166 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-08 02:37:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:47,167 INFO L225 Difference]: With dead ends: 37 [2019-09-08 02:37:47,167 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:37:47,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 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-08 02:37:47,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:37:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-08 02:37:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 02:37:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-08 02:37:47,171 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-08 02:37:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:47,171 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-08 02:37:47,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:37:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-08 02:37:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 02:37:47,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:47,172 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:47,173 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:47,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:47,173 INFO L82 PathProgramCache]: Analyzing trace with hash 500598618, now seen corresponding path program 10 times [2019-09-08 02:37:47,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:47,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:47,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:47,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:47,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:47,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:47,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:37:47,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:37:47,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:37:47,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:47,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 02:37:47,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:47,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:47,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 02:37:47,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:37:47,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:37:47,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:37:47,439 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 14 states. [2019-09-08 02:37:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:47,611 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-08 02:37:47,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:37:47,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-08 02:37:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:47,612 INFO L225 Difference]: With dead ends: 39 [2019-09-08 02:37:47,612 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 02:37:47,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 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-08 02:37:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 02:37:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-08 02:37:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:37:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-08 02:37:47,617 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-08 02:37:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:47,617 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-08 02:37:47,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:37:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-08 02:37:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 02:37:47,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:47,618 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:47,618 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1114266775, now seen corresponding path program 11 times [2019-09-08 02:37:47,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:47,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:47,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:47,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:47,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:37:47,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:47,806 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-08 02:37:47,825 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:17,606 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 02:38:17,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:17,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 02:38:17,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:17,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:17,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-08 02:38:17,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:38:17,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:38:17,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:38:17,870 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 15 states. [2019-09-08 02:38:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:18,121 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-08 02:38:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:38:18,121 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-08 02:38:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:18,122 INFO L225 Difference]: With dead ends: 41 [2019-09-08 02:38:18,122 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 02:38:18,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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-08 02:38:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 02:38:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-08 02:38:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 02:38:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-08 02:38:18,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-08 02:38:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:18,126 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-08 02:38:18,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:38:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-08 02:38:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 02:38:18,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:18,127 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:18,128 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1856121196, now seen corresponding path program 12 times [2019-09-08 02:38:18,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:18,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:18,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:18,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:18,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:18,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:18,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:18,346 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:38:18,546 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 02:38:18,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:18,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 02:38:18,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:18,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:18,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-08 02:38:18,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:38:18,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:38:18,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:38:18,588 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 16 states. [2019-09-08 02:38:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:18,851 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-08 02:38:18,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:38:18,852 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-08 02:38:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:18,853 INFO L225 Difference]: With dead ends: 43 [2019-09-08 02:38:18,853 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 02:38:18,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:38:18,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 02:38:18,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-08 02:38:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 02:38:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-08 02:38:18,858 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-08 02:38:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:18,858 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-08 02:38:18,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:38:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-08 02:38:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:38:18,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:18,859 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:18,859 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:18,860 INFO L82 PathProgramCache]: Analyzing trace with hash -245709487, now seen corresponding path program 13 times [2019-09-08 02:38:18,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:18,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:18,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:18,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:18,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:19,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:19,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:19,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:38:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:19,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 02:38:19,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:19,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:19,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-08 02:38:19,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 02:38:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 02:38:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:38:19,151 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 17 states. [2019-09-08 02:38:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:19,483 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-08 02:38:19,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 02:38:19,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-08 02:38:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:19,485 INFO L225 Difference]: With dead ends: 45 [2019-09-08 02:38:19,485 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 02:38:19,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 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-08 02:38:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 02:38:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-08 02:38:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 02:38:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-08 02:38:19,490 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-08 02:38:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:19,490 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-08 02:38:19,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 02:38:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-08 02:38:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 02:38:19,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:19,491 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:19,492 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1171716302, now seen corresponding path program 14 times [2019-09-08 02:38:19,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:19,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:19,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:38:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:19,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:19,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:19,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:38:19,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:38:19,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:19,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 02:38:19,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:19,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:19,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-08 02:38:19,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:38:19,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:38:19,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:38:19,777 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 18 states. [2019-09-08 02:38:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:20,077 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-08 02:38:20,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 02:38:20,079 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-09-08 02:38:20,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:20,079 INFO L225 Difference]: With dead ends: 47 [2019-09-08 02:38:20,080 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 02:38:20,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 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-08 02:38:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 02:38:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-08 02:38:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 02:38:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-08 02:38:20,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-08 02:38:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:20,084 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-08 02:38:20,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:38:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-08 02:38:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 02:38:20,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:20,085 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:20,085 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:20,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1813266699, now seen corresponding path program 15 times [2019-09-08 02:38:20,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:20,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:20,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:20,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:20,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:20,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:38:20,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-08 02:38:20,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:20,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:38:20,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:20,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:20,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-08 02:38:20,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 02:38:20,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 02:38:20,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:38:20,650 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 19 states. [2019-09-08 02:38:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:21,097 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-08 02:38:21,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 02:38:21,101 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-08 02:38:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:21,102 INFO L225 Difference]: With dead ends: 49 [2019-09-08 02:38:21,102 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 02:38:21,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 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-08 02:38:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 02:38:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-08 02:38:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 02:38:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-08 02:38:21,107 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-08 02:38:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:21,107 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-08 02:38:21,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 02:38:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-08 02:38:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 02:38:21,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:21,108 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:21,108 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:21,108 INFO L82 PathProgramCache]: Analyzing trace with hash -132092408, now seen corresponding path program 16 times [2019-09-08 02:38:21,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:21,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:21,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:21,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:21,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:21,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:21,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:38:21,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:38:21,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:38:21,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:38:21,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 02:38:21,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:38:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:21,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:38:21,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-08 02:38:21,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:38:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:38:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:38:21,472 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 20 states. [2019-09-08 02:38:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:38:21,872 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-08 02:38:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:38:21,873 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-08 02:38:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:38:21,873 INFO L225 Difference]: With dead ends: 51 [2019-09-08 02:38:21,873 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 02:38:21,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 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-08 02:38:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 02:38:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-08 02:38:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 02:38:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-08 02:38:21,879 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-08 02:38:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:38:21,879 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-08 02:38:21,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:38:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-08 02:38:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 02:38:21,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:38:21,880 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:38:21,880 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:38:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:38:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1311420475, now seen corresponding path program 17 times [2019-09-08 02:38:21,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:38:21,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:38:21,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:21,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:38:21,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:38:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:38:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:38:22,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:38:22,187 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-08 02:38:22,230 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:39:19,324 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-08 02:39:19,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:19,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 02:39:19,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:19,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:19,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-08 02:39:19,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:39:19,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:39:19,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:39:19,702 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 21 states. [2019-09-08 02:39:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:20,196 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-08 02:39:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:39:20,197 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-09-08 02:39:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:20,198 INFO L225 Difference]: With dead ends: 53 [2019-09-08 02:39:20,198 INFO L226 Difference]: Without dead ends: 48 [2019-09-08 02:39:20,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 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-08 02:39:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-08 02:39:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-08 02:39:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 02:39:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-08 02:39:20,204 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-08 02:39:20,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:20,205 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-08 02:39:20,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:39:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-08 02:39:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 02:39:20,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:20,205 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:20,206 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash -774326718, now seen corresponding path program 18 times [2019-09-08 02:39:20,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:20,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:20,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:20,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:20,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:20,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:20,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:39:20,622 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:39:22,514 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 02:39:22,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:22,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 02:39:22,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:22,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:22,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-08 02:39:22,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 02:39:22,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 02:39:22,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:39:22,570 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2019-09-08 02:39:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:23,128 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-08 02:39:23,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:39:23,129 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-08 02:39:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:23,129 INFO L225 Difference]: With dead ends: 55 [2019-09-08 02:39:23,129 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 02:39:23,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:39:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 02:39:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-08 02:39:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-08 02:39:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-08 02:39:23,134 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-08 02:39:23,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:23,134 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-08 02:39:23,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 02:39:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-08 02:39:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 02:39:23,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:23,135 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:23,135 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:23,135 INFO L82 PathProgramCache]: Analyzing trace with hash -23301761, now seen corresponding path program 19 times [2019-09-08 02:39:23,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:23,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:23,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:23,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:23,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:23,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:23,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:39:23,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:39:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:23,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:39:23,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:23,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:23,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-08 02:39:23,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 02:39:23,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 02:39:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:39:23,573 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 23 states. [2019-09-08 02:39:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:24,147 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-08 02:39:24,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 02:39:24,147 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-08 02:39:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:24,148 INFO L225 Difference]: With dead ends: 57 [2019-09-08 02:39:24,148 INFO L226 Difference]: Without dead ends: 52 [2019-09-08 02:39:24,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:39:24,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-08 02:39:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-08 02:39:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 02:39:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-08 02:39:24,153 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-08 02:39:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:24,154 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-08 02:39:24,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 02:39:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-08 02:39:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 02:39:24,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:24,155 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:24,155 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:24,155 INFO L82 PathProgramCache]: Analyzing trace with hash 157176188, now seen corresponding path program 20 times [2019-09-08 02:39:24,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:24,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:24,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:24,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:39:24,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:24,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:24,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:39:24,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:39:24,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:39:24,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:24,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:39:24,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:24,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:24,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-08 02:39:24,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:39:24,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:39:24,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:39:24,575 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-09-08 02:39:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:25,183 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-08 02:39:25,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 02:39:25,186 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-08 02:39:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:25,187 INFO L225 Difference]: With dead ends: 59 [2019-09-08 02:39:25,187 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 02:39:25,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 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-08 02:39:25,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 02:39:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-08 02:39:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 02:39:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-08 02:39:25,194 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-08 02:39:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:25,194 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-08 02:39:25,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:39:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-08 02:39:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 02:39:25,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:25,195 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:25,196 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:25,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1797793337, now seen corresponding path program 21 times [2019-09-08 02:39:25,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:25,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:25,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:25,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:25,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:25,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:25,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:39:25,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:39:41,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-08 02:39:41,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:41,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 02:39:41,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:41,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:41,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-08 02:39:41,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:39:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:39:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:39:41,366 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 25 states. [2019-09-08 02:39:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:42,067 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-08 02:39:42,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 02:39:42,067 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-08 02:39:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:42,068 INFO L225 Difference]: With dead ends: 61 [2019-09-08 02:39:42,068 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 02:39:42,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 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-08 02:39:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 02:39:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-08 02:39:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 02:39:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-08 02:39:42,073 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-08 02:39:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:42,073 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-08 02:39:42,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:39:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-08 02:39:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 02:39:42,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:42,074 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:42,074 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2117091402, now seen corresponding path program 22 times [2019-09-08 02:39:42,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:42,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:42,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:42,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:42,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:39:42,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:39:42,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:39:42,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:42,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 02:39:42,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:42,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:42,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-08 02:39:42,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:39:42,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:39:42,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:39:42,573 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 26 states. [2019-09-08 02:39:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:43,300 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-08 02:39:43,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:39:43,303 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-09-08 02:39:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:43,303 INFO L225 Difference]: With dead ends: 63 [2019-09-08 02:39:43,303 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 02:39:43,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:39:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 02:39:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-08 02:39:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 02:39:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-08 02:39:43,307 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-08 02:39:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:43,308 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-08 02:39:43,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:39:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-08 02:39:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 02:39:43,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:43,309 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:43,309 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:43,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1929974285, now seen corresponding path program 23 times [2019-09-08 02:39:43,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:43,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:39:43,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:43,898 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) [2019-09-08 02:39:43,912 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:42,635 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-08 02:41:42,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:42,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 02:41:42,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:42,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:42,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-08 02:41:42,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:41:42,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:41:42,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:41:42,821 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 27 states. [2019-09-08 02:41:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:43,604 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-08 02:41:43,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:41:43,605 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-08 02:41:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:43,606 INFO L225 Difference]: With dead ends: 65 [2019-09-08 02:41:43,606 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 02:41:43,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 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-08 02:41:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 02:41:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-08 02:41:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 02:41:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-08 02:41:43,612 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-08 02:41:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:43,612 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-08 02:41:43,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:41:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-08 02:41:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 02:41:43,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:43,613 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:43,613 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1795916016, now seen corresponding path program 24 times [2019-09-08 02:41:43,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:43,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:43,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:43,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:43,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:41:44,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:44,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:44,100 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:42:15,356 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-08 02:42:15,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:15,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 02:42:15,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:15,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:15,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-08 02:42:15,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:42:15,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:42:15,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:42:15,447 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 28 states. [2019-09-08 02:42:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:16,265 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-08 02:42:16,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:42:16,266 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-08 02:42:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:16,267 INFO L225 Difference]: With dead ends: 67 [2019-09-08 02:42:16,267 INFO L226 Difference]: Without dead ends: 62 [2019-09-08 02:42:16,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 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-08 02:42:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-08 02:42:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-08 02:42:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-08 02:42:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-08 02:42:16,272 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-08 02:42:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:16,272 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-08 02:42:16,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:42:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-08 02:42:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 02:42:16,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:16,273 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:16,274 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:16,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:16,274 INFO L82 PathProgramCache]: Analyzing trace with hash 373770413, now seen corresponding path program 25 times [2019-09-08 02:42:16,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:16,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:16,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:16,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:16,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:16,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:16,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:16,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:42:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:16,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 02:42:16,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:16,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:16,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-08 02:42:16,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:42:16,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:42:16,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:42:16,946 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 29 states. [2019-09-08 02:42:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:17,869 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-09-08 02:42:17,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 02:42:17,869 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-08 02:42:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:17,870 INFO L225 Difference]: With dead ends: 69 [2019-09-08 02:42:17,870 INFO L226 Difference]: Without dead ends: 64 [2019-09-08 02:42:17,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:42:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-08 02:42:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-08 02:42:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 02:42:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-08 02:42:17,876 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-08 02:42:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:17,876 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-08 02:42:17,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:42:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-08 02:42:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 02:42:17,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:17,877 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:17,877 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:17,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:17,878 INFO L82 PathProgramCache]: Analyzing trace with hash -508553942, now seen corresponding path program 26 times [2019-09-08 02:42:17,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:17,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:17,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:17,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:42:17,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:18,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:18,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:18,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:42:18,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:42:18,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:18,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 02:42:18,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:18,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:18,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-08 02:42:18,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 02:42:18,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 02:42:18,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:42:18,467 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 30 states. [2019-09-08 02:42:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:19,427 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-09-08 02:42:19,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:42:19,427 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2019-09-08 02:42:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:19,428 INFO L225 Difference]: With dead ends: 71 [2019-09-08 02:42:19,428 INFO L226 Difference]: Without dead ends: 66 [2019-09-08 02:42:19,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 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-08 02:42:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-08 02:42:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-08 02:42:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-08 02:42:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-08 02:42:19,434 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-08 02:42:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:19,434 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-08 02:42:19,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 02:42:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-08 02:42:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 02:42:19,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:19,435 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:19,436 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:19,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:19,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1981265511, now seen corresponding path program 27 times [2019-09-08 02:42:19,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:19,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:19,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:19,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:19,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:42:19,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:19,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:20,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:43:43,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-08 02:43:43,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:43:44,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 02:43:44,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:43:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:44,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:43:44,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-08 02:43:44,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 02:43:44,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 02:43:44,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:43:44,502 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 31 states. [2019-09-08 02:43:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:43:45,549 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-09-08 02:43:45,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 02:43:45,549 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-08 02:43:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:43:45,551 INFO L225 Difference]: With dead ends: 73 [2019-09-08 02:43:45,551 INFO L226 Difference]: Without dead ends: 68 [2019-09-08 02:43:45,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:43:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-08 02:43:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-08 02:43:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-08 02:43:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-08 02:43:45,556 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-08 02:43:45,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:43:45,556 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-08 02:43:45,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 02:43:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-08 02:43:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 02:43:45,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:43:45,557 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:43:45,558 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:43:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:43:45,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1893991324, now seen corresponding path program 28 times [2019-09-08 02:43:45,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:43:45,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:43:45,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:45,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:43:45,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:43:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:46,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:43:46,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:43:46,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:43:46,152 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:43:46,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:43:46,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 02:43:46,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:43:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:46,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:43:46,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-08 02:43:46,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:43:46,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:43:46,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:43:46,223 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 32 states. [2019-09-08 02:43:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:43:47,350 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-09-08 02:43:47,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 02:43:47,350 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-08 02:43:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:43:47,351 INFO L225 Difference]: With dead ends: 75 [2019-09-08 02:43:47,351 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 02:43:47,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 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-08 02:43:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 02:43:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-08 02:43:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-08 02:43:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-08 02:43:47,356 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-08 02:43:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:43:47,357 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-08 02:43:47,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:43:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-08 02:43:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 02:43:47,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:43:47,358 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:43:47,358 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:43:47,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:43:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2015803169, now seen corresponding path program 29 times [2019-09-08 02:43:47,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:43:47,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:43:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:47,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:43:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:43:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:43:47,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:43:47,929 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-08 02:43:47,939 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:46:28,181 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-08 02:46:28,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:46:28,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 02:46:28,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:46:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:46:28,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:46:28,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-08 02:46:28,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 02:46:28,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 02:46:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:46:28,266 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 33 states. [2019-09-08 02:46:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:46:29,494 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-09-08 02:46:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 02:46:29,494 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2019-09-08 02:46:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:46:29,495 INFO L225 Difference]: With dead ends: 77 [2019-09-08 02:46:29,495 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 02:46:29,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:46:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 02:46:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-08 02:46:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-08 02:46:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-08 02:46:29,502 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-08 02:46:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:46:29,502 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-08 02:46:29,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 02:46:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-08 02:46:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 02:46:29,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:46:29,503 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:46:29,503 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:46:29,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:46:29,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1231926942, now seen corresponding path program 30 times [2019-09-08 02:46:29,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:46:29,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:46:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:46:29,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:46:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:46:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:46:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:46:30,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:46:30,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:46:30,098 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:48:39,490 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-08 02:48:39,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:39,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 02:48:39,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:39,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:39,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-08 02:48:39,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 02:48:39,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 02:48:39,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:48:39,579 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 34 states. [2019-09-08 02:48:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:40,887 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-09-08 02:48:40,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 02:48:40,887 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2019-09-08 02:48:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:40,888 INFO L225 Difference]: With dead ends: 79 [2019-09-08 02:48:40,889 INFO L226 Difference]: Without dead ends: 74 [2019-09-08 02:48:40,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:48:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-08 02:48:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-08 02:48:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-08 02:48:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-08 02:48:40,894 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-08 02:48:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:40,894 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-08 02:48:40,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 02:48:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-08 02:48:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 02:48:40,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:40,895 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:40,896 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:40,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:40,896 INFO L82 PathProgramCache]: Analyzing trace with hash -453850405, now seen corresponding path program 31 times [2019-09-08 02:48:40,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:40,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:40,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:40,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:40,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:41,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:41,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:48:41,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:48:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:41,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 02:48:41,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:41,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:41,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-08 02:48:41,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 02:48:41,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 02:48:41,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:48:41,651 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 35 states. [2019-09-08 02:48:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:43,047 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-09-08 02:48:43,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 02:48:43,047 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-09-08 02:48:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:43,048 INFO L225 Difference]: With dead ends: 81 [2019-09-08 02:48:43,048 INFO L226 Difference]: Without dead ends: 76 [2019-09-08 02:48:43,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 71 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-08 02:48:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-08 02:48:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-08 02:48:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 02:48:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-08 02:48:43,053 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-08 02:48:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:43,053 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-08 02:48:43,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 02:48:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-08 02:48:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 02:48:43,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:43,055 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:43,055 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:43,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1283210280, now seen corresponding path program 32 times [2019-09-08 02:48:43,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:43,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:43,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:48:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:43,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:43,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:48:43,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:48:43,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:48:43,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:48:43,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 02:48:43,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:48:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:43,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:48:43,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-08 02:48:43,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:48:43,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:48:43,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:48:43,804 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 36 states. [2019-09-08 02:48:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:48:45,268 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-09-08 02:48:45,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 02:48:45,269 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-08 02:48:45,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:48:45,270 INFO L225 Difference]: With dead ends: 83 [2019-09-08 02:48:45,270 INFO L226 Difference]: Without dead ends: 78 [2019-09-08 02:48:45,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 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-08 02:48:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-08 02:48:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-08 02:48:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-08 02:48:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-08 02:48:45,275 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-08 02:48:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:48:45,276 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-08 02:48:45,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:48:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-08 02:48:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 02:48:45,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:48:45,277 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:48:45,277 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:48:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:48:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash 565866901, now seen corresponding path program 33 times [2019-09-08 02:48:45,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:48:45,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:48:45,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:45,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:48:45,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:48:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:48:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:48:46,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:48:46,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:48:46,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:49:50,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-08 02:49:50,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:50,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-08 02:49:50,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:50,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:50,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-08 02:49:50,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 02:49:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 02:49:50,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:49:50,863 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 37 states. [2019-09-08 02:49:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:52,423 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-09-08 02:49:52,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 02:49:52,424 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-09-08 02:49:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:52,425 INFO L225 Difference]: With dead ends: 85 [2019-09-08 02:49:52,425 INFO L226 Difference]: Without dead ends: 80 [2019-09-08 02:49:52,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 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-08 02:49:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-08 02:49:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-08 02:49:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 02:49:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-08 02:49:52,430 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-08 02:49:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:52,430 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-08 02:49:52,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 02:49:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-08 02:49:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 02:49:52,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:52,431 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:52,432 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:52,432 INFO L82 PathProgramCache]: Analyzing trace with hash -587422702, now seen corresponding path program 34 times [2019-09-08 02:49:52,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:52,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:52,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:52,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:52,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:53,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:53,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:53,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:49:53,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:49:53,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:53,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 02:49:53,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:53,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:53,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-08 02:49:53,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 02:49:53,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 02:49:53,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:49:53,258 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 38 states. [2019-09-08 02:49:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:54,909 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-09-08 02:49:54,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:49:54,910 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 78 [2019-09-08 02:49:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:54,911 INFO L225 Difference]: With dead ends: 87 [2019-09-08 02:49:54,911 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 02:49:54,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:49:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 02:49:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-08 02:49:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-08 02:49:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-08 02:49:54,917 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-08 02:49:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:54,917 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-08 02:49:54,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 02:49:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-08 02:49:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 02:49:54,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:54,918 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:54,918 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:54,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:54,919 INFO L82 PathProgramCache]: Analyzing trace with hash -797168817, now seen corresponding path program 35 times [2019-09-08 02:49:54,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:54,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:54,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:54,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:55,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:55,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:55,730 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1