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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:13:28,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:13:28,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:13:28,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:13:28,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:13:28,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:13:28,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:13:28,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:13:28,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:13:28,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:13:28,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:13:28,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:13:28,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:13:28,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:13:28,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:13:28,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:13:28,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:13:28,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:13:28,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:13:28,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:13:28,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:13:28,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:13:28,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:13:28,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:13:28,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:13:28,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:13:28,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:13:28,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:13:28,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:13:28,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:13:28,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:13:28,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:13:28,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:13:28,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:13:28,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:13:28,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:13:28,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:13:28,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:13:28,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:13:28,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:13:28,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:13:28,717 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 13:13:28,732 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:13:28,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:13:28,732 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:13:28,733 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:13:28,733 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:13:28,734 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:13:28,734 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:13:28,734 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:13:28,734 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:13:28,734 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:13:28,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:13:28,735 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:13:28,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:13:28,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:13:28,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:13:28,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:13:28,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:13:28,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:13:28,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:13:28,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:13:28,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:13:28,737 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:13:28,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:13:28,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:13:28,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:13:28,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:13:28,739 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:13:28,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:13:28,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:13:28,739 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:13:28,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:13:28,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:13:28,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:13:28,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:13:28,784 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:13:28,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2019-09-05 13:13:28,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb204e97/5fb7a520c83e4d95bba2dbe44a499ea5/FLAG0b60d9a81 [2019-09-05 13:13:29,258 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:13:29,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2019-09-05 13:13:29,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb204e97/5fb7a520c83e4d95bba2dbe44a499ea5/FLAG0b60d9a81 [2019-09-05 13:13:29,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb204e97/5fb7a520c83e4d95bba2dbe44a499ea5 [2019-09-05 13:13:29,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:13:29,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:13:29,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:13:29,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:13:29,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:13:29,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:13:29" (1/1) ... [2019-09-05 13:13:29,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695cd166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29, skipping insertion in model container [2019-09-05 13:13:29,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:13:29" (1/1) ... [2019-09-05 13:13:29,719 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:13:29,738 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:13:29,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:13:29,945 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:13:29,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:13:29,977 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:13:29,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29 WrapperNode [2019-09-05 13:13:29,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:13:29,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:13:29,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:13:29,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:13:30,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29" (1/1) ... [2019-09-05 13:13:30,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29" (1/1) ... [2019-09-05 13:13:30,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29" (1/1) ... [2019-09-05 13:13:30,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29" (1/1) ... [2019-09-05 13:13:30,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29" (1/1) ... [2019-09-05 13:13:30,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29" (1/1) ... [2019-09-05 13:13:30,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29" (1/1) ... [2019-09-05 13:13:30,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:13:30,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:13:30,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:13:30,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:13:30,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:13:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:13:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:13:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:13:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:13:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:13:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:13:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:13:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:13:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:13:30,310 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:13:30,310 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 13:13:30,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:13:30 BoogieIcfgContainer [2019-09-05 13:13:30,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:13:30,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:13:30,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:13:30,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:13:30,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:13:29" (1/3) ... [2019-09-05 13:13:30,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6993916f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:13:30, skipping insertion in model container [2019-09-05 13:13:30,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:29" (2/3) ... [2019-09-05 13:13:30,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6993916f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:13:30, skipping insertion in model container [2019-09-05 13:13:30,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:13:30" (3/3) ... [2019-09-05 13:13:30,319 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono3_1.c [2019-09-05 13:13:30,328 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:13:30,335 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:13:30,355 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:13:30,378 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:13:30,378 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:13:30,378 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:13:30,379 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:13:30,379 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:13:30,379 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:13:30,379 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:13:30,379 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:13:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-05 13:13:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:13:30,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:30,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:30,403 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2019-09-05 13:13:30,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:30,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:30,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:30,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:30,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:30,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:13:30,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:13:30,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:30,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:13:30,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:13:30,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:13:30,542 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-05 13:13:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:30,557 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-05 13:13:30,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:13:30,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 13:13:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:30,566 INFO L225 Difference]: With dead ends: 19 [2019-09-05 13:13:30,566 INFO L226 Difference]: Without dead ends: 13 [2019-09-05 13:13:30,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:13:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-05 13:13:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-05 13:13:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 13:13:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-05 13:13:30,602 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-05 13:13:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:30,602 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-05 13:13:30,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:13:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-05 13:13:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:13:30,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:30,603 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:30,604 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-09-05 13:13:30,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:30,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:30,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:30,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:30,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:13:30,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:13:30,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:30,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:13:30,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:13:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:13:30,709 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-09-05 13:13:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:30,755 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-05 13:13:30,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:13:30,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 13:13:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:30,756 INFO L225 Difference]: With dead ends: 16 [2019-09-05 13:13:30,757 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 13:13:30,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:13:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 13:13:30,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-05 13:13:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 13:13:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-05 13:13:30,765 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2019-09-05 13:13:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:30,770 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-05 13:13:30,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:13:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-05 13:13:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 13:13:30,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:30,772 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:30,772 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1264308876, now seen corresponding path program 1 times [2019-09-05 13:13:30,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:30,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:30,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:30,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:30,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:30,885 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-05 13:13:30,887 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [20], [26], [29], [31], [37], [38], [39], [41] [2019-09-05 13:13:30,921 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:13:30,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:13:30,982 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:13:31,061 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:13:31,064 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 24 times. Widened at 1 different actions 4 times. Performed 105 root evaluator evaluations with a maximum evaluation depth of 6. Performed 105 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-05 13:13:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:31,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:13:31,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:31,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:31,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:31,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:13:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:31,117 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:13:31,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:31,183 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:31,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:31,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 8] total 13 [2019-09-05 13:13:31,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:31,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 13:13:31,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 13:13:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:13:31,343 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-05 13:13:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:31,404 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-05 13:13:31,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:13:31,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-05 13:13:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:31,406 INFO L225 Difference]: With dead ends: 19 [2019-09-05 13:13:31,406 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 13:13:31,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:13:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 13:13:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-09-05 13:13:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 13:13:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-05 13:13:31,411 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-05 13:13:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:31,412 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-05 13:13:31,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 13:13:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-05 13:13:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:13:31,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:31,413 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:31,413 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash 127284375, now seen corresponding path program 2 times [2019-09-05 13:13:31,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:31,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:31,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:31,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:31,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:31,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:31,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:31,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:31,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:31,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-05 13:13:31,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:13:31,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:13:31,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 13:13:31,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:31,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 13:13:31,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:31,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:31,678 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-05 13:13:31,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 9 [2019-09-05 13:13:31,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:31,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:13:31,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:13:31,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:13:31,680 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-09-05 13:13:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:34,028 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-05 13:13:34,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:13:34,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-05 13:13:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:34,039 INFO L225 Difference]: With dead ends: 23 [2019-09-05 13:13:34,040 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 13:13:34,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:13:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 13:13:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-09-05 13:13:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 13:13:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-05 13:13:34,048 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-09-05 13:13:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:34,049 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-05 13:13:34,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:13:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-05 13:13:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 13:13:34,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:34,050 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:34,050 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:34,051 INFO L82 PathProgramCache]: Analyzing trace with hash -462476010, now seen corresponding path program 1 times [2019-09-05 13:13:34,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:34,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:34,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:34,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:34,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:34,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-05 13:13:34,167 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [20], [26], [29], [31], [37], [38], [39], [41] [2019-09-05 13:13:34,172 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:13:34,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:13:34,175 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:13:34,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:13:34,242 INFO L272 AbstractInterpreter]: Visited 14 different actions 70 times. Merged at 5 different actions 26 times. Widened at 1 different actions 4 times. Performed 152 root evaluator evaluations with a maximum evaluation depth of 6. Performed 152 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-05 13:13:34,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:34,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:13:34,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:34,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:34,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:34,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:13:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:34,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 13:13:34,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:34,325 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:34,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:34,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2019-09-05 13:13:34,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:34,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:13:34,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:13:34,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:13:34,424 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2019-09-05 13:13:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:34,492 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-09-05 13:13:34,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:13:34,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-05 13:13:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:34,493 INFO L225 Difference]: With dead ends: 24 [2019-09-05 13:13:34,493 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 13:13:34,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:13:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 13:13:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-05 13:13:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 13:13:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-05 13:13:34,498 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2019-09-05 13:13:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:34,498 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-05 13:13:34,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:13:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-05 13:13:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 13:13:34,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:34,500 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:34,500 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:34,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:34,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1090129401, now seen corresponding path program 2 times [2019-09-05 13:13:34,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:34,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:34,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:34,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:34,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:34,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:34,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:34,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:34,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:34,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:13:34,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:13:34,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:34,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:13:34,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:34,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 13:13:34,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:13:34,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:13:34,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:34,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2019-09-05 13:13:34,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:34,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:13:34,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:13:34,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:13:34,816 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-09-05 13:13:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:36,603 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-09-05 13:13:36,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:13:36,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-05 13:13:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:36,605 INFO L225 Difference]: With dead ends: 38 [2019-09-05 13:13:36,605 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 13:13:36,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:13:36,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 13:13:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-09-05 13:13:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 13:13:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-05 13:13:36,610 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 22 [2019-09-05 13:13:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:36,611 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-05 13:13:36,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:13:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-05 13:13:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 13:13:36,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:36,612 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:36,612 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:36,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:36,613 INFO L82 PathProgramCache]: Analyzing trace with hash 383195540, now seen corresponding path program 3 times [2019-09-05 13:13:36,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:36,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:36,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:36,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:36,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:36,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:36,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:36,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:36,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:36,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:13:36,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:13:36,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:36,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:13:36,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:36,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:13:36,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:36,850 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:37,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:37,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-05 13:13:37,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:37,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:13:37,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:13:37,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:13:37,113 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2019-09-05 13:13:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:37,244 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-05 13:13:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:13:37,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-05 13:13:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:37,245 INFO L225 Difference]: With dead ends: 36 [2019-09-05 13:13:37,245 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 13:13:37,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:13:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 13:13:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-05 13:13:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 13:13:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-09-05 13:13:37,251 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2019-09-05 13:13:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:37,251 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-09-05 13:13:37,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:13:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-09-05 13:13:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 13:13:37,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:37,253 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:37,253 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:37,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:37,253 INFO L82 PathProgramCache]: Analyzing trace with hash 406896119, now seen corresponding path program 4 times [2019-09-05 13:13:37,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:37,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:37,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:37,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:37,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:37,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:37,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:37,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:37,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:37,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:37,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:13:37,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:37,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:37,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 13:13:37,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:37,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:37,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:37,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2019-09-05 13:13:37,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:37,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 13:13:37,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 13:13:37,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-09-05 13:13:37,756 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 10 states. [2019-09-05 13:13:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:37,926 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-05 13:13:37,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 13:13:37,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-09-05 13:13:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:37,929 INFO L225 Difference]: With dead ends: 39 [2019-09-05 13:13:37,930 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 13:13:37,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-09-05 13:13:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 13:13:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-05 13:13:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-05 13:13:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-09-05 13:13:37,934 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-09-05 13:13:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:37,935 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-09-05 13:13:37,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 13:13:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-09-05 13:13:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 13:13:37,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:37,936 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:37,936 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2096208564, now seen corresponding path program 5 times [2019-09-05 13:13:37,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:37,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:37,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:37,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:37,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:38,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:38,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:38,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:38,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:38,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:38,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-05 13:13:38,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:13:38,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:38,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 13:13:38,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:38,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 13:13:38,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:13:38,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:13:38,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:38,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 18 [2019-09-05 13:13:38,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:38,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 13:13:38,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 13:13:38,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-09-05 13:13:38,357 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2019-09-05 13:13:42,938 WARN L188 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-09-05 13:13:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:44,182 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-09-05 13:13:44,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 13:13:44,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-09-05 13:13:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:44,185 INFO L225 Difference]: With dead ends: 56 [2019-09-05 13:13:44,185 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 13:13:44,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=221, Invalid=379, Unknown=0, NotChecked=0, Total=600 [2019-09-05 13:13:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 13:13:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-09-05 13:13:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 13:13:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-09-05 13:13:44,192 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 37 [2019-09-05 13:13:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:44,192 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-09-05 13:13:44,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 13:13:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-09-05 13:13:44,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 13:13:44,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:44,194 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:44,194 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:44,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1039399097, now seen corresponding path program 6 times [2019-09-05 13:13:44,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:44,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:44,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 77 proven. 126 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:13:44,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:44,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:44,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:44,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:44,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:44,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:13:44,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:13:44,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:44,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:13:44,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:44,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 13:13:44,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 77 proven. 126 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:13:44,481 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 77 proven. 126 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:13:44,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:44,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2019-09-05 13:13:44,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:44,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 13:13:44,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 13:13:44,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2019-09-05 13:13:44,918 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 13 states. [2019-09-05 13:13:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:45,215 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-09-05 13:13:45,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:13:45,216 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2019-09-05 13:13:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:45,217 INFO L225 Difference]: With dead ends: 51 [2019-09-05 13:13:45,217 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 13:13:45,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2019-09-05 13:13:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 13:13:45,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-05 13:13:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 13:13:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-09-05 13:13:45,222 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 46 [2019-09-05 13:13:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:45,223 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-09-05 13:13:45,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 13:13:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-09-05 13:13:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 13:13:45,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:45,224 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:45,225 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:45,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:45,225 INFO L82 PathProgramCache]: Analyzing trace with hash -889806346, now seen corresponding path program 7 times [2019-09-05 13:13:45,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:45,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:45,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:45,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:45,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 85 proven. 155 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:13:45,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:45,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:45,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:45,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:45,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:45,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-05 13:13:45,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:45,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:13:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:45,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 13:13:45,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 85 proven. 155 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:13:45,534 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 85 proven. 155 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:13:46,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:46,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 26 [2019-09-05 13:13:46,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:46,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 13:13:46,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 13:13:46,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-05 13:13:46,059 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 14 states. [2019-09-05 13:13:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:46,345 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-09-05 13:13:46,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:13:46,346 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2019-09-05 13:13:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:46,347 INFO L225 Difference]: With dead ends: 54 [2019-09-05 13:13:46,347 INFO L226 Difference]: Without dead ends: 54 [2019-09-05 13:13:46,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-05 13:13:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-05 13:13:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-05 13:13:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-05 13:13:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-09-05 13:13:46,355 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 49 [2019-09-05 13:13:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:46,355 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-09-05 13:13:46,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 13:13:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-09-05 13:13:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 13:13:46,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:46,357 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:46,357 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:46,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1403196313, now seen corresponding path program 8 times [2019-09-05 13:13:46,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:46,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:46,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 93 proven. 187 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:13:46,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:46,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:46,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:46,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:46,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:46,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:46,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:13:46,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:13:46,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-05 13:13:46,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:46,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 13:13:46,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 117 proven. 15 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-05 13:13:46,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 117 proven. 15 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-05 13:13:46,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:46,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 24 [2019-09-05 13:13:46,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:46,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 13:13:46,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 13:13:46,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-05 13:13:46,943 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 19 states. [2019-09-05 13:13:47,624 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-05 13:13:51,253 WARN L188 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 13:13:55,299 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 13:13:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:57,832 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2019-09-05 13:13:57,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 13:13:57,833 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2019-09-05 13:13:57,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:57,834 INFO L225 Difference]: With dead ends: 74 [2019-09-05 13:13:57,834 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 13:13:57,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=397, Invalid=723, Unknown=2, NotChecked=0, Total=1122 [2019-09-05 13:13:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 13:13:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2019-09-05 13:13:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-05 13:13:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-09-05 13:13:57,840 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 52 [2019-09-05 13:13:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:57,840 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-09-05 13:13:57,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 13:13:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-09-05 13:13:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-05 13:13:57,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:57,842 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:57,842 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 120846324, now seen corresponding path program 9 times [2019-09-05 13:13:57,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:57,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:57,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:57,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 150 proven. 260 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:13:58,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:58,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:58,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:58,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:58,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:58,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:58,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:13:58,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:13:58,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:13:58,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:58,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 13:13:58,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 150 proven. 260 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:13:58,249 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 150 proven. 260 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:13:59,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:59,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 32 [2019-09-05 13:13:59,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:59,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 13:13:59,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 13:13:59,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-05 13:13:59,221 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 17 states. [2019-09-05 13:13:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:59,712 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-09-05 13:13:59,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 13:13:59,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-05 13:13:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:59,713 INFO L225 Difference]: With dead ends: 66 [2019-09-05 13:13:59,714 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 13:13:59,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-05 13:13:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 13:13:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-05 13:13:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 13:13:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-05 13:13:59,720 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 61 [2019-09-05 13:13:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:59,720 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-05 13:13:59,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 13:13:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-05 13:13:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 13:13:59,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:59,722 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:59,722 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1590948585, now seen corresponding path program 10 times [2019-09-05 13:13:59,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:59,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:59,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:59,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 301 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:13:59,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:59,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:59,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:59,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:59,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:59,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:59,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:59,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:14:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:00,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 13:14:00,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 301 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:00,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 301 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:01,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:01,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-05 13:14:01,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:01,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 13:14:01,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 13:14:01,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 13:14:01,074 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 18 states. [2019-09-05 13:14:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:01,610 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-05 13:14:01,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:14:01,611 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2019-09-05 13:14:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:01,612 INFO L225 Difference]: With dead ends: 69 [2019-09-05 13:14:01,612 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 13:14:01,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 13:14:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 13:14:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-05 13:14:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 13:14:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-05 13:14:01,618 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 64 [2019-09-05 13:14:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:01,618 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-05 13:14:01,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 13:14:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-05 13:14:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-05 13:14:01,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:01,620 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:01,620 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash 768590100, now seen corresponding path program 11 times [2019-09-05 13:14:01,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:01,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:01,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:01,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:01,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 172 proven. 345 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:01,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:01,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:01,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:01,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:01,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:01,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:01,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:01,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:14:01,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-05 13:14:01,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:01,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 13:14:01,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 205 proven. 26 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-05 13:14:02,081 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 205 proven. 26 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-05 13:14:02,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:02,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 30 [2019-09-05 13:14:02,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:02,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:14:02,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:14:02,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2019-09-05 13:14:02,292 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 24 states. [2019-09-05 13:14:07,019 WARN L188 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-05 13:14:07,628 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:14:14,623 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:14:17,080 WARN L188 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:14:26,529 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-05 13:14:31,595 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-05 13:14:55,480 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-05 13:14:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:55,841 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2019-09-05 13:14:55,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 13:14:55,842 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-09-05 13:14:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:55,843 INFO L225 Difference]: With dead ends: 110 [2019-09-05 13:14:55,843 INFO L226 Difference]: Without dead ends: 110 [2019-09-05 13:14:55,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=749, Invalid=1406, Unknown=7, NotChecked=0, Total=2162 [2019-09-05 13:14:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-05 13:14:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2019-09-05 13:14:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-05 13:14:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-05 13:14:55,851 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 67 [2019-09-05 13:14:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:55,852 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-05 13:14:55,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:14:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-05 13:14:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-05 13:14:55,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:55,854 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:55,854 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:55,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:55,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1916235353, now seen corresponding path program 12 times [2019-09-05 13:14:55,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:55,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:55,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:55,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:55,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 247 proven. 442 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-05 13:14:56,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:56,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:56,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:56,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:56,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:56,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:56,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:56,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:56,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:56,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:56,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 13:14:56,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 103 proven. 610 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:14:56,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 103 proven. 610 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:14:58,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:58,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 24] total 46 [2019-09-05 13:14:58,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:58,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:14:58,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:14:58,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=1478, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:14:58,159 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 24 states. [2019-09-05 13:14:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:59,109 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-09-05 13:14:59,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 13:14:59,110 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2019-09-05 13:14:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:59,110 INFO L225 Difference]: With dead ends: 90 [2019-09-05 13:14:59,111 INFO L226 Difference]: Without dead ends: 90 [2019-09-05 13:14:59,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=592, Invalid=1478, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:14:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-05 13:14:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-05 13:14:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-05 13:14:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2019-09-05 13:14:59,119 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 76 [2019-09-05 13:14:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:59,119 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2019-09-05 13:14:59,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:14:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2019-09-05 13:14:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-05 13:14:59,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:59,121 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 21, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:59,121 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:59,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash 70216729, now seen corresponding path program 13 times [2019-09-05 13:14:59,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:59,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:59,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 303 proven. 672 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-05 13:14:59,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:59,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:59,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:59,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:59,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:59,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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) [2019-09-05 13:14:59,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:59,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:59,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 13:14:59,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 303 proven. 672 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-05 13:14:59,726 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 303 proven. 669 refuted. 3 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-05 13:15:03,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:03,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 48 [2019-09-05 13:15:03,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:03,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 13:15:03,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 13:15:03,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=1610, Unknown=1, NotChecked=0, Total=2256 [2019-09-05 13:15:03,664 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 25 states. [2019-09-05 13:15:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:04,892 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-09-05 13:15:04,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 13:15:04,893 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2019-09-05 13:15:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:04,894 INFO L225 Difference]: With dead ends: 93 [2019-09-05 13:15:04,894 INFO L226 Difference]: Without dead ends: 93 [2019-09-05 13:15:04,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=645, Invalid=1610, Unknown=1, NotChecked=0, Total=2256 [2019-09-05 13:15:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-05 13:15:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-05 13:15:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-05 13:15:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2019-09-05 13:15:04,900 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 88 [2019-09-05 13:15:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:04,900 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2019-09-05 13:15:04,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 13:15:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2019-09-05 13:15:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-05 13:15:04,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:04,902 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 22, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:04,902 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:04,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:04,902 INFO L82 PathProgramCache]: Analyzing trace with hash 23476502, now seen corresponding path program 14 times [2019-09-05 13:15:04,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:04,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:04,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:15:04,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:04,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 317 proven. 737 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-05 13:15:05,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:05,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:05,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:05,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:05,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:05,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:15:05,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:15:05,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:15:05,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 13:15:05,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:15:05,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:15:05,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 368 proven. 40 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-05 13:15:05,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 368 proven. 40 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-05 13:15:05,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:05,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9, 9] total 39 [2019-09-05 13:15:05,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:05,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:15:05,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:15:05,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:15:05,971 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 32 states. [2019-09-05 13:15:09,841 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-05 13:15:15,209 WARN L188 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:15:18,940 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:15:35,713 WARN L188 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-05 13:15:48,869 WARN L188 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 14 [2019-09-05 13:15:55,583 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-05 13:16:03,822 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:16:11,109 WARN L188 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 22 DAG size of output: 14 [2019-09-05 13:16:22,496 WARN L188 SmtUtils]: Spent 8.41 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-05 13:16:32,434 WARN L188 SmtUtils]: Spent 7.14 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-05 13:16:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:32,435 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2019-09-05 13:16:32,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 13:16:32,435 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2019-09-05 13:16:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:32,436 INFO L225 Difference]: With dead ends: 120 [2019-09-05 13:16:32,436 INFO L226 Difference]: Without dead ends: 120 [2019-09-05 13:16:32,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 74.7s TimeCoverageRelationStatistics Valid=1048, Invalid=2025, Unknown=7, NotChecked=0, Total=3080 [2019-09-05 13:16:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-05 13:16:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2019-09-05 13:16:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-05 13:16:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-09-05 13:16:32,442 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 91 [2019-09-05 13:16:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:32,442 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-09-05 13:16:32,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:16:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-09-05 13:16:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-05 13:16:32,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:32,444 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 24, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:32,444 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:32,444 INFO L82 PathProgramCache]: Analyzing trace with hash -932954345, now seen corresponding path program 15 times [2019-09-05 13:16:32,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:32,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:16:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:32,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 419 proven. 876 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:16:33,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:33,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:16:33,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:16:33,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:33,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:33,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:33,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:16:33,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:16:33,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:16:33,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:16:33,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-05 13:16:33,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 419 proven. 876 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:16:33,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 419 proven. 876 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:16:36,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:16:36,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 28] total 54 [2019-09-05 13:16:36,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:36,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:16:36,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:16:36,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=2055, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 13:16:36,044 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 28 states. [2019-09-05 13:16:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:37,520 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-09-05 13:16:37,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 13:16:37,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 100 [2019-09-05 13:16:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:37,521 INFO L225 Difference]: With dead ends: 105 [2019-09-05 13:16:37,521 INFO L226 Difference]: Without dead ends: 105 [2019-09-05 13:16:37,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 172 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=807, Invalid=2055, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 13:16:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-05 13:16:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-05 13:16:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-05 13:16:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-09-05 13:16:37,526 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 100 [2019-09-05 13:16:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:37,526 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-09-05 13:16:37,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:16:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-09-05 13:16:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-05 13:16:37,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:37,528 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 25, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:37,528 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash -985237356, now seen corresponding path program 16 times [2019-09-05 13:16:37,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:37,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:37,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:16:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:37,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 436 proven. 950 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:16:38,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:38,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:16:38,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:16:38,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:38,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:38,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:38,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:38,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:16:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:38,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 13:16:38,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 436 proven. 950 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:16:38,215 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 436 proven. 950 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:16:40,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:16:40,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 56 [2019-09-05 13:16:40,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:40,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 13:16:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 13:16:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:16:40,639 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 29 states. [2019-09-05 13:16:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:42,172 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-09-05 13:16:42,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 13:16:42,173 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 103 [2019-09-05 13:16:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:42,174 INFO L225 Difference]: With dead ends: 108 [2019-09-05 13:16:42,174 INFO L226 Difference]: Without dead ends: 108 [2019-09-05 13:16:42,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 177 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:16:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-05 13:16:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-05 13:16:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-05 13:16:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-09-05 13:16:42,180 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 103 [2019-09-05 13:16:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:42,180 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-09-05 13:16:42,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 13:16:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-09-05 13:16:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-05 13:16:42,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:42,181 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 26, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:42,181 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:42,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:42,182 INFO L82 PathProgramCache]: Analyzing trace with hash 524710391, now seen corresponding path program 17 times [2019-09-05 13:16:42,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:42,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:42,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:42,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:42,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 453 proven. 1027 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:16:42,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:42,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:16:42,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:16:42,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:42,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:42,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:42,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:16:42,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:16:43,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-05 13:16:43,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:16:43,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 13:16:43,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 513 proven. 57 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-05 13:16:43,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 513 proven. 57 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-05 13:16:43,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:16:43,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10, 10] total 45 [2019-09-05 13:16:43,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:43,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 13:16:43,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 13:16:43,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=1406, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 13:16:43,973 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 37 states. [2019-09-05 13:16:56,507 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-09-05 13:17:01,460 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:17:02,263 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:17:07,307 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:17:17,732 WARN L188 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-05 13:17:36,160 WARN L188 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-05 13:18:03,508 WARN L188 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:18:05,382 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:18:13,562 WARN L188 SmtUtils]: Spent 7.32 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-05 13:18:20,046 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:18:28,120 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-05 13:18:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:28,121 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2019-09-05 13:18:28,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 13:18:28,122 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2019-09-05 13:18:28,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:28,123 INFO L225 Difference]: With dead ends: 139 [2019-09-05 13:18:28,123 INFO L226 Difference]: Without dead ends: 139 [2019-09-05 13:18:28,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 203 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 88.7s TimeCoverageRelationStatistics Valid=1456, Invalid=2827, Unknown=7, NotChecked=0, Total=4290 [2019-09-05 13:18:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-05 13:18:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2019-09-05 13:18:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-05 13:18:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-09-05 13:18:28,127 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 106 [2019-09-05 13:18:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:28,127 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-09-05 13:18:28,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 13:18:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-09-05 13:18:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-05 13:18:28,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:28,128 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 28, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:28,129 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash -362906410, now seen corresponding path program 18 times [2019-09-05 13:18:28,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:28,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:28,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:28,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:28,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 573 proven. 1190 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:18:28,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:28,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:18:28,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:28,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:28,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:28,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:28,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:18:28,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:18:28,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:18:28,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:18:28,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-05 13:18:28,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 573 proven. 1190 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:18:29,083 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 573 proven. 1190 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:18:31,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:18:31,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 32] total 62 [2019-09-05 13:18:31,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:31,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:18:31,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:18:31,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=2731, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 13:18:31,944 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 32 states. [2019-09-05 13:18:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:33,847 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-09-05 13:18:33,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 13:18:33,851 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 115 [2019-09-05 13:18:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:33,852 INFO L225 Difference]: With dead ends: 120 [2019-09-05 13:18:33,853 INFO L226 Difference]: Without dead ends: 120 [2019-09-05 13:18:33,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 198 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1051, Invalid=2731, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 13:18:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-05 13:18:33,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-05 13:18:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-05 13:18:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2019-09-05 13:18:33,857 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 115 [2019-09-05 13:18:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:33,858 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2019-09-05 13:18:33,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:18:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2019-09-05 13:18:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-05 13:18:33,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:33,859 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 29, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:33,859 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash -337872455, now seen corresponding path program 19 times [2019-09-05 13:18:33,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:33,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:33,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 593 proven. 1276 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:18:34,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:34,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:18:34,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:34,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:34,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:34,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:34,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:34,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:18:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:34,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 13:18:34,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 593 proven. 1276 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:18:34,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 593 proven. 1276 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:18:38,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:18:38,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 64 [2019-09-05 13:18:38,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:38,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 13:18:38,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 13:18:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=2915, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 13:18:38,299 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 33 states. [2019-09-05 13:18:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:40,373 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-09-05 13:18:40,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 13:18:40,374 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 118 [2019-09-05 13:18:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:40,375 INFO L225 Difference]: With dead ends: 123 [2019-09-05 13:18:40,375 INFO L226 Difference]: Without dead ends: 123 [2019-09-05 13:18:40,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 203 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1117, Invalid=2915, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 13:18:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-05 13:18:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-05 13:18:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-05 13:18:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2019-09-05 13:18:40,379 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 118 [2019-09-05 13:18:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:40,380 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2019-09-05 13:18:40,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 13:18:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2019-09-05 13:18:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-05 13:18:40,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:40,381 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 30, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:40,381 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:40,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:40,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1875628554, now seen corresponding path program 20 times [2019-09-05 13:18:40,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:40,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:40,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:40,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:40,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 613 proven. 1365 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:18:41,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:41,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:18:41,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:41,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:41,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:41,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:41,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:18:41,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:18:41,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-05 13:18:41,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:18:41,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 13:18:41,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 682 proven. 77 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-09-05 13:18:41,463 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 682 proven. 77 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-09-05 13:18:41,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:18:41,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11, 11] total 51 [2019-09-05 13:18:41,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:41,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 13:18:41,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 13:18:41,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=1826, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 13:18:41,984 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 42 states. [2019-09-05 13:18:46,309 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967295) 4294967296) 500000) (< (mod c_main_~x~0 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967290) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 500000)) is different from false [2019-09-05 13:18:48,907 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:18:51,015 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967295) 4294967296) 500000) (< (mod c_main_~x~0 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967290) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 500000)) is different from false [2019-09-05 13:18:53,062 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967295) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967290) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 500000)) is different from false [2019-09-05 13:18:56,724 WARN L188 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:19:03,131 WARN L188 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:19:06,493 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:19:38,747 WARN L188 SmtUtils]: Spent 24.08 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-09-05 13:19:43,576 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:19:47,443 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 13:19:55,606 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod c_main_~x~0 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967290) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 500000)) is different from false [2019-09-05 13:20:08,870 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:20:14,603 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 14 [2019-09-05 13:20:21,117 WARN L188 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-09-05 13:20:26,207 WARN L188 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:20:31,133 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-05 13:20:38,331 WARN L188 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:20:39,878 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-05 13:20:47,558 WARN L188 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:20:50,445 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-05 13:20:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:20:50,454 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2019-09-05 13:20:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-05 13:20:50,454 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2019-09-05 13:20:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:20:50,455 INFO L225 Difference]: With dead ends: 158 [2019-09-05 13:20:50,455 INFO L226 Difference]: Without dead ends: 158 [2019-09-05 13:20:50,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 111.7s TimeCoverageRelationStatistics Valid=1685, Invalid=3429, Unknown=14, NotChecked=572, Total=5700 [2019-09-05 13:20:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-05 13:20:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 128. [2019-09-05 13:20:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-05 13:20:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2019-09-05 13:20:50,459 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 121 [2019-09-05 13:20:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:20:50,460 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2019-09-05 13:20:50,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 13:20:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2019-09-05 13:20:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-05 13:20:50,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:20:50,461 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 31, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:20:50,461 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:20:50,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:20:50,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1873450452, now seen corresponding path program 21 times [2019-09-05 13:20:50,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:20:50,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:50,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:50,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:50,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:20:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:20:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 728 proven. 1457 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 13:20:51,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:20:51,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:20:51,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:20:51,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:20:51,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:20:51,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:20:51,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:20:51,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:20:51,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:20:51,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:20:51,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-05 13:20:51,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:20:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 728 proven. 1457 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 13:20:51,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:20:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 728 proven. 1457 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 13:20:56,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:20:56,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 35] total 68 [2019-09-05 13:20:56,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:20:56,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 13:20:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 13:20:56,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1255, Invalid=3301, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 13:20:56,171 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 35 states. [2019-09-05 13:20:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:20:58,561 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-09-05 13:20:58,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 13:20:58,561 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 127 [2019-09-05 13:20:58,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:20:58,562 INFO L225 Difference]: With dead ends: 132 [2019-09-05 13:20:58,562 INFO L226 Difference]: Without dead ends: 132 [2019-09-05 13:20:58,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 219 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1255, Invalid=3301, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 13:20:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-05 13:20:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-05 13:20:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-05 13:20:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2019-09-05 13:20:58,566 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 127 [2019-09-05 13:20:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:20:58,567 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2019-09-05 13:20:58,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 13:20:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2019-09-05 13:20:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-05 13:20:58,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:20:58,568 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 32, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:20:58,568 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:20:58,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:20:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1774365129, now seen corresponding path program 22 times [2019-09-05 13:20:58,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:20:58,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:58,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:58,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:20:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:20:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 751 proven. 1552 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 13:20:59,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:20:59,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:20:59,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:20:59,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:20:59,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:20:59,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:20:59,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:20:59,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:20:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:20:59,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-05 13:20:59,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:20:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 751 proven. 1552 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 13:20:59,641 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:21:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 751 proven. 1552 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:21:04,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:21:04,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 36] total 70 [2019-09-05 13:21:04,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:21:04,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 13:21:04,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 13:21:04,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=3503, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 13:21:04,150 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 36 states. [2019-09-05 13:21:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:21:06,589 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2019-09-05 13:21:06,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 13:21:06,590 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 130 [2019-09-05 13:21:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:21:06,591 INFO L225 Difference]: With dead ends: 135 [2019-09-05 13:21:06,591 INFO L226 Difference]: Without dead ends: 135 [2019-09-05 13:21:06,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1327, Invalid=3503, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 13:21:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-05 13:21:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-09-05 13:21:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-05 13:21:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2019-09-05 13:21:06,595 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 130 [2019-09-05 13:21:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:21:06,595 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2019-09-05 13:21:06,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 13:21:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2019-09-05 13:21:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-05 13:21:06,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:21:06,597 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 33, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:21:06,597 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:21:06,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:21:06,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1709151988, now seen corresponding path program 23 times [2019-09-05 13:21:06,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:21:06,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:21:06,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:21:06,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:21:06,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:21:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:21:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 774 proven. 1650 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 13:21:07,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:07,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:21:07,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:21:07,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:21:07,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:07,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:21:07,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:21:07,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:21:07,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-05 13:21:07,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:21:07,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 13:21:07,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:21:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 849 proven. 100 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-09-05 13:21:08,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:21:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 849 proven. 100 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-09-05 13:21:09,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:21:09,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12, 12] total 56 [2019-09-05 13:21:09,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:21:09,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 13:21:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 13:21:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=2212, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:21:09,021 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 46 states. [2019-09-05 13:21:32,605 WARN L188 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 42 DAG size of output: 10 [2019-09-05 13:21:45,075 WARN L188 SmtUtils]: Spent 4.96 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 13:22:06,063 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:22:28,777 WARN L188 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2019-09-05 13:22:44,888 WARN L188 SmtUtils]: Spent 6.84 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:23:28,861 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2019-09-05 13:24:10,587 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:24:15,484 WARN L188 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-05 13:24:19,815 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:24:31,230 WARN L188 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-05 13:24:38,694 WARN L188 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:24:48,219 WARN L188 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 30 DAG size of output: 14 [2019-09-05 13:25:03,058 WARN L188 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:25:21,548 WARN L188 SmtUtils]: Spent 7.14 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-09-05 13:25:34,484 WARN L188 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:25:51,329 WARN L188 SmtUtils]: Spent 6.99 s on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2019-09-05 13:25:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:25:51,330 INFO L93 Difference]: Finished difference Result 172 states and 190 transitions. [2019-09-05 13:25:51,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-05 13:25:51,330 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2019-09-05 13:25:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:25:51,332 INFO L225 Difference]: With dead ends: 172 [2019-09-05 13:25:51,332 INFO L226 Difference]: Without dead ends: 172 [2019-09-05 13:25:51,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 255 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 249.4s TimeCoverageRelationStatistics Valid=2265, Invalid=4516, Unknown=25, NotChecked=0, Total=6806 [2019-09-05 13:25:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-05 13:25:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 143. [2019-09-05 13:25:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-05 13:25:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2019-09-05 13:25:51,336 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 133 [2019-09-05 13:25:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:25:51,336 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2019-09-05 13:25:51,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 13:25:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2019-09-05 13:25:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-05 13:25:51,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:25:51,337 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 35, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:25:51,337 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:25:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:25:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 709301369, now seen corresponding path program 24 times [2019-09-05 13:25:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:25:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:25:51,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:25:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:25:51,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:25:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:25:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 927 proven. 1855 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:25:52,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:25:52,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:25:52,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:25:52,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:25:52,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:25:52,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:25:52,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:25:52,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:25:52,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:25:52,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:25:52,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-05 13:25:52,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:25:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 333 proven. 2542 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:25:52,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:25:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 333 proven. 2542 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:25:59,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:25:59,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 44, 45] total 88 [2019-09-05 13:25:59,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:25:59,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 13:25:59,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 13:25:59,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2059, Invalid=5597, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 13:25:59,758 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 45 states. [2019-09-05 13:26:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:26:03,171 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2019-09-05 13:26:03,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 13:26:03,172 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 142 [2019-09-05 13:26:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:26:03,173 INFO L225 Difference]: With dead ends: 165 [2019-09-05 13:26:03,173 INFO L226 Difference]: Without dead ends: 165 [2019-09-05 13:26:03,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 233 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2059, Invalid=5597, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 13:26:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-05 13:26:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-09-05 13:26:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-05 13:26:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2019-09-05 13:26:03,178 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 142 [2019-09-05 13:26:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:26:03,179 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2019-09-05 13:26:03,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 13:26:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2019-09-05 13:26:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-05 13:26:03,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:26:03,180 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 42, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:26:03,180 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:26:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:26:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1865808618, now seen corresponding path program 25 times [2019-09-05 13:26:03,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:26:03,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:03,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:26:03,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:03,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:26:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1109 proven. 2667 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:26:04,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:04,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:26:04,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:26:04,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:26:04,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:04,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:26:04,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:26:04,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:26:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:04,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-05 13:26:04,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:26:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1109 proven. 2667 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:26:04,531 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1109 proven. 2667 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:26:12,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:26:12,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 46] total 90 [2019-09-05 13:26:12,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:26:12,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 13:26:12,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 13:26:12,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2157, Invalid=5853, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 13:26:12,114 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 46 states. [2019-09-05 13:26:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:26:16,070 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2019-09-05 13:26:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 13:26:16,071 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 163 [2019-09-05 13:26:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:26:16,072 INFO L225 Difference]: With dead ends: 168 [2019-09-05 13:26:16,073 INFO L226 Difference]: Without dead ends: 168 [2019-09-05 13:26:16,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 280 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2157, Invalid=5853, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 13:26:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-05 13:26:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-05 13:26:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-05 13:26:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2019-09-05 13:26:16,077 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 163 [2019-09-05 13:26:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:26:16,078 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2019-09-05 13:26:16,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 13:26:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2019-09-05 13:26:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-05 13:26:16,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:26:16,079 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 43, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:26:16,079 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:26:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:26:16,080 INFO L82 PathProgramCache]: Analyzing trace with hash -823947271, now seen corresponding path program 26 times [2019-09-05 13:26:16,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:26:16,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:16,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:26:16,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:16,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:26:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1135 proven. 2795 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:26:17,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:17,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:26:17,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:26:17,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:26:17,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:17,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:26:17,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:26:17,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:26:17,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 13:26:17,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:26:17,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 13:26:17,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:26:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1237 proven. 126 refuted. 0 times theorem prover too weak. 2667 trivial. 0 not checked. [2019-09-05 13:26:17,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1237 proven. 126 refuted. 0 times theorem prover too weak. 2667 trivial. 0 not checked. [2019-09-05 13:26:18,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:26:18,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 13, 13] total 68 [2019-09-05 13:26:18,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:26:18,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 13:26:18,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 13:26:18,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1200, Invalid=3356, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 13:26:18,753 INFO L87 Difference]: Start difference. First operand 167 states and 176 transitions. Second operand 57 states. [2019-09-05 13:26:36,725 WARN L188 SmtUtils]: Spent 4.64 s on a formula simplification. DAG size of input: 46 DAG size of output: 10 [2019-09-05 13:26:39,480 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967295) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967290) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 500000)) is different from false [2019-09-05 13:26:41,668 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967295) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967290) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 500000)) is different from false [2019-09-05 13:27:00,191 WARN L188 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 13:27:27,674 WARN L188 SmtUtils]: Spent 8.90 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 13:27:34,709 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967288) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967290) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 500000)) is different from false [2019-09-05 13:27:45,482 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12