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-c6af20d [2019-09-03 21:04:18,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 21:04:18,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 21:04:18,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 21:04:18,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 21:04:18,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 21:04:18,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 21:04:18,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 21:04:18,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 21:04:18,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 21:04:18,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 21:04:18,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 21:04:18,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 21:04:18,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 21:04:18,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 21:04:18,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 21:04:18,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 21:04:18,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 21:04:18,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 21:04:18,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 21:04:18,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 21:04:18,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 21:04:18,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 21:04:18,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 21:04:18,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 21:04:18,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 21:04:18,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 21:04:18,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 21:04:18,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 21:04:18,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 21:04:18,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 21:04:18,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 21:04:18,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 21:04:18,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 21:04:18,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 21:04:18,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 21:04:18,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 21:04:18,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 21:04:18,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 21:04:18,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 21:04:18,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 21:04:18,923 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-03 21:04:18,937 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 21:04:18,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 21:04:18,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 21:04:18,938 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 21:04:18,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 21:04:18,938 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 21:04:18,939 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 21:04:18,939 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 21:04:18,939 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 21:04:18,939 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 21:04:18,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 21:04:18,940 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 21:04:18,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 21:04:18,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 21:04:18,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 21:04:18,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 21:04:18,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 21:04:18,941 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 21:04:18,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 21:04:18,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 21:04:18,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 21:04:18,942 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 21:04:18,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 21:04:18,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:04:18,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 21:04:18,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 21:04:18,943 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 21:04:18,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 21:04:18,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 21:04:18,944 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 21:04:18,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 21:04:18,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 21:04:18,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 21:04:18,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 21:04:18,988 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 21:04:18,989 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-03 21:04:19,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9051fbb60/137635e0fad5493da6f9b550c4405bf1/FLAG48f64f98a [2019-09-03 21:04:19,463 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 21:04:19,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2019-09-03 21:04:19,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9051fbb60/137635e0fad5493da6f9b550c4405bf1/FLAG48f64f98a [2019-09-03 21:04:19,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9051fbb60/137635e0fad5493da6f9b550c4405bf1 [2019-09-03 21:04:19,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 21:04:19,889 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 21:04:19,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 21:04:19,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 21:04:19,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 21:04:19,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:04:19" (1/1) ... [2019-09-03 21:04:19,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635b5632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:19, skipping insertion in model container [2019-09-03 21:04:19,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:04:19" (1/1) ... [2019-09-03 21:04:19,907 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 21:04:19,922 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 21:04:20,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:04:20,085 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 21:04:20,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:04:20,116 INFO L192 MainTranslator]: Completed translation [2019-09-03 21:04:20,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:20 WrapperNode [2019-09-03 21:04:20,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 21:04:20,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 21:04:20,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 21:04:20,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 21:04:20,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:20" (1/1) ... [2019-09-03 21:04:20,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:20" (1/1) ... [2019-09-03 21:04:20,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:20" (1/1) ... [2019-09-03 21:04:20,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:20" (1/1) ... [2019-09-03 21:04:20,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:20" (1/1) ... [2019-09-03 21:04:20,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:20" (1/1) ... [2019-09-03 21:04:20,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:20" (1/1) ... [2019-09-03 21:04:20,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 21:04:20,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 21:04:20,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 21:04:20,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 21:04:20,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:20" (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-03 21:04:20,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 21:04:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 21:04:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 21:04:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 21:04:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 21:04:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 21:04:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 21:04:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 21:04:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 21:04:20,449 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 21:04:20,449 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 21:04:20,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:04:20 BoogieIcfgContainer [2019-09-03 21:04:20,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 21:04:20,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 21:04:20,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 21:04:20,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 21:04:20,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 09:04:19" (1/3) ... [2019-09-03 21:04:20,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6588f42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:04:20, skipping insertion in model container [2019-09-03 21:04:20,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:20" (2/3) ... [2019-09-03 21:04:20,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6588f42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:04:20, skipping insertion in model container [2019-09-03 21:04:20,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:04:20" (3/3) ... [2019-09-03 21:04:20,458 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono3_1.c [2019-09-03 21:04:20,468 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 21:04:20,474 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 21:04:20,489 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 21:04:20,515 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 21:04:20,515 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 21:04:20,515 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 21:04:20,515 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 21:04:20,516 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 21:04:20,516 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 21:04:20,516 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 21:04:20,516 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 21:04:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 21:04:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:04:20,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:20,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:20,541 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:20,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2019-09-03 21:04:20,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:20,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:20,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:20,639 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-03 21:04:20,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:20,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 21:04:20,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:20,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 21:04:20,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 21:04:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:04:20,661 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 21:04:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:20,674 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 21:04:20,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 21:04:20,675 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 21:04:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:20,684 INFO L225 Difference]: With dead ends: 19 [2019-09-03 21:04:20,684 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 21:04:20,686 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-03 21:04:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 21:04:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 21:04:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 21:04:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-03 21:04:20,721 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-03 21:04:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:20,722 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-03 21:04:20,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 21:04:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-03 21:04:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:04:20,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:20,723 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:20,723 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:20,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-09-03 21:04:20,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:20,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:20,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:20,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:20,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:20,852 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-03 21:04:20,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:20,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 21:04:20,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:20,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:04:20,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:04:20,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:20,856 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-09-03 21:04:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:20,889 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-03 21:04:20,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:04:20,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 21:04:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:20,892 INFO L225 Difference]: With dead ends: 16 [2019-09-03 21:04:20,895 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 21:04:20,896 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-03 21:04:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 21:04:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-03 21:04:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 21:04:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-03 21:04:20,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2019-09-03 21:04:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:20,904 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-03 21:04:20,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:04:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-03 21:04:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 21:04:20,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:20,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:20,908 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:20,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:20,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1264308876, now seen corresponding path program 1 times [2019-09-03 21:04:20,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:20,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:20,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:20,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:20,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:21,009 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-03 21:04:21,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:21,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:21,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-03 21:04:21,012 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [20], [26], [29], [31], [37], [38], [39], [41] [2019-09-03 21:04:21,046 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:04:21,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:04:21,103 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 21:04:21,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:04:21,183 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-03 21:04:21,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:21,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:04:21,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:21,189 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-03 21:04:21,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:21,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:21,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 21:04:21,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:21,292 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-03 21:04:21,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:21,437 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-03 21:04:21,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:21,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 8] total 13 [2019-09-03 21:04:21,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:21,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 21:04:21,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 21:04:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:04:21,444 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-03 21:04:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:21,517 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 21:04:21,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:04:21,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 21:04:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:21,520 INFO L225 Difference]: With dead ends: 19 [2019-09-03 21:04:21,520 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 21:04:21,521 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-03 21:04:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 21:04:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-09-03 21:04:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 21:04:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-03 21:04:21,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-03 21:04:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:21,529 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-03 21:04:21,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 21:04:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-03 21:04:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 21:04:21,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:21,531 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:21,531 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:21,532 INFO L82 PathProgramCache]: Analyzing trace with hash 127284375, now seen corresponding path program 2 times [2019-09-03 21:04:21,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:21,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:21,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:21,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:21,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:21,645 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-03 21:04:21,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:21,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:21,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:21,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:21,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:21,646 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-03 21:04:21,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:21,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:21,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 21:04:21,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:21,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 21:04:21,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:21,714 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-03 21:04:21,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:21,759 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-03 21:04:21,763 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-03 21:04:21,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 9 [2019-09-03 21:04:21,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:21,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 21:04:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 21:04:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:04:21,765 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-09-03 21:04:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:24,255 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-03 21:04:24,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:04:24,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 21:04:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:24,261 INFO L225 Difference]: With dead ends: 23 [2019-09-03 21:04:24,261 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 21:04:24,261 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-03 21:04:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 21:04:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-09-03 21:04:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 21:04:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-03 21:04:24,265 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-09-03 21:04:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:24,266 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-03 21:04:24,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 21:04:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-03 21:04:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 21:04:24,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:24,267 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:24,267 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:24,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:24,268 INFO L82 PathProgramCache]: Analyzing trace with hash -462476010, now seen corresponding path program 1 times [2019-09-03 21:04:24,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:24,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:24,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:24,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:24,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:24,383 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-03 21:04:24,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:24,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:24,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-03 21:04:24,384 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [20], [26], [29], [31], [37], [38], [39], [41] [2019-09-03 21:04:24,387 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:04:24,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:04:24,390 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 21:04:24,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:04:24,438 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-03 21:04:24,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:24,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:04:24,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:24,439 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-03 21:04:24,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:24,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:24,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 21:04:24,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:24,500 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-03 21:04:24,501 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:24,572 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-03 21:04:24,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:24,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2019-09-03 21:04:24,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:24,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 21:04:24,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 21:04:24,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-03 21:04:24,577 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2019-09-03 21:04:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:24,635 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-09-03 21:04:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:04:24,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-03 21:04:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:24,636 INFO L225 Difference]: With dead ends: 24 [2019-09-03 21:04:24,636 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 21:04:24,637 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-03 21:04:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 21:04:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 21:04:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 21:04:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-03 21:04:24,640 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2019-09-03 21:04:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:24,641 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-03 21:04:24,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 21:04:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-03 21:04:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 21:04:24,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:24,642 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:24,642 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:24,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1090129401, now seen corresponding path program 2 times [2019-09-03 21:04:24,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:24,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:24,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:24,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:24,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:24,752 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-03 21:04:24,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:24,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:24,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:24,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:24,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:24,753 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:24,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:24,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:24,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 21:04:24,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:24,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 21:04:24,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:24,829 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-03 21:04:24,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:24,886 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-03 21:04:24,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:24,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2019-09-03 21:04:24,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:24,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 21:04:24,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 21:04:24,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-03 21:04:24,891 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-09-03 21:04:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:26,733 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-09-03 21:04:26,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 21:04:26,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-03 21:04:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:26,735 INFO L225 Difference]: With dead ends: 38 [2019-09-03 21:04:26,735 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 21:04:26,735 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-03 21:04:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 21:04:26,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-09-03 21:04:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 21:04:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-03 21:04:26,740 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 22 [2019-09-03 21:04:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:26,741 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-03 21:04:26,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 21:04:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-03 21:04:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 21:04:26,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:26,742 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:26,743 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash 383195540, now seen corresponding path program 3 times [2019-09-03 21:04:26,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:26,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:26,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:26,910 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-03 21:04:26,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:26,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:26,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:26,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:26,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:26,911 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-03 21:04:26,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:26,931 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-03 21:04:26,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:26,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:26,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 21:04:26,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:26,988 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-03 21:04:26,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:04:27,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:27,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-03 21:04:27,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:27,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 21:04:27,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 21:04:27,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-03 21:04:27,277 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2019-09-03 21:04:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:27,398 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-03 21:04:27,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 21:04:27,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-03 21:04:27,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:27,399 INFO L225 Difference]: With dead ends: 36 [2019-09-03 21:04:27,399 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 21:04:27,400 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-03 21:04:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 21:04:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-03 21:04:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 21:04:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-09-03 21:04:27,404 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2019-09-03 21:04:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:27,405 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-09-03 21:04:27,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 21:04:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-09-03 21:04:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 21:04:27,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:27,406 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:27,407 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:27,407 INFO L82 PathProgramCache]: Analyzing trace with hash 406896119, now seen corresponding path program 4 times [2019-09-03 21:04:27,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:27,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:27,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:27,550 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-03 21:04:27,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:27,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:27,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:27,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:27,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:27,551 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:27,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:27,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 21:04:27,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:27,628 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-03 21:04:27,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:27,854 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-03 21:04:27,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:27,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2019-09-03 21:04:27,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:27,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 21:04:27,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 21:04:27,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-09-03 21:04:27,859 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 10 states. [2019-09-03 21:04:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:28,017 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-03 21:04:28,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 21:04:28,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-09-03 21:04:28,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:28,019 INFO L225 Difference]: With dead ends: 39 [2019-09-03 21:04:28,019 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 21:04:28,019 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-03 21:04:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 21:04:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-03 21:04:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 21:04:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-09-03 21:04:28,025 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-09-03 21:04:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:28,025 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-09-03 21:04:28,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 21:04:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-09-03 21:04:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 21:04:28,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:28,026 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:28,027 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:28,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2096208564, now seen corresponding path program 5 times [2019-09-03 21:04:28,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:28,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:28,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:28,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:28,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:28,195 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-03 21:04:28,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:28,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:28,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:28,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:28,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:28,196 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-03 21:04:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:28,223 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-03 21:04:28,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 21:04:28,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:28,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 21:04:28,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:28,322 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-03 21:04:28,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:28,464 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-03 21:04:28,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:28,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 18 [2019-09-03 21:04:28,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:28,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 21:04:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 21:04:28,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-09-03 21:04:28,470 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2019-09-03 21:04:32,794 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-03 21:04:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:33,694 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-09-03 21:04:33,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 21:04:33,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-09-03 21:04:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:33,697 INFO L225 Difference]: With dead ends: 56 [2019-09-03 21:04:33,697 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 21:04:33,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=221, Invalid=379, Unknown=0, NotChecked=0, Total=600 [2019-09-03 21:04:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 21:04:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-09-03 21:04:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 21:04:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-09-03 21:04:33,704 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 37 [2019-09-03 21:04:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:33,705 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-09-03 21:04:33,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 21:04:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-09-03 21:04:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 21:04:33,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:33,706 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:33,707 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1039399097, now seen corresponding path program 6 times [2019-09-03 21:04:33,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:33,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:33,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:33,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:33,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:33,893 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-03 21:04:33,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:33,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:33,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:33,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:33,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:33,894 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:33,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:33,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:33,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:33,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:33,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 21:04:33,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:33,984 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-03 21:04:33,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:34,444 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-03 21:04:34,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:34,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2019-09-03 21:04:34,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:34,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 21:04:34,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 21:04:34,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2019-09-03 21:04:34,450 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 13 states. [2019-09-03 21:04:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:34,745 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-09-03 21:04:34,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 21:04:34,746 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2019-09-03 21:04:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:34,747 INFO L225 Difference]: With dead ends: 51 [2019-09-03 21:04:34,747 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 21:04:34,747 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-03 21:04:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 21:04:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-03 21:04:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 21:04:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-09-03 21:04:34,752 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 46 [2019-09-03 21:04:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:34,752 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-09-03 21:04:34,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 21:04:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-09-03 21:04:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 21:04:34,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:34,753 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:34,754 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:34,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:34,754 INFO L82 PathProgramCache]: Analyzing trace with hash -889806346, now seen corresponding path program 7 times [2019-09-03 21:04:34,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:34,995 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-03 21:04:34,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:34,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:34,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:34,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:34,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:34,997 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) [2019-09-03 21:04:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:35,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:35,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 21:04:35,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:35,133 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-03 21:04:35,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:35,674 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-03 21:04:35,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:35,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 26 [2019-09-03 21:04:35,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:35,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 21:04:35,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 21:04:35,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-03 21:04:35,681 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 14 states. [2019-09-03 21:04:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:36,041 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-09-03 21:04:36,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 21:04:36,042 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2019-09-03 21:04:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:36,043 INFO L225 Difference]: With dead ends: 54 [2019-09-03 21:04:36,043 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 21:04:36,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-03 21:04:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 21:04:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 21:04:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 21:04:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-09-03 21:04:36,049 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 49 [2019-09-03 21:04:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:36,049 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-09-03 21:04:36,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 21:04:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-09-03 21:04:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 21:04:36,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:36,051 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:36,051 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1403196313, now seen corresponding path program 8 times [2019-09-03 21:04:36,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:36,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:36,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:36,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:36,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:36,255 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-03 21:04:36,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:36,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:36,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:36,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:36,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:36,256 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-03 21:04:36,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:36,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:36,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 21:04:36,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:36,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 21:04:36,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:36,408 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-03 21:04:36,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:36,546 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-03 21:04:36,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:36,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 24 [2019-09-03 21:04:36,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:36,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 21:04:36,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 21:04:36,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-03 21:04:36,551 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 19 states. [2019-09-03 21:04:39,544 WARN L188 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-03 21:04:43,531 WARN L188 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 21:04:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:52,207 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2019-09-03 21:04:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 21:04:52,207 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2019-09-03 21:04:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:52,209 INFO L225 Difference]: With dead ends: 74 [2019-09-03 21:04:52,209 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 21:04:52,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=397, Invalid=723, Unknown=2, NotChecked=0, Total=1122 [2019-09-03 21:04:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 21:04:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2019-09-03 21:04:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 21:04:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-09-03 21:04:52,215 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 52 [2019-09-03 21:04:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:52,215 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-09-03 21:04:52,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 21:04:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-09-03 21:04:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 21:04:52,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:52,217 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:52,217 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:52,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:52,217 INFO L82 PathProgramCache]: Analyzing trace with hash 120846324, now seen corresponding path program 9 times [2019-09-03 21:04:52,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:52,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:52,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:52,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:52,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:52,491 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-03 21:04:52,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:52,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:52,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:52,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:52,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:52,492 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) [2019-09-03 21:04:52,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:52,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:52,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:52,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:52,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 21:04:52,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:52,638 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-03 21:04:52,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:53,478 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-03 21:04:53,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:53,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 32 [2019-09-03 21:04:53,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:53,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 21:04:53,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 21:04:53,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-03 21:04:53,483 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 17 states. [2019-09-03 21:04:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:54,029 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-09-03 21:04:54,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 21:04:54,032 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-03 21:04:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:54,034 INFO L225 Difference]: With dead ends: 66 [2019-09-03 21:04:54,034 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 21:04:54,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-03 21:04:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 21:04:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-03 21:04:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 21:04:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-03 21:04:54,041 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 61 [2019-09-03 21:04:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:54,041 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-03 21:04:54,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 21:04:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-03 21:04:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 21:04:54,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:54,043 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:54,043 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:54,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1590948585, now seen corresponding path program 10 times [2019-09-03 21:04:54,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:54,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:54,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:54,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:54,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:54,307 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-03 21:04:54,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:54,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:54,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:54,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:54,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:54,308 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-03 21:04:54,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:54,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:54,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 21:04:54,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:54,409 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-03 21:04:54,410 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:55,374 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-03 21:04:55,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:55,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-03 21:04:55,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:55,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 21:04:55,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 21:04:55,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 21:04:55,380 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 18 states. [2019-09-03 21:04:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:55,988 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-03 21:04:55,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 21:04:55,989 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2019-09-03 21:04:55,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:55,990 INFO L225 Difference]: With dead ends: 69 [2019-09-03 21:04:55,990 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 21:04:55,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 21:04:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 21:04:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-03 21:04:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 21:04:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-03 21:04:55,999 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 64 [2019-09-03 21:04:55,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:56,000 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-03 21:04:56,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 21:04:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-03 21:04:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-03 21:04:56,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:56,005 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:56,005 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:56,005 INFO L82 PathProgramCache]: Analyzing trace with hash 768590100, now seen corresponding path program 11 times [2019-09-03 21:04:56,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:56,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:56,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:56,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:56,300 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-03 21:04:56,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:56,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:56,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:56,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:56,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:56,301 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-03 21:04:56,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:56,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:56,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 21:04:56,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:56,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 21:04:56,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:56,480 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-03 21:04:56,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:56,682 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-03 21:04:56,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:56,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 30 [2019-09-03 21:04:56,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:56,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 21:04:56,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 21:04:56,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2019-09-03 21:04:56,687 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 24 states. [2019-09-03 21:04:57,776 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-03 21:04:59,849 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967295) 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)) is different from false [2019-09-03 21:05:05,887 WARN L188 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-03 21:05:10,314 WARN L188 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 21:05:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:24,310 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-09-03 21:05:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 21:05:24,311 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-09-03 21:05:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:24,312 INFO L225 Difference]: With dead ends: 91 [2019-09-03 21:05:24,312 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 21:05:24,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=594, Invalid=1126, Unknown=6, NotChecked=80, Total=1806 [2019-09-03 21:05:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 21:05:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2019-09-03 21:05:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 21:05:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-03 21:05:24,318 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 67 [2019-09-03 21:05:24,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:24,319 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-03 21:05:24,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 21:05:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-03 21:05:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 21:05:24,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:24,320 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:24,320 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:24,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1916235353, now seen corresponding path program 12 times [2019-09-03 21:05:24,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:24,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:24,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:24,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:24,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:24,683 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-03 21:05:24,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:24,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:24,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:24,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:24,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:24,684 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-03 21:05:24,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:24,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:24,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:24,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:24,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:05:24,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:24,867 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-03 21:05:24,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:26,826 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-03 21:05:26,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:26,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 24] total 46 [2019-09-03 21:05:26,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:26,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 21:05:26,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 21:05:26,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=1478, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 21:05:26,831 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 24 states. [2019-09-03 21:05:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:27,819 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-09-03 21:05:27,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 21:05:27,819 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2019-09-03 21:05:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:27,821 INFO L225 Difference]: With dead ends: 90 [2019-09-03 21:05:27,821 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 21:05:27,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=592, Invalid=1478, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 21:05:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 21:05:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-03 21:05:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 21:05:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2019-09-03 21:05:27,828 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 76 [2019-09-03 21:05:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:27,828 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2019-09-03 21:05:27,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 21:05:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2019-09-03 21:05:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 21:05:27,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:27,830 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 21, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:27,830 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:27,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:27,831 INFO L82 PathProgramCache]: Analyzing trace with hash 70216729, now seen corresponding path program 13 times [2019-09-03 21:05:27,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:27,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:27,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:28,296 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-03 21:05:28,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:28,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:28,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:28,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:28,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:28,297 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:28,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:28,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:28,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:05:28,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:28,425 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-03 21:05:28,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:30,712 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-03 21:05:30,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:30,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 48 [2019-09-03 21:05:30,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:30,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 21:05:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 21:05:30,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=1611, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 21:05:30,718 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 25 states. [2019-09-03 21:05:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:32,028 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-09-03 21:05:32,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 21:05:32,029 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2019-09-03 21:05:32,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:32,030 INFO L225 Difference]: With dead ends: 93 [2019-09-03 21:05:32,030 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 21:05:32,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=645, Invalid=1611, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 21:05:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 21:05:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-03 21:05:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-03 21:05:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2019-09-03 21:05:32,050 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 88 [2019-09-03 21:05:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:32,050 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2019-09-03 21:05:32,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 21:05:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2019-09-03 21:05:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-03 21:05:32,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:32,052 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 22, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:32,053 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:32,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:32,057 INFO L82 PathProgramCache]: Analyzing trace with hash 23476502, now seen corresponding path program 14 times [2019-09-03 21:05:32,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:32,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:32,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:32,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:32,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:32,568 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-03 21:05:32,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:32,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:32,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:32,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:32,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:32,570 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) [2019-09-03 21:05:32,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:32,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:32,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 21:05:32,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:32,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 21:05:32,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:32,951 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-03 21:05:32,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:33,249 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-03 21:05:33,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:33,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9, 9] total 39 [2019-09-03 21:05:33,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:33,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 21:05:33,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 21:05:33,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 21:05:33,254 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 32 states. [2019-09-03 21:05:46,974 WARN L188 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-03 21:05:53,125 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 21:06:02,404 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 21:06:19,025 WARN L188 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2019-09-03 21:06:42,512 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 21:06:59,923 WARN L188 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 21:07:06,115 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-03 21:07:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:06,133 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2019-09-03 21:07:06,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 21:07:06,134 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2019-09-03 21:07:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:06,135 INFO L225 Difference]: With dead ends: 120 [2019-09-03 21:07:06,135 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 21:07:06,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 87.3s TimeCoverageRelationStatistics Valid=1043, Invalid=2018, Unknown=19, NotChecked=0, Total=3080 [2019-09-03 21:07:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 21:07:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2019-09-03 21:07:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 21:07:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-09-03 21:07:06,139 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 91 [2019-09-03 21:07:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:06,139 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-09-03 21:07:06,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 21:07:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-09-03 21:07:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 21:07:06,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:06,141 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 24, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:06,141 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash -932954345, now seen corresponding path program 15 times [2019-09-03 21:07:06,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:06,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:06,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:06,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:06,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:06,859 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-03 21:07:06,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:06,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:06,859 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:06,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:06,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:06,860 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-03 21:07:06,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:07:06,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:07:06,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:07:06,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:06,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 21:07:06,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:07,054 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-03 21:07:07,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:09,669 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-03 21:07:09,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:09,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 28] total 54 [2019-09-03 21:07:09,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:09,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 21:07:09,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 21:07:09,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=2055, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 21:07:09,679 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 28 states. [2019-09-03 21:07:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:11,165 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-09-03 21:07:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 21:07:11,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 100 [2019-09-03 21:07:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:11,167 INFO L225 Difference]: With dead ends: 105 [2019-09-03 21:07:11,168 INFO L226 Difference]: Without dead ends: 105 [2019-09-03 21:07:11,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 172 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=807, Invalid=2055, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 21:07:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-03 21:07:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-03 21:07:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 21:07:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-09-03 21:07:11,173 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 100 [2019-09-03 21:07:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:11,173 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-09-03 21:07:11,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 21:07:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-09-03 21:07:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-03 21:07:11,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:11,175 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 25, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:11,175 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:11,175 INFO L82 PathProgramCache]: Analyzing trace with hash -985237356, now seen corresponding path program 16 times [2019-09-03 21:07:11,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:11,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:11,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:11,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:11,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:11,715 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-03 21:07:11,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:11,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:11,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:11,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:11,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:11,716 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-03 21:07:11,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:11,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:07:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:11,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 21:07:11,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:11,854 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-03 21:07:11,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:14,124 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-03 21:07:14,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:14,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 56 [2019-09-03 21:07:14,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:14,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 21:07:14,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 21:07:14,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 21:07:14,129 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 29 states. [2019-09-03 21:07:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:15,711 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-09-03 21:07:15,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 21:07:15,712 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 103 [2019-09-03 21:07:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:15,713 INFO L225 Difference]: With dead ends: 108 [2019-09-03 21:07:15,713 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 21:07:15,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 177 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 21:07:15,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 21:07:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-03 21:07:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 21:07:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-09-03 21:07:15,719 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 103 [2019-09-03 21:07:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:15,720 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-09-03 21:07:15,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 21:07:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-09-03 21:07:15,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 21:07:15,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:15,721 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 26, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:15,721 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:15,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:15,722 INFO L82 PathProgramCache]: Analyzing trace with hash 524710391, now seen corresponding path program 17 times [2019-09-03 21:07:15,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:15,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:15,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:15,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:15,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:16,340 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-03 21:07:16,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:16,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:16,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:16,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:16,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:16,342 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) [2019-09-03 21:07:16,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:07:16,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:16,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 21:07:16,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:16,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 21:07:16,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:16,747 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-03 21:07:16,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:17,220 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-03 21:07:17,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:17,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10, 10] total 45 [2019-09-03 21:07:17,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:17,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 21:07:17,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 21:07:17,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=1406, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 21:07:17,236 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 37 states. [2019-09-03 21:07:37,065 WARN L188 SmtUtils]: Spent 13.53 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-09-03 21:07:46,059 WARN L188 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 21:07:54,430 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 21:07:57,404 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 21:08:20,628 WARN L188 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-09-03 21:08:34,521 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 21:08:37,912 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 21:08:42,863 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-03 21:08:47,510 WARN L188 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 21:08:54,160 WARN L188 SmtUtils]: Spent 6.42 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-03 21:09:01,583 WARN L188 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 21:09:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:03,655 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2019-09-03 21:09:03,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 21:09:03,655 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2019-09-03 21:09:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:03,657 INFO L225 Difference]: With dead ends: 138 [2019-09-03 21:09:03,657 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 21:09:03,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 93.6s TimeCoverageRelationStatistics Valid=1398, Invalid=2755, Unknown=7, NotChecked=0, Total=4160 [2019-09-03 21:09:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 21:09:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2019-09-03 21:09:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 21:09:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-09-03 21:09:03,662 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 106 [2019-09-03 21:09:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:03,662 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-09-03 21:09:03,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 21:09:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-09-03 21:09:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-03 21:09:03,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:03,663 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 28, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:03,664 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash -362906410, now seen corresponding path program 18 times [2019-09-03 21:09:03,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:03,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:03,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:04,273 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-03 21:09:04,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:04,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:04,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:04,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:04,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:04,274 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-03 21:09:04,286 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:09:04,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:09:04,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:09:04,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:04,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 21:09:04,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:04,429 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-03 21:09:04,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:07,492 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-03 21:09:07,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:07,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 32] total 62 [2019-09-03 21:09:07,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:07,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 21:09:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 21:09:07,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=2731, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 21:09:07,497 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 32 states. [2019-09-03 21:09:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:09,472 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-09-03 21:09:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 21:09:09,475 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 115 [2019-09-03 21:09:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:09,477 INFO L225 Difference]: With dead ends: 120 [2019-09-03 21:09:09,477 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 21:09:09,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 198 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1051, Invalid=2731, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 21:09:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 21:09:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-03 21:09:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 21:09:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2019-09-03 21:09:09,481 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 115 [2019-09-03 21:09:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:09,482 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2019-09-03 21:09:09,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 21:09:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2019-09-03 21:09:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 21:09:09,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:09,483 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 29, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:09,483 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash -337872455, now seen corresponding path program 19 times [2019-09-03 21:09:09,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:09,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:09,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:10,129 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-03 21:09:10,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:10,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:10,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:10,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:10,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:10,130 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-03 21:09:10,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:10,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:10,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 21:09:10,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:10,279 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-03 21:09:10,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:13,696 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-03 21:09:13,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:13,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 64 [2019-09-03 21:09:13,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:13,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 21:09:13,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 21:09:13,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=2915, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 21:09:13,703 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 33 states. [2019-09-03 21:09:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:15,792 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-09-03 21:09:15,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 21:09:15,793 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 118 [2019-09-03 21:09:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:15,794 INFO L225 Difference]: With dead ends: 123 [2019-09-03 21:09:15,794 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 21:09:15,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 203 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1117, Invalid=2915, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 21:09:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 21:09:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-03 21:09:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 21:09:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2019-09-03 21:09:15,799 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 118 [2019-09-03 21:09:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:15,799 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2019-09-03 21:09:15,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 21:09:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2019-09-03 21:09:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 21:09:15,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:15,801 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 30, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:15,801 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1875628554, now seen corresponding path program 20 times [2019-09-03 21:09:15,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:15,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:15,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:16,738 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-03 21:09:16,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:16,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:16,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:16,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:16,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:16,739 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) [2019-09-03 21:09:16,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:09:16,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:16,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 21:09:16,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:16,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 21:09:16,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:17,215 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-03 21:09:17,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:17,726 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-03 21:09:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:17,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11, 11] total 51 [2019-09-03 21:09:17,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:17,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 21:09:17,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 21:09:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=1826, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 21:09:17,731 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 42 states. [2019-09-03 21:09:28,086 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2019-09-03 21:09:32,030 WARN L188 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-03 21:09:42,419 WARN L188 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-09-03 21:10:14,652 WARN L188 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 21:10:35,272 WARN L188 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-09-03 21:11:15,350 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-09-03 21:11:18,989 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 21:11:25,357 WARN L188 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-09-03 21:11:28,246 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 21:11:39,172 WARN L188 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 21:11:41,642 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)) is different from false [2019-09-03 21:11:53,038 WARN L188 SmtUtils]: Spent 5.37 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 21:12:03,482 WARN L188 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-09-03 21:12:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:12:03,485 INFO L93 Difference]: Finished difference Result 156 states and 172 transitions. [2019-09-03 21:12:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 21:12:03,485 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2019-09-03 21:12:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:12:03,487 INFO L225 Difference]: With dead ends: 156 [2019-09-03 21:12:03,487 INFO L226 Difference]: Without dead ends: 156 [2019-09-03 21:12:03,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 232 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 141.6s TimeCoverageRelationStatistics Valid=1744, Invalid=3502, Unknown=14, NotChecked=142, Total=5402 [2019-09-03 21:12:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-03 21:12:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 131. [2019-09-03 21:12:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-03 21:12:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2019-09-03 21:12:03,491 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 121 [2019-09-03 21:12:03,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:12:03,492 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2019-09-03 21:12:03,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 21:12:03,492 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2019-09-03 21:12:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 21:12:03,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:12:03,493 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 32, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:12:03,493 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:12:03,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:12:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1774365129, now seen corresponding path program 21 times [2019-09-03 21:12:03,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:12:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:03,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:12:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:03,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:12:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:04,337 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-03 21:12:04,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:04,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:12:04,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:12:04,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:12:04,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:04,338 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-03 21:12:04,350 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:12:04,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:12:04,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:12:04,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:12:04,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 21:12:04,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:12:04,496 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-03 21:12:04,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:09,212 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-03 21:12:09,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:12:09,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 36] total 70 [2019-09-03 21:12:09,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:09,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 21:12:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 21:12:09,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=3503, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 21:12:09,217 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 36 states. [2019-09-03 21:12:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:12:11,747 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2019-09-03 21:12:11,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 21:12:11,748 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 130 [2019-09-03 21:12:11,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:12:11,749 INFO L225 Difference]: With dead ends: 135 [2019-09-03 21:12:11,749 INFO L226 Difference]: Without dead ends: 135 [2019-09-03 21:12:11,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1327, Invalid=3503, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 21:12:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-03 21:12:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-09-03 21:12:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-03 21:12:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2019-09-03 21:12:11,754 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 130 [2019-09-03 21:12:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:12:11,754 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2019-09-03 21:12:11,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 21:12:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2019-09-03 21:12:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-03 21:12:11,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:12:11,755 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 33, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:12:11,756 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:12:11,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:12:11,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1709151988, now seen corresponding path program 22 times [2019-09-03 21:12:11,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:12:11,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:11,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:12:11,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:11,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:12:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:12,860 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-03 21:12:12,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:12,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:12:12,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:12:12,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:12:12,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:12,861 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-03 21:12:12,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:12:12,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:12:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:12,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 21:12:12,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:12:13,094 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-03 21:12:13,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:17,289 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-03 21:12:17,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:12:17,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 37] total 72 [2019-09-03 21:12:17,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:17,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 21:12:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 21:12:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1401, Invalid=3711, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 21:12:17,294 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 37 states. [2019-09-03 21:12:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:12:19,925 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-09-03 21:12:19,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 21:12:19,926 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 133 [2019-09-03 21:12:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:12:19,928 INFO L225 Difference]: With dead ends: 138 [2019-09-03 21:12:19,928 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 21:12:19,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 229 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1401, Invalid=3711, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 21:12:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 21:12:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-03 21:12:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-03 21:12:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2019-09-03 21:12:19,932 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 133 [2019-09-03 21:12:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:12:19,933 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2019-09-03 21:12:19,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 21:12:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2019-09-03 21:12:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 21:12:19,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:12:19,934 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 34, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:12:19,934 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:12:19,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:12:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash -127188713, now seen corresponding path program 23 times [2019-09-03 21:12:19,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:12:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:19,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:12:19,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:19,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:12:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 797 proven. 1751 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:12:20,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:20,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:12:20,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:12:20,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:12:20,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:20,847 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-03 21:12:20,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:12:20,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:12:20,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 21:12:20,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:12:20,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 21:12:20,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:12:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 875 proven. 100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2019-09-03 21:12:21,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 875 proven. 100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2019-09-03 21:12:21,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:12:21,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 12, 12] total 57 [2019-09-03 21:12:21,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:21,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 21:12:21,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 21:12:21,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=891, Invalid=2301, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 21:12:21,989 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 47 states. [2019-09-03 21:12:38,768 WARN L188 SmtUtils]: Spent 7.27 s on a formula simplification. DAG size of input: 42 DAG size of output: 10 [2019-09-03 21:12:56,507 WARN L188 SmtUtils]: Spent 8.33 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-03 21:13:11,345 WARN L188 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-03 21:13:33,634 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 21:13:42,603 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 21:14:26,950 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2019-09-03 21:14:49,209 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-03 21:14:53,871 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-09-03 21:15:03,464 WARN L188 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 21:15:08,620 WARN L188 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 21:15:19,545 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 26 DAG size of output: 10 [2019-09-03 21:15:27,201 WARN L188 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 21:15:44,714 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 21:15:52,586 WARN L188 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-09-03 21:16:03,106 WARN L188 SmtUtils]: Spent 7.64 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-03 21:16:18,312 WARN L188 SmtUtils]: Spent 5.02 s on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2019-09-03 21:16:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:16:18,320 INFO L93 Difference]: Finished difference Result 174 states and 192 transitions. [2019-09-03 21:16:18,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 21:16:18,321 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2019-09-03 21:16:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:16:18,322 INFO L225 Difference]: With dead ends: 174 [2019-09-03 21:16:18,323 INFO L226 Difference]: Without dead ends: 174 [2019-09-03 21:16:18,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 261 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 218.2s TimeCoverageRelationStatistics Valid=2232, Invalid=4547, Unknown=27, NotChecked=0, Total=6806 [2019-09-03 21:16:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-03 21:16:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2019-09-03 21:16:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 21:16:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2019-09-03 21:16:18,327 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 136 [2019-09-03 21:16:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:16:18,327 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2019-09-03 21:16:18,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 21:16:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2019-09-03 21:16:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-03 21:16:18,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:16:18,328 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 36, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:16:18,328 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:16:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:16:18,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1866801590, now seen corresponding path program 24 times [2019-09-03 21:16:18,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:16:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:18,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:16:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:18,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:16:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 953 proven. 1962 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:16:19,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:19,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:16:19,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:16:19,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:16:19,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:19,247 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-03 21:16:19,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:16:19,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:16:19,304 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:16:19,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:16:19,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 21:16:19,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 458 proven. 2542 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:16:19,695 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 458 proven. 2539 refuted. 3 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:16:29,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:16:29,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 44, 45] total 88 [2019-09-03 21:16:29,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:16:29,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 21:16:29,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 21:16:29,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2060, Invalid=5595, Unknown=1, NotChecked=0, Total=7656 [2019-09-03 21:16:29,706 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 45 states. [2019-09-03 21:16:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:16:33,776 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2019-09-03 21:16:33,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 21:16:33,777 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 145 [2019-09-03 21:16:33,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:16:33,778 INFO L225 Difference]: With dead ends: 165 [2019-09-03 21:16:33,778 INFO L226 Difference]: Without dead ends: 165 [2019-09-03 21:16:33,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 240 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=2060, Invalid=5595, Unknown=1, NotChecked=0, Total=7656 [2019-09-03 21:16:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-03 21:16:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-09-03 21:16:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-03 21:16:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2019-09-03 21:16:33,784 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 145 [2019-09-03 21:16:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:16:33,784 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2019-09-03 21:16:33,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 21:16:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2019-09-03 21:16:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-03 21:16:33,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:16:33,785 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 42, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:16:33,786 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:16:33,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:16:33,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1865808618, now seen corresponding path program 25 times [2019-09-03 21:16:33,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:16:33,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:33,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:16:33,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:33,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:16:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:34,923 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-03 21:16:34,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:34,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:16:34,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:16:34,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:16:34,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:34,924 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-03 21:16:34,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:16:34,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:16:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:34,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 21:16:34,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:35,116 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-03 21:16:35,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:41,862 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-03 21:16:41,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:16:41,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 46] total 90 [2019-09-03 21:16:41,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:16:41,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 21:16:41,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 21:16:41,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2157, Invalid=5853, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 21:16:41,866 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 46 states. [2019-09-03 21:16:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:16:46,076 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2019-09-03 21:16:46,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 21:16:46,077 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 163 [2019-09-03 21:16:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:16:46,078 INFO L225 Difference]: With dead ends: 168 [2019-09-03 21:16:46,078 INFO L226 Difference]: Without dead ends: 168 [2019-09-03 21:16:46,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 280 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2157, Invalid=5853, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 21:16:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-03 21:16:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-03 21:16:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 21:16:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2019-09-03 21:16:46,083 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 163 [2019-09-03 21:16:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:16:46,083 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2019-09-03 21:16:46,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 21:16:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2019-09-03 21:16:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 21:16:46,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:16:46,084 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 43, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:16:46,084 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:16:46,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:16:46,085 INFO L82 PathProgramCache]: Analyzing trace with hash -823947271, now seen corresponding path program 26 times [2019-09-03 21:16:46,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:16:46,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:46,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:16:46,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:46,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:16:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:47,352 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-03 21:16:47,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:47,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:16:47,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:16:47,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:16:47,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:47,353 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-03 21:16:47,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:16:47,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:16:47,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 21:16:47,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:16:47,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 21:16:47,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:48,073 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-03 21:16:48,074 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:48,866 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-03 21:16:48,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:16:48,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 13, 13] total 68 [2019-09-03 21:16:48,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:16:48,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 21:16:48,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 21:16:48,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1200, Invalid=3356, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 21:16:48,872 INFO L87 Difference]: Start difference. First operand 167 states and 176 transitions. Second operand 57 states. [2019-09-03 21:17:10,901 WARN L188 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 46 DAG size of output: 10 [2019-09-03 21:17:21,431 WARN L188 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-09-03 21:17:29,805 WARN L188 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-03 21:17:50,607 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-03 21:17:53,267 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 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-03 21:18:01,665 WARN L188 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 21:18:05,475 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) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 500000)) is different from false [2019-09-03 21:18:18,367 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 21:18:36,448 WARN L188 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 24 DAG size of output: 12