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/Mono1_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:09:22,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:09:22,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:09:22,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:09:22,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:09:22,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:09:22,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:09:22,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:09:22,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:09:22,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:09:22,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:09:22,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:09:22,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:09:22,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:09:22,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:09:22,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:09:22,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:09:22,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:09:22,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:09:22,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:09:22,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:09:22,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:09:22,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:09:22,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:09:22,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:09:22,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:09:22,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:09:22,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:09:22,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:09:22,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:09:22,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:09:22,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:09:22,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:09:22,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:09:23,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:09:23,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:09:23,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:09:23,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:09:23,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:09:23,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:09:23,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:09:23,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 13:09:23,026 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:09:23,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:09:23,027 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:09:23,027 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:09:23,028 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:09:23,028 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:09:23,028 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:09:23,028 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:09:23,029 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:09:23,029 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:09:23,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:09:23,031 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:09:23,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:09:23,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:09:23,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:09:23,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:09:23,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:09:23,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:09:23,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:09:23,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:09:23,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:09:23,034 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:09:23,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:09:23,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:09:23,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:09:23,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:09:23,035 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:09:23,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:09:23,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:09:23,036 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:09:23,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:09:23,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:09:23,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:09:23,098 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:09:23,099 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:09:23,099 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2019-09-05 13:09:23,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff868f871/47879b1c487d4178bc8cf23465016282/FLAGc897c05a8 [2019-09-05 13:09:23,649 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:09:23,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2019-09-05 13:09:23,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff868f871/47879b1c487d4178bc8cf23465016282/FLAGc897c05a8 [2019-09-05 13:09:24,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff868f871/47879b1c487d4178bc8cf23465016282 [2019-09-05 13:09:24,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:09:24,030 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:09:24,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:09:24,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:09:24,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:09:24,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:09:24" (1/1) ... [2019-09-05 13:09:24,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4083eb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24, skipping insertion in model container [2019-09-05 13:09:24,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:09:24" (1/1) ... [2019-09-05 13:09:24,046 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:09:24,060 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:09:24,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:09:24,228 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:09:24,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:09:24,255 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:09:24,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24 WrapperNode [2019-09-05 13:09:24,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:09:24,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:09:24,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:09:24,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:09:24,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24" (1/1) ... [2019-09-05 13:09:24,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24" (1/1) ... [2019-09-05 13:09:24,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24" (1/1) ... [2019-09-05 13:09:24,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24" (1/1) ... [2019-09-05 13:09:24,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24" (1/1) ... [2019-09-05 13:09:24,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24" (1/1) ... [2019-09-05 13:09:24,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24" (1/1) ... [2019-09-05 13:09:24,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:09:24,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:09:24,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:09:24,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:09:24,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:09:24,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:09:24,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:09:24,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:09:24,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:09:24,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:09:24,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:09:24,425 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:09:24,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:09:24,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:09:24,576 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:09:24,576 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 13:09:24,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:09:24 BoogieIcfgContainer [2019-09-05 13:09:24,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:09:24,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:09:24,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:09:24,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:09:24,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:09:24" (1/3) ... [2019-09-05 13:09:24,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773582f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:09:24, skipping insertion in model container [2019-09-05 13:09:24,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:24" (2/3) ... [2019-09-05 13:09:24,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773582f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:09:24, skipping insertion in model container [2019-09-05 13:09:24,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:09:24" (3/3) ... [2019-09-05 13:09:24,584 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2019-09-05 13:09:24,591 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:09:24,605 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:09:24,623 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:09:24,646 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:09:24,646 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:09:24,646 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:09:24,646 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:09:24,647 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:09:24,647 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:09:24,647 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:09:24,647 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:09:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-05 13:09:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:09:24,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:24,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:24,670 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:24,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-05 13:09:24,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:24,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:24,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:24,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:09:24,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:09:24,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:09:24,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:09:24,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:09:24,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:09:24,790 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-05 13:09:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:24,803 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-05 13:09:24,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:09:24,804 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 13:09:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:24,812 INFO L225 Difference]: With dead ends: 18 [2019-09-05 13:09:24,812 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 13:09:24,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:09:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 13:09:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 13:09:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 13:09:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-05 13:09:24,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-05 13:09:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:24,841 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-05 13:09:24,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:09:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-05 13:09:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:09:24,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:24,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:24,842 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:24,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:24,843 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-05 13:09:24,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:24,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:09:24,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:09:24,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:09:24,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:09:24,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:09:24,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:09:24,934 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-05 13:09:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:24,954 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-05 13:09:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:09:24,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 13:09:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:24,956 INFO L225 Difference]: With dead ends: 14 [2019-09-05 13:09:24,956 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 13:09:24,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:09:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 13:09:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 13:09:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 13:09:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-05 13:09:24,960 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-05 13:09:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:24,961 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-05 13:09:24,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:09:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-05 13:09:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:09:24,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:24,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:24,962 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:24,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-05 13:09:24,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:25,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:25,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:25,147 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-05 13:09:25,149 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [25], [28], [30], [36], [37], [38], [40] [2019-09-05 13:09:25,187 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:09:25,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:09:25,246 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:09:25,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:09:25,326 INFO L272 AbstractInterpreter]: Visited 12 different actions 54 times. Merged at 3 different actions 18 times. Widened at 1 different actions 4 times. Performed 88 root evaluator evaluations with a maximum evaluation depth of 5. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-05 13:09:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:25,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:09:25,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:25,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:25,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:25,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:09:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:25,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:09:25,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:25,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:25,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:25,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 10 [2019-09-05 13:09:25,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:25,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:09:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:09:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:25,508 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-05 13:09:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:25,548 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-05 13:09:25,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:09:25,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 13:09:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:25,549 INFO L225 Difference]: With dead ends: 16 [2019-09-05 13:09:25,549 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 13:09:25,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 13:09:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 13:09:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 13:09:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-09-05 13:09:25,554 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-09-05 13:09:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:25,554 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-09-05 13:09:25,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:09:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-09-05 13:09:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 13:09:25,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:25,555 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:25,556 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:25,556 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-05 13:09:25,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:25,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:25,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:25,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:25,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:25,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:25,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:25,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:25,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:25,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:25,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:25,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:09:25,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:09:25,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 13:09:25,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:25,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 13:09:25,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:09:25,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:09:25,786 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-05 13:09:25,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 6] imperfect sequences [5] total 10 [2019-09-05 13:09:25,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:09:25,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:09:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:09:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:25,788 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2019-09-05 13:09:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:25,807 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-05 13:09:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:09:25,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-05 13:09:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:25,809 INFO L225 Difference]: With dead ends: 18 [2019-09-05 13:09:25,809 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 13:09:25,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 13:09:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-05 13:09:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 13:09:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-05 13:09:25,813 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-09-05 13:09:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:25,814 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-05 13:09:25,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:09:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-05 13:09:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:09:25,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:25,815 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:25,816 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:25,816 INFO L82 PathProgramCache]: Analyzing trace with hash -582276883, now seen corresponding path program 1 times [2019-09-05 13:09:25,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:25,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:25,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:25,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:25,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:25,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:25,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:25,961 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-05 13:09:25,962 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-05 13:09:25,963 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:09:25,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:09:25,965 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:09:25,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:09:25,999 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 18 times. Widened at 2 different actions 4 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 5. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-05 13:09:25,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:25,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:09:25,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:25,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:26,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:26,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:09:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:26,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 13:09:26,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:26,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:26,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:26,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2019-09-05 13:09:26,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:26,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:09:26,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:09:26,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:26,162 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-05 13:09:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:26,212 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-05 13:09:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:09:26,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-05 13:09:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:26,213 INFO L225 Difference]: With dead ends: 19 [2019-09-05 13:09:26,214 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 13:09:26,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 13:09:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 13:09:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 13:09:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-05 13:09:26,218 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-09-05 13:09:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:26,218 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-05 13:09:26,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:09:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-05 13:09:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:09:26,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:26,219 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:26,219 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash 719600874, now seen corresponding path program 2 times [2019-09-05 13:09:26,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:26,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:26,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:26,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:26,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:26,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:26,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:26,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:26,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:26,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:26,325 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-05 13:09:26,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:09:26,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:09:26,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:09:26,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:26,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 13:09:26,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 13:09:26,393 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 13:09:26,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:26,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 7] total 13 [2019-09-05 13:09:26,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:26,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:09:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:09:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:09:26,496 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2019-09-05 13:09:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:28,806 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-05 13:09:28,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 13:09:28,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-05 13:09:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:28,807 INFO L225 Difference]: With dead ends: 26 [2019-09-05 13:09:28,807 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 13:09:28,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:09:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 13:09:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-05 13:09:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 13:09:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-05 13:09:28,811 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-09-05 13:09:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:28,812 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-05 13:09:28,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:09:28,812 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-05 13:09:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 13:09:28,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:28,813 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:28,813 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash 957312226, now seen corresponding path program 3 times [2019-09-05 13:09:28,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:28,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:28,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:28,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:28,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:28,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:28,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:28,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:28,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:28,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:28,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:09:28,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:09:28,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:28,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:09:28,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:28,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 13:09:28,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:29,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:29,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:29,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2019-09-05 13:09:29,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:29,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:09:29,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:09:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:09:29,245 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-09-05 13:09:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:29,326 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-05 13:09:29,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:09:29,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-05 13:09:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:29,328 INFO L225 Difference]: With dead ends: 25 [2019-09-05 13:09:29,328 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 13:09:29,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:09:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 13:09:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-05 13:09:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 13:09:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-05 13:09:29,333 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2019-09-05 13:09:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:29,333 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-05 13:09:29,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:09:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-05 13:09:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 13:09:29,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:29,334 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:29,335 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:29,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1915302113, now seen corresponding path program 4 times [2019-09-05 13:09:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:29,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:29,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:29,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:29,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:29,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:29,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:29,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:29,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:29,505 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-05 13:09:29,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:29,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:09:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:29,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:09:29,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:29,578 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:29,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:29,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-05 13:09:29,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:29,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:09:29,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:09:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:09:29,754 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 9 states. [2019-09-05 13:09:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:29,881 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-05 13:09:29,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:09:29,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-09-05 13:09:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:29,885 INFO L225 Difference]: With dead ends: 27 [2019-09-05 13:09:29,885 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 13:09:29,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:09:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 13:09:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-05 13:09:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 13:09:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-05 13:09:29,894 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-09-05 13:09:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:29,894 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-05 13:09:29,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:09:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-05 13:09:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 13:09:29,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:29,895 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:29,895 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:29,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash -833710564, now seen corresponding path program 5 times [2019-09-05 13:09:29,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:29,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:29,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:29,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:29,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:30,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:30,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:30,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:30,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:30,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:30,145 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:30,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:09:30,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:09:30,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 13:09:30,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:30,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:09:30,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 13:09:30,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 13:09:30,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:30,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 8] total 18 [2019-09-05 13:09:30,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:30,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:09:30,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:09:30,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-09-05 13:09:30,397 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 12 states. [2019-09-05 13:09:30,958 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 13:09:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:36,369 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-05 13:09:36,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 13:09:36,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-05 13:09:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:36,371 INFO L225 Difference]: With dead ends: 36 [2019-09-05 13:09:36,371 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 13:09:36,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2019-09-05 13:09:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 13:09:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-09-05 13:09:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 13:09:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-05 13:09:36,377 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2019-09-05 13:09:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:36,378 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-05 13:09:36,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:09:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-05 13:09:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 13:09:36,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:36,379 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:36,379 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:36,379 INFO L82 PathProgramCache]: Analyzing trace with hash -644516716, now seen corresponding path program 6 times [2019-09-05 13:09:36,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:36,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:36,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:36,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:36,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:36,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:36,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:36,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:36,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:36,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:36,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:09:36,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:09:36,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:36,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:09:36,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:36,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 13:09:36,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:36,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:36,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:36,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2019-09-05 13:09:36,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:36,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 13:09:36,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 13:09:36,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-05 13:09:36,994 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 11 states. [2019-09-05 13:09:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:37,119 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-09-05 13:09:37,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 13:09:37,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-09-05 13:09:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:37,122 INFO L225 Difference]: With dead ends: 33 [2019-09-05 13:09:37,122 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 13:09:37,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-05 13:09:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 13:09:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 13:09:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 13:09:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-05 13:09:37,127 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2019-09-05 13:09:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:37,128 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-05 13:09:37,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 13:09:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-05 13:09:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 13:09:37,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:37,129 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:37,129 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:37,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash -30848559, now seen corresponding path program 7 times [2019-09-05 13:09:37,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:37,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:37,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:37,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:37,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:37,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:37,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:37,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:37,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:37,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:37,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:09:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:37,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 13:09:37,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:37,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:37,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:37,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 22 [2019-09-05 13:09:37,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:37,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:09:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:09:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-05 13:09:37,685 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 12 states. [2019-09-05 13:09:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:37,857 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-05 13:09:37,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 13:09:37,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-09-05 13:09:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:37,858 INFO L225 Difference]: With dead ends: 35 [2019-09-05 13:09:37,858 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 13:09:37,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-05 13:09:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 13:09:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 13:09:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 13:09:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-09-05 13:09:37,862 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2019-09-05 13:09:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:37,863 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-09-05 13:09:37,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:09:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-09-05 13:09:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 13:09:37,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:37,864 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:37,864 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:37,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:37,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1293730766, now seen corresponding path program 8 times [2019-09-05 13:09:37,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:37,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:37,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:37,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:38,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:38,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:38,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:38,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:38,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:38,043 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) [2019-09-05 13:09:38,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:09:38,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:38,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-05 13:09:38,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:38,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 13:09:38,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-05 13:09:38,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-05 13:09:38,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:38,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 9] total 23 [2019-09-05 13:09:38,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:38,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 13:09:38,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 13:09:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:09:38,366 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2019-09-05 13:09:40,906 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:09:47,499 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 13:09:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:54,588 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-09-05 13:09:54,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:09:54,588 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-05 13:09:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:54,589 INFO L225 Difference]: With dead ends: 42 [2019-09-05 13:09:54,589 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 13:09:54,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-09-05 13:09:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 13:09:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-09-05 13:09:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 13:09:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-05 13:09:54,594 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 34 [2019-09-05 13:09:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:54,594 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-05 13:09:54,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 13:09:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-05 13:09:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 13:09:54,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:54,595 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:54,595 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:54,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash 284766406, now seen corresponding path program 9 times [2019-09-05 13:09:54,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:54,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:54,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:54,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:54,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:54,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:54,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:54,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:54,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:54,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:54,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:54,797 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:09:54,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:09:54,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:09:54,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:54,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 13:09:54,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:54,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:55,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:55,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 26 [2019-09-05 13:09:55,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:55,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 13:09:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 13:09:55,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-05 13:09:55,451 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 14 states. [2019-09-05 13:09:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:55,699 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-05 13:09:55,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:09:55,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-09-05 13:09:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:55,701 INFO L225 Difference]: With dead ends: 41 [2019-09-05 13:09:55,701 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 13:09:55,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-05 13:09:55,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 13:09:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 13:09:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 13:09:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-05 13:09:55,706 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 38 [2019-09-05 13:09:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:55,707 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-05 13:09:55,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 13:09:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-05 13:09:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 13:09:55,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:55,708 INFO L399 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:55,708 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash 926316803, now seen corresponding path program 10 times [2019-09-05 13:09:55,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:55,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:55,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:55,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:55,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:55,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:55,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:55,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:55,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:55,881 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) [2019-09-05 13:09:55,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:55,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:55,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 13:09:55,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:55,977 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:56,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:56,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 28 [2019-09-05 13:09:56,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:56,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 13:09:56,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 13:09:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-05 13:09:56,728 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 15 states. [2019-09-05 13:09:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:57,020 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-05 13:09:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 13:09:57,022 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-05 13:09:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:57,023 INFO L225 Difference]: With dead ends: 43 [2019-09-05 13:09:57,023 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 13:09:57,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-05 13:09:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 13:09:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 13:09:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 13:09:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-05 13:09:57,028 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2019-09-05 13:09:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:57,028 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-05 13:09:57,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 13:09:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-05 13:09:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 13:09:57,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:57,029 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:57,029 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1019042304, now seen corresponding path program 11 times [2019-09-05 13:09:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:57,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:57,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:57,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:57,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:57,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:57,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:57,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:57,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:57,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:09:57,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:09:57,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 13:09:57,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:57,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 13:09:57,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-05 13:09:57,446 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-05 13:09:57,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:57,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 10] total 28 [2019-09-05 13:09:57,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:57,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 13:09:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 13:09:57,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-05 13:09:57,769 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 20 states. [2019-09-05 13:10:01,089 WARN L188 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:10:07,845 WARN L188 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 13:10:15,173 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:10:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:10:17,946 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-05 13:10:17,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:10:17,947 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-05 13:10:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:10:17,947 INFO L225 Difference]: With dead ends: 52 [2019-09-05 13:10:17,947 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 13:10:17,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=286, Invalid=832, Unknown=4, NotChecked=0, Total=1122 [2019-09-05 13:10:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 13:10:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-09-05 13:10:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 13:10:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-05 13:10:17,954 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2019-09-05 13:10:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:10:17,954 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-05 13:10:17,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 13:10:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-05 13:10:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 13:10:17,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:10:17,955 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:10:17,955 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:10:17,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:10:17,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1622573432, now seen corresponding path program 12 times [2019-09-05 13:10:17,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:10:17,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:17,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:10:17,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:17,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:10:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:10:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:18,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:18,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:10:18,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:10:18,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:10:18,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:18,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:10:18,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:10:18,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:10:18,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:10:18,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:10:18,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 13:10:18,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:10:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:18,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:10:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:19,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:10:19,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 32 [2019-09-05 13:10:19,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:10:19,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 13:10:19,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 13:10:19,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-05 13:10:19,224 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 17 states. [2019-09-05 13:10:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:10:19,590 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-09-05 13:10:19,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 13:10:19,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-05 13:10:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:10:19,591 INFO L225 Difference]: With dead ends: 49 [2019-09-05 13:10:19,591 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 13:10:19,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-05 13:10:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 13:10:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-05 13:10:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 13:10:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-05 13:10:19,596 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 46 [2019-09-05 13:10:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:10:19,596 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-05 13:10:19,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 13:10:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-05 13:10:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 13:10:19,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:10:19,597 INFO L399 BasicCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:10:19,597 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:10:19,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:10:19,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1921368907, now seen corresponding path program 13 times [2019-09-05 13:10:19,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:10:19,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:19,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:10:19,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:19,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:10:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:10:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:19,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:19,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:10:19,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:10:19,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:10:19,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:19,831 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-05 13:10:19,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:10:19,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:10:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:10:19,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 13:10:19,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:10:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:19,907 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:10:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 208 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:22,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:10:22,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-05 13:10:22,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:10:22,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 13:10:22,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 13:10:22,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=784, Unknown=1, NotChecked=0, Total=1122 [2019-09-05 13:10:22,911 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 18 states. [2019-09-05 13:10:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:10:23,344 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-09-05 13:10:23,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:10:23,344 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-09-05 13:10:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:10:23,345 INFO L225 Difference]: With dead ends: 51 [2019-09-05 13:10:23,345 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 13:10:23,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=337, Invalid=784, Unknown=1, NotChecked=0, Total=1122 [2019-09-05 13:10:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 13:10:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-05 13:10:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 13:10:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-05 13:10:23,353 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 48 [2019-09-05 13:10:23,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:10:23,354 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-05 13:10:23,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 13:10:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-05 13:10:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 13:10:23,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:10:23,355 INFO L399 BasicCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:10:23,355 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:10:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:10:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1740890958, now seen corresponding path program 14 times [2019-09-05 13:10:23,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:10:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:23,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:10:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:23,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:10:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:10:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:23,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:23,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:10:23,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:10:23,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:10:23,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:23,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:10:23,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:10:23,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:10:23,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 13:10:23,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:10:23,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 13:10:23,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:10:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 25 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 13:10:23,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:10:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 25 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 13:10:24,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:10:24,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 11] total 33 [2019-09-05 13:10:24,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:10:24,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:10:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:10:24,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 13:10:24,382 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 24 states. [2019-09-05 13:10:29,260 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:10:33,257 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:10:47,054 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:11:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:11:01,145 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-05 13:11:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 13:11:01,146 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-05 13:11:01,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:11:01,146 INFO L225 Difference]: With dead ends: 59 [2019-09-05 13:11:01,147 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 13:11:01,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=401, Invalid=1156, Unknown=3, NotChecked=0, Total=1560 [2019-09-05 13:11:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 13:11:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-09-05 13:11:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 13:11:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-09-05 13:11:01,152 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 50 [2019-09-05 13:11:01,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:11:01,152 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-09-05 13:11:01,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:11:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-09-05 13:11:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 13:11:01,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:11:01,153 INFO L399 BasicCegarLoop]: trace histogram [22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:11:01,153 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:11:01,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:11:01,153 INFO L82 PathProgramCache]: Analyzing trace with hash -741259606, now seen corresponding path program 15 times [2019-09-05 13:11:01,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:11:01,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:01,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:11:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:01,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:11:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:11:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:01,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:01,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:11:01,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:11:01,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:11:01,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:01,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:11:01,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:11:01,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:11:01,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:11:01,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:11:01,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 13:11:01,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:11:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:01,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:11:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:03,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:11:03,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 38 [2019-09-05 13:11:03,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:11:03,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 13:11:03,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 13:11:03,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 13:11:03,119 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 20 states. [2019-09-05 13:11:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:11:03,613 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-05 13:11:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 13:11:03,614 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-05 13:11:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:11:03,615 INFO L225 Difference]: With dead ends: 57 [2019-09-05 13:11:03,615 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 13:11:03,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 13:11:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 13:11:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-05 13:11:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 13:11:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-09-05 13:11:03,626 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 54 [2019-09-05 13:11:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:11:03,629 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-09-05 13:11:03,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 13:11:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-09-05 13:11:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 13:11:03,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:11:03,630 INFO L399 BasicCegarLoop]: trace histogram [23, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:11:03,630 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:11:03,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:11:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash -554142489, now seen corresponding path program 16 times [2019-09-05 13:11:03,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:11:03,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:03,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:11:03,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:03,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:11:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:11:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:03,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:03,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:11:03,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:11:03,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:11:03,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:03,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:11:03,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:11:03,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:11:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:11:03,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 13:11:03,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:11:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:04,027 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:11:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:06,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:11:06,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 40 [2019-09-05 13:11:06,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:11:06,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 13:11:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 13:11:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:11:06,119 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 21 states. [2019-09-05 13:11:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:11:06,668 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-09-05 13:11:06,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 13:11:06,668 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-09-05 13:11:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:11:06,669 INFO L225 Difference]: With dead ends: 59 [2019-09-05 13:11:06,669 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 13:11:06,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:11:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 13:11:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-05 13:11:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 13:11:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-09-05 13:11:06,674 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 56 [2019-09-05 13:11:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:11:06,674 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-09-05 13:11:06,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 13:11:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-09-05 13:11:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 13:11:06,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:11:06,675 INFO L399 BasicCegarLoop]: trace histogram [24, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:11:06,675 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:11:06,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:11:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1123219484, now seen corresponding path program 17 times [2019-09-05 13:11:06,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:11:06,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:06,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:11:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:06,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:11:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:11:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 209 proven. 342 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:07,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:07,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:11:07,007 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:11:07,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:11:07,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:07,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:11:07,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:11:07,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:11:07,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-05 13:11:07,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:11:07,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 13:11:07,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:11:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-05 13:11:07,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:11:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-05 13:11:07,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:11:07,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 12] total 38 [2019-09-05 13:11:07,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:11:07,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:11:07,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:11:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1055, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 13:11:07,827 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 28 states. [2019-09-05 13:11:11,198 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:11:21,046 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:11:26,221 WARN L188 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:11:34,459 WARN L188 SmtUtils]: Spent 6.47 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:11:41,624 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:11:57,275 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 13:12:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:12:05,639 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-09-05 13:12:05,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 13:12:05,639 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-05 13:12:05,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:12:05,640 INFO L225 Difference]: With dead ends: 68 [2019-09-05 13:12:05,640 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 13:12:05,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=525, Invalid=1540, Unknown=5, NotChecked=0, Total=2070 [2019-09-05 13:12:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 13:12:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-09-05 13:12:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-05 13:12:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-09-05 13:12:05,648 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 58 [2019-09-05 13:12:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:12:05,648 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-09-05 13:12:05,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:12:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-09-05 13:12:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 13:12:05,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:12:05,649 INFO L399 BasicCegarLoop]: trace histogram [26, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:12:05,650 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:12:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:12:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1126866852, now seen corresponding path program 18 times [2019-09-05 13:12:05,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:12:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:05,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:12:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:05,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:12:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:12:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:06,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:06,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:12:06,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:12:06,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:12:06,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:06,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:12:06,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:12:06,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:12:06,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:12:06,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:12:06,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 13:12:06,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:12:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:06,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:12:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:08,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:12:08,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 44 [2019-09-05 13:12:08,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:12:08,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 13:12:08,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 13:12:08,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1345, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 13:12:08,823 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 23 states. [2019-09-05 13:12:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:12:09,508 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-09-05 13:12:09,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:12:09,511 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-09-05 13:12:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:12:09,512 INFO L225 Difference]: With dead ends: 65 [2019-09-05 13:12:09,512 INFO L226 Difference]: Without dead ends: 65 [2019-09-05 13:12:09,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=547, Invalid=1345, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 13:12:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-05 13:12:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-05 13:12:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 13:12:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-09-05 13:12:09,516 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 62 [2019-09-05 13:12:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:12:09,516 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-09-05 13:12:09,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 13:12:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-09-05 13:12:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 13:12:09,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:12:09,521 INFO L399 BasicCegarLoop]: trace histogram [27, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:12:09,522 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:12:09,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:12:09,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1362952601, now seen corresponding path program 19 times [2019-09-05 13:12:09,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:12:09,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:09,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:12:09,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:09,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:12:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:12:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:09,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:09,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:12:09,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:12:09,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:12:09,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:09,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:12:09,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:12:09,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:12:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:12:09,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 13:12:09,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:12:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:09,988 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:12:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 418 refuted. 2 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:13,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:12:13,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 46 [2019-09-05 13:12:13,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:12:13,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:12:13,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:12:13,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1474, Unknown=1, NotChecked=0, Total=2070 [2019-09-05 13:12:13,970 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 24 states. [2019-09-05 13:12:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:12:14,714 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2019-09-05 13:12:14,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 13:12:14,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-09-05 13:12:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:12:14,716 INFO L225 Difference]: With dead ends: 67 [2019-09-05 13:12:14,716 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 13:12:14,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=595, Invalid=1474, Unknown=1, NotChecked=0, Total=2070 [2019-09-05 13:12:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 13:12:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-05 13:12:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 13:12:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-09-05 13:12:14,720 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 64 [2019-09-05 13:12:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:12:14,720 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-09-05 13:12:14,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:12:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-09-05 13:12:14,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 13:12:14,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:12:14,721 INFO L399 BasicCegarLoop]: trace histogram [28, 21, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:12:14,722 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:12:14,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:12:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1782663062, now seen corresponding path program 20 times [2019-09-05 13:12:14,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:12:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:14,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:12:14,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:14,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:12:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:12:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 286 proven. 462 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:15,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:15,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:12:15,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:12:15,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:12:15,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:15,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:12:15,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:12:15,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:12:16,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 13:12:16,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:12:16,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 13:12:16,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:12:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 49 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 13:12:17,542 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:12:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 46 refuted. 3 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 13:12:34,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:12:34,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 14] total 44 [2019-09-05 13:12:34,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:12:34,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:12:34,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:12:34,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=1411, Unknown=6, NotChecked=0, Total=1892 [2019-09-05 13:12:34,236 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 32 states. [2019-09-05 13:12:36,288 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:12:53,317 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:13:08,653 WARN L188 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:13:19,613 WARN L188 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:13:25,248 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (<= 10000000 (mod (+ c_main_~x~0 4294967294) 4294967296)) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000)) is different from false [2019-09-05 13:13:33,986 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:13:55,926 WARN L188 SmtUtils]: Spent 5.82 s on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-09-05 13:14:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:09,214 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2019-09-05 13:14:09,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 13:14:09,214 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-05 13:14:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:09,215 INFO L225 Difference]: With dead ends: 78 [2019-09-05 13:14:09,215 INFO L226 Difference]: Without dead ends: 78 [2019-09-05 13:14:09,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 116 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 93.4s TimeCoverageRelationStatistics Valid=664, Invalid=2080, Unknown=16, NotChecked=102, Total=2862 [2019-09-05 13:14:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-05 13:14:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-09-05 13:14:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 13:14:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-09-05 13:14:09,219 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 66 [2019-09-05 13:14:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:09,220 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-09-05 13:14:09,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:14:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-09-05 13:14:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 13:14:09,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:09,221 INFO L399 BasicCegarLoop]: trace histogram [30, 22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:09,221 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash -204034418, now seen corresponding path program 21 times [2019-09-05 13:14:09,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:09,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:09,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:09,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:09,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:09,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:09,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:09,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:09,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:09,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:09,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:09,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:09,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:09,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:09,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:09,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 13:14:09,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:09,768 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 504 refuted. 2 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:14,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:14,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 50 [2019-09-05 13:14:14,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:14,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 13:14:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 13:14:14,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=1752, Unknown=1, NotChecked=0, Total=2450 [2019-09-05 13:14:14,512 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 26 states. [2019-09-05 13:14:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:15,356 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2019-09-05 13:14:15,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 13:14:15,356 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2019-09-05 13:14:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:15,357 INFO L225 Difference]: With dead ends: 77 [2019-09-05 13:14:15,357 INFO L226 Difference]: Without dead ends: 77 [2019-09-05 13:14:15,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=697, Invalid=1752, Unknown=1, NotChecked=0, Total=2450 [2019-09-05 13:14:15,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-05 13:14:15,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-09-05 13:14:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-05 13:14:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-09-05 13:14:15,361 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 70 [2019-09-05 13:14:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:15,361 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-09-05 13:14:15,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 13:14:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-09-05 13:14:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 13:14:15,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:15,362 INFO L399 BasicCegarLoop]: trace histogram [31, 23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:15,362 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:15,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:15,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1889811765, now seen corresponding path program 22 times [2019-09-05 13:14:15,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:15,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:15,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:15,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:15,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:15,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:15,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:15,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:15,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:15,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:15,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:15,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:15,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:14:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:15,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 13:14:15,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:15,924 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 544 refuted. 8 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:27,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:27,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 52 [2019-09-05 13:14:27,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:27,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 13:14:27,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 13:14:27,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1897, Unknown=4, NotChecked=0, Total=2652 [2019-09-05 13:14:27,821 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 27 states. [2019-09-05 13:14:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:28,881 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-09-05 13:14:28,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 13:14:28,882 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-09-05 13:14:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:28,883 INFO L225 Difference]: With dead ends: 79 [2019-09-05 13:14:28,883 INFO L226 Difference]: Without dead ends: 79 [2019-09-05 13:14:28,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=751, Invalid=1897, Unknown=4, NotChecked=0, Total=2652 [2019-09-05 13:14:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-05 13:14:28,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-09-05 13:14:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 13:14:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-09-05 13:14:28,889 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 72 [2019-09-05 13:14:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:28,889 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-09-05 13:14:28,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 13:14:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-09-05 13:14:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-05 13:14:28,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:28,891 INFO L399 BasicCegarLoop]: trace histogram [32, 24, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:28,891 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1575795656, now seen corresponding path program 23 times [2019-09-05 13:14:28,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:28,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:28,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:28,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:28,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 375 proven. 600 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:29,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:29,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:29,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:29,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:29,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:29,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:29,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:29,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:14:57,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 13:14:57,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:58,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 13:14:58,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 64 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-05 13:14:58,435 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 64 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-05 13:14:59,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:59,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 14] total 48 [2019-09-05 13:14:59,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:59,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 13:14:59,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 13:14:59,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=1697, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 13:14:59,082 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 36 states. [2019-09-05 13:15:13,372 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 13:15:30,348 WARN L188 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:15:48,161 WARN L188 SmtUtils]: Spent 9.17 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:16:11,034 WARN L188 SmtUtils]: Spent 8.92 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:16:20,914 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:16:31,825 WARN L188 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:16:41,896 WARN L188 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-09-05 13:17:01,805 WARN L188 SmtUtils]: Spent 8.56 s on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-09-05 13:17:19,921 WARN L188 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:18:12,968 WARN L188 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:18:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:12,992 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-09-05 13:18:12,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 13:18:12,994 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-05 13:18:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:12,995 INFO L225 Difference]: With dead ends: 91 [2019-09-05 13:18:12,995 INFO L226 Difference]: Without dead ends: 91 [2019-09-05 13:18:12,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 134 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 156.4s TimeCoverageRelationStatistics Valid=939, Invalid=2703, Unknown=18, NotChecked=0, Total=3660 [2019-09-05 13:18:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-05 13:18:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2019-09-05 13:18:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-05 13:18:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2019-09-05 13:18:12,999 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 74 [2019-09-05 13:18:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:12,999 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2019-09-05 13:18:12,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 13:18:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2019-09-05 13:18:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 13:18:13,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:13,000 INFO L399 BasicCegarLoop]: trace histogram [34, 25, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:13,001 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1804529344, now seen corresponding path program 24 times [2019-09-05 13:18:13,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:13,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:13,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:13,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:13,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:13,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:13,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:18:13,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:13,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:13,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:13,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:13,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:18:13,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:18:13,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:18:13,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:18:13,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 13:18:13,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:13,641 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:18,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:18:18,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 56 [2019-09-05 13:18:18,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:18,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 13:18:18,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 13:18:18,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:18:18,500 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 29 states. [2019-09-05 13:18:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:19,644 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2019-09-05 13:18:19,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 13:18:19,645 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2019-09-05 13:18:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:19,647 INFO L225 Difference]: With dead ends: 85 [2019-09-05 13:18:19,647 INFO L226 Difference]: Without dead ends: 85 [2019-09-05 13:18:19,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:18:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-05 13:18:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-09-05 13:18:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-05 13:18:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2019-09-05 13:18:19,651 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 78 [2019-09-05 13:18:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:19,651 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2019-09-05 13:18:19,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 13:18:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2019-09-05 13:18:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 13:18:19,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:19,652 INFO L399 BasicCegarLoop]: trace histogram [35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:19,652 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:19,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2014275459, now seen corresponding path program 25 times [2019-09-05 13:18:19,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:19,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:19,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:19,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:19,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:20,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:20,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:18:20,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:20,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:20,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:20,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:20,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:20,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:18:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:20,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 13:18:20,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:20,282 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 700 refuted. 2 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:26,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:18:26,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 30] total 58 [2019-09-05 13:18:26,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:26,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 13:18:26,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 13:18:26,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=925, Invalid=2380, Unknown=1, NotChecked=0, Total=3306 [2019-09-05 13:18:26,082 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 30 states. [2019-09-05 13:18:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:27,315 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2019-09-05 13:18:27,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 13:18:27,316 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2019-09-05 13:18:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:27,317 INFO L225 Difference]: With dead ends: 87 [2019-09-05 13:18:27,317 INFO L226 Difference]: Without dead ends: 87 [2019-09-05 13:18:27,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=925, Invalid=2380, Unknown=1, NotChecked=0, Total=3306 [2019-09-05 13:18:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-05 13:18:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-09-05 13:18:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-05 13:18:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2019-09-05 13:18:27,323 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 80 [2019-09-05 13:18:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:27,323 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2019-09-05 13:18:27,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 13:18:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2019-09-05 13:18:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-05 13:18:27,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:27,324 INFO L399 BasicCegarLoop]: trace histogram [36, 27, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:27,324 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:27,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1716829062, now seen corresponding path program 26 times [2019-09-05 13:18:27,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:27,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:27,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:27,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:27,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 476 proven. 756 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:28,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:28,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:18:28,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:28,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:28,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:28,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:28,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:18:28,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:19:24,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-05 13:19:24,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:19:24,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 13:19:24,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 74 refuted. 7 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-05 13:19:41,951 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:19:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 81 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-05 13:19:49,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:19:49,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12, 16] total 54 [2019-09-05 13:19:49,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:19:49,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 13:19:49,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 13:19:49,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=2189, Unknown=6, NotChecked=0, Total=2862 [2019-09-05 13:19:49,340 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 40 states. [2019-09-05 13:19:53,484 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:20:13,710 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:20:34,296 WARN L188 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:20:49,971 WARN L188 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 13:21:23,239 WARN L188 SmtUtils]: Spent 6.88 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-09-05 13:21:54,196 WARN L188 SmtUtils]: Spent 5.99 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:22:11,618 WARN L188 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:22:26,027 WARN L188 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:22:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:39,094 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2019-09-05 13:22:39,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 13:22:39,095 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 82 [2019-09-05 13:22:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:39,095 INFO L225 Difference]: With dead ends: 92 [2019-09-05 13:22:39,095 INFO L226 Difference]: Without dead ends: 92 [2019-09-05 13:22:39,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 165.6s TimeCoverageRelationStatistics Valid=884, Invalid=3118, Unknown=30, NotChecked=0, Total=4032 [2019-09-05 13:22:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-05 13:22:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-09-05 13:22:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-05 13:22:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-05 13:22:39,099 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 82 [2019-09-05 13:22:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:39,099 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-05 13:22:39,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 13:22:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-05 13:22:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-05 13:22:39,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:39,100 INFO L399 BasicCegarLoop]: trace histogram [38, 28, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:39,100 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1002989682, now seen corresponding path program 27 times [2019-09-05 13:22:39,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:39,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:22:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:39,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 551 proven. 812 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:22:39,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:39,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:22:39,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:22:39,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:22:39,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:39,690 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:22:39,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:22:39,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:22:39,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:22:39,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:22:39,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-05 13:22:39,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:22:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 551 proven. 812 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:22:39,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:22:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 551 proven. 810 refuted. 2 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:22:46,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:22:46,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 32] total 62 [2019-09-05 13:22:46,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:22:46,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:22:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:22:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=2730, Unknown=1, NotChecked=0, Total=3782 [2019-09-05 13:22:46,338 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 32 states. [2019-09-05 13:22:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:47,764 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-09-05 13:22:47,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 13:22:47,764 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 86 [2019-09-05 13:22:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:47,765 INFO L225 Difference]: With dead ends: 90 [2019-09-05 13:22:47,765 INFO L226 Difference]: Without dead ends: 90 [2019-09-05 13:22:47,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1051, Invalid=2730, Unknown=1, NotChecked=0, Total=3782 [2019-09-05 13:22:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-05 13:22:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-09-05 13:22:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-05 13:22:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-09-05 13:22:47,768 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 86 [2019-09-05 13:22:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:47,768 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-09-05 13:22:47,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:22:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-09-05 13:22:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-05 13:22:47,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:47,769 INFO L399 BasicCegarLoop]: trace histogram [39, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:47,769 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1424006481, now seen corresponding path program 28 times [2019-09-05 13:22:47,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:47,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:47,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:22:47,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:47,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 570 proven. 870 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:22:48,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:48,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:22:48,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:22:48,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:22:48,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:48,478 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:22:48,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:48,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:22:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:48,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 13:22:48,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:22:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 570 proven. 870 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:22:48,606 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:22:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 570 proven. 868 refuted. 2 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:22:55,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:22:55,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 64 [2019-09-05 13:22:55,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:22:55,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 13:22:55,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 13:22:55,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=2914, Unknown=1, NotChecked=0, Total=4032 [2019-09-05 13:22:55,225 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 33 states. [2019-09-05 13:22:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:56,708 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-09-05 13:22:56,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 13:22:56,708 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 88 [2019-09-05 13:22:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:56,710 INFO L225 Difference]: With dead ends: 92 [2019-09-05 13:22:56,710 INFO L226 Difference]: Without dead ends: 92 [2019-09-05 13:22:56,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1117, Invalid=2914, Unknown=1, NotChecked=0, Total=4032 [2019-09-05 13:22:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-05 13:22:56,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-09-05 13:22:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-05 13:22:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-09-05 13:22:56,714 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 88 [2019-09-05 13:22:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:56,715 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-09-05 13:22:56,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 13:22:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-09-05 13:22:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-05 13:22:56,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:56,716 INFO L399 BasicCegarLoop]: trace histogram [40, 30, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:56,716 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:56,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1600077396, now seen corresponding path program 29 times [2019-09-05 13:22:56,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:56,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:56,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:56,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:56,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 589 proven. 930 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:22:57,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:57,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:22:57,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:22:57,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:22:57,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:57,370 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:22:57,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:22:57,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)