java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:49:01,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:49:01,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:49:01,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:49:01,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:49:01,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:49:01,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:49:01,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:49:01,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:49:01,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:49:01,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:49:01,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:49:01,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:49:01,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:49:01,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:49:01,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:49:01,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:49:01,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:49:01,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:49:01,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:49:01,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:49:01,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:49:01,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:49:01,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:49:01,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:49:01,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:49:01,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:49:01,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:49:01,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:49:01,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:49:01,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:49:01,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:49:01,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:49:01,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:49:01,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:49:01,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:49:01,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:49:01,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:49:01,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:49:01,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:49:01,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:49:01,442 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:49:01,456 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:49:01,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:49:01,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:49:01,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:49:01,458 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:49:01,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:49:01,458 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:49:01,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:49:01,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:49:01,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:49:01,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:49:01,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:49:01,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:49:01,460 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:49:01,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:49:01,460 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:49:01,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:49:01,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:49:01,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:49:01,461 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:49:01,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:49:01,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:49:01,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:49:01,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:49:01,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:49:01,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:49:01,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:49:01,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:49:01,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:49:01,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:49:01,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:49:01,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:49:01,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:49:01,513 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:49:01,514 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-2.c [2019-09-08 02:49:01,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b599ffda/694a544e306047af85c5483695978f52/FLAG639719c3d [2019-09-08 02:49:01,961 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:49:01,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-2.c [2019-09-08 02:49:01,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b599ffda/694a544e306047af85c5483695978f52/FLAG639719c3d [2019-09-08 02:49:02,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b599ffda/694a544e306047af85c5483695978f52 [2019-09-08 02:49:02,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:49:02,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:49:02,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:49:02,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:49:02,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:49:02,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:49:02" (1/1) ... [2019-09-08 02:49:02,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621c7695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02, skipping insertion in model container [2019-09-08 02:49:02,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:49:02" (1/1) ... [2019-09-08 02:49:02,370 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:49:02,382 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:49:02,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:49:02,542 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:49:02,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:49:02,572 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:49:02,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02 WrapperNode [2019-09-08 02:49:02,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:49:02,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:49:02,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:49:02,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:49:02,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02" (1/1) ... [2019-09-08 02:49:02,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02" (1/1) ... [2019-09-08 02:49:02,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02" (1/1) ... [2019-09-08 02:49:02,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02" (1/1) ... [2019-09-08 02:49:02,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02" (1/1) ... [2019-09-08 02:49:02,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02" (1/1) ... [2019-09-08 02:49:02,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02" (1/1) ... [2019-09-08 02:49:02,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:49:02,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:49:02,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:49:02,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:49:02,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02" (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:49:02,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:49:02,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:49:02,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:49:02,749 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:49:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:49:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:49:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:49:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:49:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:49:02,886 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:49:02,886 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 02:49:02,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:49:02 BoogieIcfgContainer [2019-09-08 02:49:02,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:49:02,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:49:02,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:49:02,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:49:02,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:49:02" (1/3) ... [2019-09-08 02:49:02,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1ac473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:49:02, skipping insertion in model container [2019-09-08 02:49:02,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:49:02" (2/3) ... [2019-09-08 02:49:02,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1ac473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:49:02, skipping insertion in model container [2019-09-08 02:49:02,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:49:02" (3/3) ... [2019-09-08 02:49:02,895 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_1-2.c [2019-09-08 02:49:02,903 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:49:02,909 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:49:02,925 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:49:02,954 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:49:02,955 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:49:02,955 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:49:02,955 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:49:02,956 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:49:02,956 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:49:02,956 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:49:02,956 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:49:02,956 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:49:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-08 02:49:02,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 02:49:02,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:02,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:02,980 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:02,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-08 02:49:02,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:02,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:03,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:03,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:49:03,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:03,202 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:49:03,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:49:03,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:49:03,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:49:03,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:49:03,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:49:03,274 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-08 02:49:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:03,309 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-08 02:49:03,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:49:03,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-08 02:49:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:03,320 INFO L225 Difference]: With dead ends: 29 [2019-09-08 02:49:03,320 INFO L226 Difference]: Without dead ends: 12 [2019-09-08 02:49:03,323 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:49:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-08 02:49:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-08 02:49:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-08 02:49:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-08 02:49:03,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-08 02:49:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:03,361 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-08 02:49:03,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:49:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-08 02:49:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-08 02:49:03,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:03,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:03,362 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-08 02:49:03,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:03,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:03,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:49:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:03,475 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:49:03,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:03,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:49:03,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:03,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 02:49:03,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:03,549 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:49:03,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:03,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 02:49:03,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:49:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:49:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:49:03,556 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-08 02:49:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:03,585 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-08 02:49:03,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:49:03,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-08 02:49:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:03,588 INFO L225 Difference]: With dead ends: 18 [2019-09-08 02:49:03,588 INFO L226 Difference]: Without dead ends: 13 [2019-09-08 02:49:03,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:49:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-08 02:49:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-08 02:49:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-08 02:49:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-08 02:49:03,594 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-08 02:49:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:03,594 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-08 02:49:03,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:49:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-08 02:49:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:49:03,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:03,596 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:03,596 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:03,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-08 02:49:03,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:03,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:03,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:49:03,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:03,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:03,702 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:49:03,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:49:03,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:49:03,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:03,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 02:49:03,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:03,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:03,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 02:49:03,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:49:03,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:49:03,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:49:03,769 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-08 02:49:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:03,797 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-08 02:49:03,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:49:03,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-08 02:49:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:03,798 INFO L225 Difference]: With dead ends: 19 [2019-09-08 02:49:03,798 INFO L226 Difference]: Without dead ends: 14 [2019-09-08 02:49:03,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:49:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-08 02:49:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-08 02:49:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-08 02:49:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-08 02:49:03,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-08 02:49:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:03,803 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-08 02:49:03,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:49:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-08 02:49:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 02:49:03,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:03,804 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:03,804 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:03,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:03,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-08 02:49:03,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:03,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:03,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:03,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:03,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:03,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:03,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:49:03,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:03,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 02:49:03,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:03,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 02:49:03,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:03,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:03,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 02:49:03,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:49:03,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:49:03,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:49:03,984 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-08 02:49:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:04,030 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-08 02:49:04,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:49:04,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-08 02:49:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:04,031 INFO L225 Difference]: With dead ends: 20 [2019-09-08 02:49:04,032 INFO L226 Difference]: Without dead ends: 15 [2019-09-08 02:49:04,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:49:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-08 02:49:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-08 02:49:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-08 02:49:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-08 02:49:04,040 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-08 02:49:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:04,041 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-08 02:49:04,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:49:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-08 02:49:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:49:04,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:04,043 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:04,043 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:04,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:04,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-08 02:49:04,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:04,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:04,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:04,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:04,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:04,195 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:49:04,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:04,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:49:04,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:04,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 02:49:04,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:04,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:04,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 02:49:04,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:49:04,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:49:04,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:49:04,276 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-08 02:49:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:04,328 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-08 02:49:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:49:04,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-08 02:49:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:04,329 INFO L225 Difference]: With dead ends: 21 [2019-09-08 02:49:04,329 INFO L226 Difference]: Without dead ends: 16 [2019-09-08 02:49:04,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:49:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-08 02:49:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-08 02:49:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-08 02:49:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-08 02:49:04,336 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-08 02:49:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:04,337 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-08 02:49:04,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:49:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-08 02:49:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:49:04,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:04,338 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:04,338 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:04,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-08 02:49:04,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:04,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:04,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:04,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:04,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:04,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:49:04,505 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:04,523 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-08 02:49:04,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:04,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 02:49:04,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:04,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:04,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-08 02:49:04,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:49:04,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:49:04,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:49:04,558 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-08 02:49:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:04,609 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-08 02:49:04,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:49:04,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-08 02:49:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:04,610 INFO L225 Difference]: With dead ends: 22 [2019-09-08 02:49:04,610 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 02:49:04,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 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:49:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 02:49:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 02:49:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 02:49:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-08 02:49:04,615 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-08 02:49:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:04,615 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-08 02:49:04,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:49:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-08 02:49:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:49:04,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:04,617 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:04,617 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:04,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-08 02:49:04,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:04,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:04,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:04,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:04,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:04,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:04,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:04,774 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:49:04,805 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-08 02:49:04,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:04,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 02:49:04,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:04,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:04,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 02:49:04,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:49:04,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:49:04,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:49:04,842 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-08 02:49:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:04,915 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-08 02:49:04,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:49:04,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-08 02:49:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:04,917 INFO L225 Difference]: With dead ends: 23 [2019-09-08 02:49:04,918 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 02:49:04,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:49:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 02:49:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-08 02:49:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 02:49:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-08 02:49:04,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-08 02:49:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:04,926 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-08 02:49:04,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:49:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-08 02:49:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:49:04,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:04,927 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:04,928 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:04,928 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-08 02:49:04,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:04,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:04,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:04,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:04,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:05,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:05,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:49:05,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:05,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 02:49:05,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:05,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:05,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 02:49:05,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:49:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:49:05,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:49:05,147 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-08 02:49:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:05,220 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-08 02:49:05,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:49:05,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-08 02:49:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:05,222 INFO L225 Difference]: With dead ends: 24 [2019-09-08 02:49:05,222 INFO L226 Difference]: Without dead ends: 19 [2019-09-08 02:49:05,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:49:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-08 02:49:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-08 02:49:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 02:49:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-08 02:49:05,227 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-08 02:49:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:05,227 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-08 02:49:05,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:49:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-08 02:49:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:49:05,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:05,228 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:05,229 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-08 02:49:05,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:05,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:05,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:05,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:49:05,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:05,375 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:49:05,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:05,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:05,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:49:05,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:49:05,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:05,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 02:49:05,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:05,445 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:49:05,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:05,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 02:49:05,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:49:05,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:49:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:49:05,451 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-08 02:49:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:05,553 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-08 02:49:05,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:49:05,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-08 02:49:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:05,557 INFO L225 Difference]: With dead ends: 25 [2019-09-08 02:49:05,557 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 02:49:05,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:49:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 02:49:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-08 02:49:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-08 02:49:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-08 02:49:05,563 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-08 02:49:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:05,563 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-08 02:49:05,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:49:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-08 02:49:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 02:49:05,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:05,564 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:05,564 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-08 02:49:05,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:05,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:05,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:05,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:05,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:05,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:05,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:05,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:49:18,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-08 02:49:18,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:18,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 02:49:18,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:18,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:18,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 02:49:18,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:49:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:49:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:49:18,410 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-08 02:49:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:18,510 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-08 02:49:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:49:18,510 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-08 02:49:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:18,511 INFO L225 Difference]: With dead ends: 26 [2019-09-08 02:49:18,511 INFO L226 Difference]: Without dead ends: 21 [2019-09-08 02:49:18,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:49:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-08 02:49:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-08 02:49:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 02:49:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-08 02:49:18,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-08 02:49:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:18,516 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-08 02:49:18,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:49:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-08 02:49:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:49:18,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:18,517 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:18,517 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:18,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:18,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-08 02:49:18,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:18,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:18,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:18,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:18,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:18,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:18,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:49:18,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:49:18,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:18,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 02:49:18,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:18,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:18,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 02:49:18,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:49:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:49:18,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:49:18,726 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-08 02:49:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:18,822 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-08 02:49:18,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:49:18,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-08 02:49:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:18,824 INFO L225 Difference]: With dead ends: 27 [2019-09-08 02:49:18,824 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 02:49:18,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:49:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 02:49:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-08 02:49:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 02:49:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-08 02:49:18,829 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-08 02:49:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:18,829 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-08 02:49:18,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:49:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-08 02:49:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:49:18,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:18,830 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:18,830 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-08 02:49:18,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:18,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:18,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:18,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:18,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:19,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:19,004 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:49:19,030 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:49:35,469 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-08 02:49:35,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:35,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 02:49:35,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:35,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:35,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-08 02:49:35,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:49:35,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:49:35,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:49:35,562 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-08 02:49:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:35,678 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-08 02:49:35,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:49:35,680 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-08 02:49:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:35,680 INFO L225 Difference]: With dead ends: 28 [2019-09-08 02:49:35,681 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 02:49:35,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:49:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 02:49:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-08 02:49:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 02:49:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-08 02:49:35,685 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-08 02:49:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:35,685 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-08 02:49:35,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:49:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-08 02:49:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 02:49:35,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:35,686 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:35,686 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-08 02:49:35,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:35,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:35,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:35,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:35,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:35,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:35,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:35,874 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:49:35,994 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 02:49:35,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:35,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 02:49:35,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:36,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:36,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-08 02:49:36,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:49:36,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:49:36,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:49:36,034 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-08 02:49:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:36,153 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-08 02:49:36,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:49:36,157 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-08 02:49:36,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:36,157 INFO L225 Difference]: With dead ends: 29 [2019-09-08 02:49:36,157 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 02:49:36,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 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:49:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 02:49:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-08 02:49:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 02:49:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-08 02:49:36,163 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-08 02:49:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:36,164 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-08 02:49:36,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:49:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-08 02:49:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 02:49:36,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:36,165 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:36,165 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:36,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:36,166 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-08 02:49:36,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:36,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:36,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:36,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:36,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:36,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:36,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:36,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:49:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:36,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 02:49:36,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:36,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:36,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-08 02:49:36,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 02:49:36,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 02:49:36,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:49:36,442 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-08 02:49:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:36,631 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-08 02:49:36,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 02:49:36,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-08 02:49:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:36,633 INFO L225 Difference]: With dead ends: 30 [2019-09-08 02:49:36,633 INFO L226 Difference]: Without dead ends: 25 [2019-09-08 02:49:36,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:49:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-08 02:49:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-08 02:49:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 02:49:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-08 02:49:36,638 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-08 02:49:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:36,638 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-08 02:49:36,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 02:49:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-08 02:49:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:49:36,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:36,639 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:36,640 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:36,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:36,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-08 02:49:36,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:36,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:36,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:49:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:37,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:37,048 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:49:37,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:37,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:49:37,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:37,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 02:49:37,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:37,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:37,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-08 02:49:37,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:49:37,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:49:37,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:49:37,147 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-08 02:49:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:37,321 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-08 02:49:37,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 02:49:37,321 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-08 02:49:37,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:37,322 INFO L225 Difference]: With dead ends: 31 [2019-09-08 02:49:37,322 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 02:49:37,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:49:37,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 02:49:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-08 02:49:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:49:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-08 02:49:37,327 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-08 02:49:37,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:37,327 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-08 02:49:37,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:49:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-08 02:49:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 02:49:37,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:37,328 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:37,328 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-08 02:49:37,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:37,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:37,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:37,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:37,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:37,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:37,554 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:49:37,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:49:51,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-08 02:49:51,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:51,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:49:51,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:51,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:51,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-08 02:49:51,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 02:49:51,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 02:49:51,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:49:51,442 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-08 02:49:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:51,664 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-08 02:49:51,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 02:49:51,665 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-08 02:49:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:51,666 INFO L225 Difference]: With dead ends: 32 [2019-09-08 02:49:51,666 INFO L226 Difference]: Without dead ends: 27 [2019-09-08 02:49:51,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:49:51,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-08 02:49:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-08 02:49:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 02:49:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-08 02:49:51,671 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-08 02:49:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:51,671 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-08 02:49:51,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 02:49:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-08 02:49:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 02:49:51,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:51,672 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:51,672 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:51,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:51,673 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-08 02:49:51,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:51,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:51,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:51,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:51,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:51,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:51,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:49:51,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:49:51,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:49:51,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:49:51,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 02:49:51,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:49:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:52,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:49:52,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-08 02:49:52,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:49:52,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:49:52,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:49:52,042 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-08 02:49:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:49:52,282 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-08 02:49:52,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:49:52,283 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-08 02:49:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:49:52,283 INFO L225 Difference]: With dead ends: 33 [2019-09-08 02:49:52,283 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 02:49:52,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:49:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 02:49:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-08 02:49:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 02:49:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-08 02:49:52,290 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-08 02:49:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:49:52,291 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-08 02:49:52,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:49:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-08 02:49:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 02:49:52,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:49:52,292 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:49:52,292 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:49:52,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:49:52,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-08 02:49:52,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:49:52,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:49:52,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:52,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:49:52,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:49:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:49:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:49:52,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:49:52,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:49:52,580 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:50:42,977 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-08 02:50:42,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:50:43,284 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 02:50:43,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:43,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:43,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-08 02:50:43,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:50:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:50:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:50:43,327 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-08 02:50:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:43,602 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-08 02:50:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:50:43,603 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-08 02:50:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:43,607 INFO L225 Difference]: With dead ends: 34 [2019-09-08 02:50:43,608 INFO L226 Difference]: Without dead ends: 29 [2019-09-08 02:50:43,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:50:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-08 02:50:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-08 02:50:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 02:50:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-08 02:50:43,612 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-08 02:50:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:43,612 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-08 02:50:43,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:50:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-08 02:50:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 02:50:43,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:43,613 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:43,613 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-08 02:50:43,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:43,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:43,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:43,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:50:43,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:43,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:43,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:50:43,973 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:50:44,149 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-08 02:50:44,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:50:44,151 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 02:50:44,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:44,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:44,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-08 02:50:44,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 02:50:44,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 02:50:44,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:50:44,206 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-08 02:50:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:44,472 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-08 02:50:44,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:50:44,472 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-08 02:50:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:44,473 INFO L225 Difference]: With dead ends: 35 [2019-09-08 02:50:44,474 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 02:50:44,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 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:50:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 02:50:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-08 02:50:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 02:50:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-08 02:50:44,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-08 02:50:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:44,487 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-08 02:50:44,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 02:50:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-08 02:50:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 02:50:44,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:44,487 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:44,488 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:44,488 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-08 02:50:44,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:44,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:44,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:50:44,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:44,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:44,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 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:50:44,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:50:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:44,845 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:50:44,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:44,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:44,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-08 02:50:44,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 02:50:44,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 02:50:44,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:50:44,890 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-08 02:50:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:45,221 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-08 02:50:45,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 02:50:45,222 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-08 02:50:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:45,223 INFO L225 Difference]: With dead ends: 36 [2019-09-08 02:50:45,223 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 02:50:45,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 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:50:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 02:50:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-08 02:50:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 02:50:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-08 02:50:45,229 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-08 02:50:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:45,229 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-08 02:50:45,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 02:50:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-08 02:50:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 02:50:45,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:45,230 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:45,230 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:45,231 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-08 02:50:45,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:45,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:50:45,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:45,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:45,548 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:50:45,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:50:45,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:50:45,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:50:45,596 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:50:45,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:45,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:45,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-08 02:50:45,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:50:45,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:50:45,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:50:45,642 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-08 02:50:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:45,946 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-08 02:50:45,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 02:50:45,951 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-08 02:50:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:45,952 INFO L225 Difference]: With dead ends: 37 [2019-09-08 02:50:45,952 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:50:45,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:50:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:50:45,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-08 02:50:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 02:50:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-08 02:50:45,958 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-08 02:50:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:45,960 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-08 02:50:45,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:50:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-08 02:50:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 02:50:45,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:45,961 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:45,962 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:45,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-08 02:50:45,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:45,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:45,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:45,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:50:45,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:46,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:46,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 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:50:46,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:50:53,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-08 02:50:53,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:50:53,106 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 02:50:53,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:53,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:53,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-08 02:50:53,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:50:53,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:50:53,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:50:53,222 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-08 02:50:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:53,540 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-08 02:50:53,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 02:50:53,546 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-08 02:50:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:53,547 INFO L225 Difference]: With dead ends: 38 [2019-09-08 02:50:53,547 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 02:50:53,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:50:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 02:50:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-08 02:50:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:50:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-08 02:50:53,551 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-08 02:50:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:53,551 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-08 02:50:53,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:50:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-08 02:50:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 02:50:53,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:53,552 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:53,553 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-08 02:50:53,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:53,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:53,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:50:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:53,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:53,955 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:50:53,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:50:53,991 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:50:53,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:50:53,992 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 02:50:53,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:50:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:54,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:50:54,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-08 02:50:54,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:50:54,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:50:54,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:50:54,037 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-08 02:50:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:50:54,401 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-08 02:50:54,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:50:54,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-08 02:50:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:50:54,402 INFO L225 Difference]: With dead ends: 39 [2019-09-08 02:50:54,402 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 02:50:54,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:50:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 02:50:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-08 02:50:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-08 02:50:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-08 02:50:54,408 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-08 02:50:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:50:54,408 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-08 02:50:54,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:50:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-08 02:50:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 02:50:54,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:50:54,409 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:50:54,410 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:50:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:50:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-08 02:50:54,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:50:54,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:50:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:54,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:50:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:50:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:50:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:50:54,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:50:54,976 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:50:54,994 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:52:43,324 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-08 02:52:43,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:52:43,380 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 02:52:43,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:52:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:43,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:52:43,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-08 02:52:43,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:52:43,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:52:43,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:52:43,427 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-08 02:52:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:43,837 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-08 02:52:43,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:52:43,838 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-08 02:52:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:43,839 INFO L225 Difference]: With dead ends: 40 [2019-09-08 02:52:43,839 INFO L226 Difference]: Without dead ends: 35 [2019-09-08 02:52:43,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:52:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-08 02:52:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-08 02:52:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 02:52:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-08 02:52:43,843 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-08 02:52:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:43,844 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-08 02:52:43,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:52:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-08 02:52:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 02:52:43,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:43,844 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:43,845 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:43,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-08 02:52:43,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:43,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:43,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:43,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:52:43,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:44,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:52:44,297 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:52:44,316 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:52:47,866 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 02:52:47,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:52:47,872 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 02:52:47,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:52:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:47,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:52:47,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-08 02:52:47,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:52:47,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:52:47,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:52:47,917 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-08 02:52:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:48,344 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-08 02:52:48,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:52:48,345 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-08 02:52:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:48,345 INFO L225 Difference]: With dead ends: 41 [2019-09-08 02:52:48,345 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 02:52:48,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:52:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 02:52:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-08 02:52:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-08 02:52:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-08 02:52:48,349 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-08 02:52:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:48,349 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-08 02:52:48,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:52:48,349 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-08 02:52:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-08 02:52:48,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:48,350 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:48,350 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-08 02:52:48,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:48,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:48,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:52:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:48,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:52:48,788 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:52:48,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:48,815 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 02:52:48,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:52:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:48,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:52:48,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-08 02:52:48,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:52:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:52:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:52:48,859 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-08 02:52:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:49,341 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-08 02:52:49,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 02:52:49,343 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-08 02:52:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:49,343 INFO L225 Difference]: With dead ends: 42 [2019-09-08 02:52:49,343 INFO L226 Difference]: Without dead ends: 37 [2019-09-08 02:52:49,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:52:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-08 02:52:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-08 02:52:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 02:52:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-08 02:52:49,347 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-08 02:52:49,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:49,348 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-08 02:52:49,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:52:49,348 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-08 02:52:49,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:52:49,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:49,349 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:49,349 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:49,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:49,349 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-08 02:52:49,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:49,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:49,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:49,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:49,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:49,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:52:49,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 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:52:49,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:52:49,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:52:49,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:52:49,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 02:52:49,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:52:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:49,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:52:49,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-08 02:52:49,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 02:52:49,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 02:52:49,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:52:49,901 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-08 02:52:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:50,412 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-08 02:52:50,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:52:50,412 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-08 02:52:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:50,413 INFO L225 Difference]: With dead ends: 43 [2019-09-08 02:52:50,413 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 02:52:50,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:52:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 02:52:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-08 02:52:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-08 02:52:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-08 02:52:50,417 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-08 02:52:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:50,417 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-08 02:52:50,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 02:52:50,418 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-08 02:52:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 02:52:50,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:50,418 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:50,418 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:50,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-08 02:52:50,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:50,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:50,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:52:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:50,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:52:50,916 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:52:50,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:55:22,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-08 02:55:22,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:23,166 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 02:55:23,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:23,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:23,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-08 02:55:23,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 02:55:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 02:55:23,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:55:23,222 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-08 02:55:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:23,760 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-08 02:55:23,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 02:55:23,761 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-08 02:55:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:23,762 INFO L225 Difference]: With dead ends: 44 [2019-09-08 02:55:23,762 INFO L226 Difference]: Without dead ends: 39 [2019-09-08 02:55:23,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:55:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-08 02:55:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-08 02:55:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 02:55:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-08 02:55:23,767 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-08 02:55:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:23,767 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-08 02:55:23,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 02:55:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-08 02:55:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 02:55:23,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:23,768 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:23,768 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-08 02:55:23,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:23,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:23,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:23,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:23,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:24,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:24,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:55:24,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:55:24,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:55:24,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:24,293 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 02:55:24,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:24,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:24,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-08 02:55:24,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:55:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:55:24,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:55:24,339 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-08 02:55:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:24,925 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-08 02:55:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 02:55:24,926 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-08 02:55:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:24,927 INFO L225 Difference]: With dead ends: 45 [2019-09-08 02:55:24,927 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 02:55:24,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:55:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 02:55:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-08 02:55:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-08 02:55:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-08 02:55:24,932 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-08 02:55:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:24,932 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-08 02:55:24,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:55:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-08 02:55:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 02:55:24,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:24,933 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:24,933 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-08 02:55:24,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:24,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:24,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:24,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:24,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:25,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:25,656 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:55:25,665 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:58:25,958 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-08 02:58:25,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:29,017 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 02:58:29,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:58:29,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:29,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-08 02:58:29,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 02:58:29,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 02:58:29,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:58:29,086 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-08 02:58:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:29,714 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-08 02:58:29,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 02:58:29,714 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-08 02:58:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:29,715 INFO L225 Difference]: With dead ends: 46 [2019-09-08 02:58:29,715 INFO L226 Difference]: Without dead ends: 41 [2019-09-08 02:58:29,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:58:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-08 02:58:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-08 02:58:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 02:58:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-08 02:58:29,721 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-08 02:58:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:29,721 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-08 02:58:29,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 02:58:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-08 02:58:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 02:58:29,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:29,723 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:29,723 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-08 02:58:29,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:29,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:29,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:29,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:29,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:58:30,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:30,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 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:58:30,346 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:00:24,494 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-08 03:00:24,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:28,762 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 03:00:28,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:28,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:28,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-08 03:00:28,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 03:00:28,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 03:00:28,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 03:00:28,815 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-08 03:00:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:29,480 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-08 03:00:29,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 03:00:29,481 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-08 03:00:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:29,482 INFO L225 Difference]: With dead ends: 47 [2019-09-08 03:00:29,482 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 03:00:29,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 03:00:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 03:00:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-08 03:00:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 03:00:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-08 03:00:29,486 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-08 03:00:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:29,487 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-08 03:00:29,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 03:00:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-08 03:00:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 03:00:29,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:29,487 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:29,488 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-08 03:00:29,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:29,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:29,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:29,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:29,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:30,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:30,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:00:30,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:00:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:30,158 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 03:00:30,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:30,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:30,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-08 03:00:30,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 03:00:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 03:00:30,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:00:30,216 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-08 03:00:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:30,904 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-08 03:00:30,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 03:00:30,909 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-08 03:00:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:30,910 INFO L225 Difference]: With dead ends: 48 [2019-09-08 03:00:30,910 INFO L226 Difference]: Without dead ends: 43 [2019-09-08 03:00:30,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:00:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-08 03:00:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-08 03:00:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 03:00:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-08 03:00:30,914 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-08 03:00:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:30,914 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-08 03:00:30,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 03:00:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-08 03:00:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 03:00:30,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:30,915 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:30,915 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-08 03:00:30,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:30,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:30,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:30,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:00:30,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:31,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:31,596 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 03:00:31,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:00:31,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:00:31,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:31,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 03:00:31,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:31,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:31,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-08 03:00:31,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 03:00:31,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 03:00:31,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 03:00:31,685 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-08 03:00:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:32,424 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-08 03:00:32,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 03:00:32,425 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-08 03:00:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:32,426 INFO L225 Difference]: With dead ends: 49 [2019-09-08 03:00:32,426 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 03:00:32,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 03:00:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 03:00:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-08 03:00:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 03:00:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-08 03:00:32,430 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-08 03:00:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:32,431 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-08 03:00:32,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 03:00:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-08 03:00:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 03:00:32,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:32,432 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:32,432 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:32,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:32,432 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-08 03:00:32,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:32,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:32,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:32,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:32,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:00:33,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:33,440 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 03:00:33,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:02:16,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-08 03:02:16,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:02:17,826 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-08 03:02:17,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:02:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:02:17,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:02:17,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-08 03:02:17,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 03:02:17,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 03:02:17,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:02:17,888 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-08 03:02:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:18,676 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-08 03:02:18,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 03:02:18,676 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-08 03:02:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:18,677 INFO L225 Difference]: With dead ends: 50 [2019-09-08 03:02:18,678 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 03:02:18,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:02:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 03:02:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-08 03:02:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 03:02:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-08 03:02:18,683 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-08 03:02:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:18,683 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-08 03:02:18,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 03:02:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-08 03:02:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 03:02:18,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:18,684 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:18,684 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:18,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:18,684 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-08 03:02:18,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:18,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:18,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:18,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:02:18,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:02:19,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:02:19,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:02:19,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:02:19,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:02:19,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:02:19,448 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 03:02:19,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:02:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:02:19,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:02:19,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-08 03:02:19,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 03:02:19,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 03:02:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:02:19,498 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-08 03:02:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:20,308 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-08 03:02:20,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 03:02:20,308 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-08 03:02:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:20,309 INFO L225 Difference]: With dead ends: 51 [2019-09-08 03:02:20,310 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 03:02:20,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:02:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 03:02:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-08 03:02:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 03:02:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-08 03:02:20,314 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-08 03:02:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:20,314 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-08 03:02:20,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 03:02:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-08 03:02:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 03:02:20,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:20,315 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:20,315 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:20,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:20,316 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-08 03:02:20,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:20,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:20,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:20,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:02:20,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:02:21,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:02:21,236 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 03:02:21,254 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1