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/loop-acceleration/simple_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:49:53,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:49:53,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:49:53,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:49:53,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:49:53,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:49:53,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:49:53,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:49:53,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:49:53,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:49:53,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:49:53,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:49:53,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:49:53,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:49:53,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:49:53,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:49:53,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:49:53,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:49:53,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:49:53,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:49:53,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:49:53,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:49:53,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:49:53,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:49:53,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:49:53,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:49:53,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:49:53,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:49:53,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:49:53,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:49:53,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:49:53,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:49:53,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:49:53,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:49:53,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:49:53,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:49:53,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:49:53,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:49:53,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:49:53,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:49:53,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:49:53,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:49:53,972 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:49:53,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:49:53,973 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:49:53,974 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:49:53,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:49:53,974 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:49:53,975 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:49:53,975 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:49:53,975 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:49:53,975 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:49:53,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:49:53,977 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:49:53,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:49:53,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:49:53,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:49:53,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:49:53,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:49:53,978 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:49:53,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:49:53,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:49:53,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:49:53,979 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:49:53,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:49:53,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:49:53,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:49:53,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:49:53,980 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:49:53,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:49:53,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:49:53,981 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:49:54,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:49:54,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:49:54,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:49:54,051 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:49:54,052 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:49:54,052 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-2.c [2019-09-03 20:49:54,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4338d5e2/e6063399acb24dbfb57c6ec273ad567d/FLAG44c5cc291 [2019-09-03 20:49:54,553 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:49:54,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-2.c [2019-09-03 20:49:54,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4338d5e2/e6063399acb24dbfb57c6ec273ad567d/FLAG44c5cc291 [2019-09-03 20:49:54,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4338d5e2/e6063399acb24dbfb57c6ec273ad567d [2019-09-03 20:49:54,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:49:54,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:49:54,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:49:54,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:49:54,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:49:54,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:49:54" (1/1) ... [2019-09-03 20:49:54,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69700df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:54, skipping insertion in model container [2019-09-03 20:49:54,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:49:54" (1/1) ... [2019-09-03 20:49:54,949 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:49:54,963 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:49:55,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:49:55,119 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:49:55,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:49:55,148 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:49:55,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:55 WrapperNode [2019-09-03 20:49:55,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:49:55,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:49:55,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:49:55,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:49:55,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:55" (1/1) ... [2019-09-03 20:49:55,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:55" (1/1) ... [2019-09-03 20:49:55,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:55" (1/1) ... [2019-09-03 20:49:55,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:55" (1/1) ... [2019-09-03 20:49:55,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:55" (1/1) ... [2019-09-03 20:49:55,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:55" (1/1) ... [2019-09-03 20:49:55,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:55" (1/1) ... [2019-09-03 20:49:55,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:49:55,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:49:55,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:49:55,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:49:55,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:49:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:49:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:49:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:49:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:49:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:49:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:49:55,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:49:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:49:55,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:49:55,480 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:49:55,481 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:49:55,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:49:55 BoogieIcfgContainer [2019-09-03 20:49:55,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:49:55,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:49:55,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:49:55,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:49:55,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:49:54" (1/3) ... [2019-09-03 20:49:55,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7931ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:49:55, skipping insertion in model container [2019-09-03 20:49:55,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:49:55" (2/3) ... [2019-09-03 20:49:55,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7931ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:49:55, skipping insertion in model container [2019-09-03 20:49:55,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:49:55" (3/3) ... [2019-09-03 20:49:55,489 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_1-2.c [2019-09-03 20:49:55,498 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:49:55,504 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:49:55,517 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:49:55,543 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:49:55,543 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:49:55,543 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:49:55,544 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:49:55,544 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:49:55,544 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:49:55,544 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:49:55,544 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:49:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-03 20:49:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:49:55,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:55,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:55,570 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:55,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-03 20:49:55,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:55,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:55,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:49:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:55,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:55,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:49:55,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:49:55,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:49:55,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:49:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:49:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:49:55,811 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-03 20:49:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:55,856 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 20:49:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:49:55,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:49:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:55,868 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:49:55,869 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:49:55,871 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-03 20:49:55,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:49:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:49:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:49:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 20:49:55,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 20:49:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:55,904 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 20:49:55,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:49:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 20:49:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:49:55,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:55,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:55,905 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:55,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:55,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-03 20:49:55,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:55,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:55,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:49:55,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:55,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:56,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:56,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:49:56,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-09-03 20:49:56,014 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2019-09-03 20:49:56,044 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:49:56,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:49:56,093 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:49:56,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:49:56,590 INFO L272 AbstractInterpreter]: Visited 11 different actions 41 times. Merged at 2 different actions 10 times. Widened at 1 different actions 3 times. Performed 55 root evaluator evaluations with a maximum evaluation depth of 13. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-03 20:49:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:56,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:49:56,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:56,595 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) [2019-09-03 20:49:56,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:49:56,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:49:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:56,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:49:56,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:49:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:56,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:49:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:56,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:49:56,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-03 20:49:56,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:49:56,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:49:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:49:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:49:56,743 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-03 20:49:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:56,767 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-09-03 20:49:56,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:49:56,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-03 20:49:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:56,770 INFO L225 Difference]: With dead ends: 13 [2019-09-03 20:49:56,770 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 20:49:56,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:49:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 20:49:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 20:49:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 20:49:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 20:49:56,779 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-03 20:49:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:56,780 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 20:49:56,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:49:56,781 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 20:49:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:49:56,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:56,783 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:56,784 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-03 20:49:56,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:56,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:56,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:49:56,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:56,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:56,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:56,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:49:56,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:49:56,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:49:56,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:56,937 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) [2019-09-03 20:49:56,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:49:56,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:49:56,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:49:56,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:49:56,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:49:56,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:49:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:56,992 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:49:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:57,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:49:57,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-03 20:49:57,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:49:57,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:49:57,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:49:57,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:49:57,068 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-03 20:49:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:57,097 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-03 20:49:57,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:49:57,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-03 20:49:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:57,099 INFO L225 Difference]: With dead ends: 14 [2019-09-03 20:49:57,099 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:49:57,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:49:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:49:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 20:49:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 20:49:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-03 20:49:57,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-03 20:49:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:57,104 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-03 20:49:57,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:49:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-03 20:49:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:49:57,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:57,105 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:57,105 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:57,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:57,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-03 20:49:57,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:57,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:57,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:49:57,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:57,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:57,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:57,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:49:57,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:49:57,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:49:57,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:57,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:49:57,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:49:57,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:49:57,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:49:57,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:49:57,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:49:57,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:49:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:57,300 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:49:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:57,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:49:57,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-03 20:49:57,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:49:57,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:49:57,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:49:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:49:57,392 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-03 20:49:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:57,437 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-09-03 20:49:57,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:49:57,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 20:49:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:57,439 INFO L225 Difference]: With dead ends: 15 [2019-09-03 20:49:57,439 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 20:49:57,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:49:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 20:49:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 20:49:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 20:49:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 20:49:57,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-03 20:49:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:57,445 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 20:49:57,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:49:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 20:49:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:49:57,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:57,446 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:57,447 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:57,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-03 20:49:57,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:57,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:49:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:57,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:57,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:57,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:49:57,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:49:57,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:49:57,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:57,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:49:57,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:49:57,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:49:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:57,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:49:57,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:49:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:57,660 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:49:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:57,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:49:57,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 20:49:57,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:49:57,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:49:57,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:49:57,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:49:57,811 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-03 20:49:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:57,862 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-03 20:49:57,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:49:57,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-03 20:49:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:57,863 INFO L225 Difference]: With dead ends: 16 [2019-09-03 20:49:57,864 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:49:57,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:49:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:49:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:49:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:49:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-03 20:49:57,867 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-03 20:49:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:57,867 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-03 20:49:57,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:49:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-03 20:49:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:49:57,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:57,868 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:57,868 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-03 20:49:57,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:57,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:57,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:49:57,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:57,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:58,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:58,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:49:58,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:49:58,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:49:58,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:58,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:49:58,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:49:58,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:49:58,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:49:58,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:49:58,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:49:58,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:49:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:58,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:49:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:58,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:49:58,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-03 20:49:58,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:49:58,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:49:58,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:49:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:49:58,269 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-03 20:49:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:58,331 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-09-03 20:49:58,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:49:58,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-03 20:49:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:58,332 INFO L225 Difference]: With dead ends: 17 [2019-09-03 20:49:58,332 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 20:49:58,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:49:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 20:49:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 20:49:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:49:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 20:49:58,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-03 20:49:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:58,336 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 20:49:58,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:49:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 20:49:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:49:58,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:58,337 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:58,337 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:58,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:58,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-03 20:49:58,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:58,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:49:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:58,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:58,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:58,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:49:58,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:49:58,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:49:58,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:58,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:49:58,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:49:58,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:49:58,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:49:58,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:49:58,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:49:58,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:49:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:58,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:49:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:58,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:49:58,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-03 20:49:58,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:49:58,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:49:58,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:49:58,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:49:58,696 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-03 20:49:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:58,754 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 20:49:58,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:49:58,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-03 20:49:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:58,756 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:49:58,756 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:49:58,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:49:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:49:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 20:49:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 20:49:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-03 20:49:58,759 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-03 20:49:58,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:58,760 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-03 20:49:58,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:49:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-03 20:49:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:49:58,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:58,761 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:58,761 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-03 20:49:58,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:58,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:58,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:49:58,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:58,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:58,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:58,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:49:58,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:49:58,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:49:58,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:58,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:49:58,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:49:58,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:49:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:58,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:49:58,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:49:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:58,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:49:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:59,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:49:59,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-03 20:49:59,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:49:59,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:49:59,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:49:59,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:49:59,232 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-03 20:49:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:59,322 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 20:49:59,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:49:59,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-03 20:49:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:59,324 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:49:59,325 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:49:59,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:49:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:49:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 20:49:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:49:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 20:49:59,328 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-03 20:49:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:59,329 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 20:49:59,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:49:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 20:49:59,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:49:59,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:59,331 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:59,332 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:59,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:59,332 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-03 20:49:59,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:59,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:59,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:49:59,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:59,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:49:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:59,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:59,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:49:59,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:49:59,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:49:59,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:49:59,498 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-03 20:49:59,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:49:59,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:49:59,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 20:49:59,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:49:59,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:49:59,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:49:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:59,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:49:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:49:59,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:49:59,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-03 20:49:59,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:49:59,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:49:59,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:49:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:49:59,834 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-03 20:49:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:49:59,931 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 20:49:59,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:49:59,932 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-03 20:49:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:49:59,933 INFO L225 Difference]: With dead ends: 20 [2019-09-03 20:49:59,933 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 20:49:59,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:49:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 20:49:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-03 20:49:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:49:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-03 20:49:59,938 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-03 20:49:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:49:59,938 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-03 20:49:59,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:49:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-03 20:49:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:49:59,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:49:59,939 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:49:59,939 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:49:59,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:49:59,940 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-03 20:49:59,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:49:59,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:59,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:49:59,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:49:59,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:49:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:00,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:00,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:00,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:00,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:00,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:00,081 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-03 20:50:00,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:50:00,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:50:00,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:50:00,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:00,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:50:00,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:00,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:00,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:00,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-03 20:50:00,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:00,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:50:00,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:50:00,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:50:00,440 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-03 20:50:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:00,576 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-03 20:50:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:50:00,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-03 20:50:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:00,580 INFO L225 Difference]: With dead ends: 21 [2019-09-03 20:50:00,580 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 20:50:00,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:50:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 20:50:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 20:50:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:50:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 20:50:00,583 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-03 20:50:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:00,583 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 20:50:00,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:50:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 20:50:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:50:00,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:00,584 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:00,585 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-03 20:50:00,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:00,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:00,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:00,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:00,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:00,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:00,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:00,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:00,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:00,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:00,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:50:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:00,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:50:00,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:00,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:01,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:01,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-03 20:50:01,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:01,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:50:01,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:50:01,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:50:01,160 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-03 20:50:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:01,300 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 20:50:01,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:50:01,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-03 20:50:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:01,303 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:50:01,303 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:50:01,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:50:01,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:50:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 20:50:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:50:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-03 20:50:01,307 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-03 20:50:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:01,307 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-03 20:50:01,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:50:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-03 20:50:01,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:50:01,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:01,308 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:01,308 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:01,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:01,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-03 20:50:01,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:01,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:01,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:01,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:01,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:01,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:01,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:01,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:01,482 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-03 20:50:01,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:50:01,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:50:31,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 20:50:31,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:31,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:50:31,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:31,530 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-03 20:50:31,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:31,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:50:31,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:50:31,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:50:31,912 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-03 20:50:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:32,098 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-03 20:50:32,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:50:32,100 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-03 20:50:32,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:32,100 INFO L225 Difference]: With dead ends: 23 [2019-09-03 20:50:32,100 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:50:32,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:50:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:50:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 20:50:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:50:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 20:50:32,104 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-03 20:50:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:32,104 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 20:50:32,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:50:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 20:50:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:50:32,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:32,105 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:32,106 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:32,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:32,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-03 20:50:32,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:32,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:32,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:32,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:32,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:32,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:32,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:32,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:32,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:32,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:32,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:32,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:50:32,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:50:32,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:50:32,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:32,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:50:32,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:32,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:32,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:32,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-03 20:50:32,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:32,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:50:32,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:50:32,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:50:32,793 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-03 20:50:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:32,983 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 20:50:32,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:50:32,984 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-03 20:50:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:32,985 INFO L225 Difference]: With dead ends: 24 [2019-09-03 20:50:32,985 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:50:32,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:50:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:50:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 20:50:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:50:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-03 20:50:32,989 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-03 20:50:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:32,990 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-03 20:50:32,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:50:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-03 20:50:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:50:32,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:32,991 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:32,991 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:32,991 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-03 20:50:32,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:32,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:32,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:32,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:32,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:33,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:33,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:33,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:33,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:33,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:33,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:33,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:33,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:50:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:33,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:50:33,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:33,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:33,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:33,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-03 20:50:33,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:33,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:50:33,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:50:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:50:33,794 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-03 20:50:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:34,011 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-03 20:50:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:50:34,014 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-03 20:50:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:34,014 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:50:34,014 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:50:34,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:50:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:50:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 20:50:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:50:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 20:50:34,018 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-03 20:50:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:34,018 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 20:50:34,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:50:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 20:50:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:50:34,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:34,019 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:34,020 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:34,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:34,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-03 20:50:34,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:34,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:34,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:34,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:34,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:34,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:34,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:34,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:34,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:34,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:50:34,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:50:46,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:50:46,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:46,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:50:46,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:46,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:47,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:47,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-03 20:50:47,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:47,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:50:47,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:50:47,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:50:47,399 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-03 20:50:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:47,669 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 20:50:47,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:50:47,671 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-03 20:50:47,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:47,672 INFO L225 Difference]: With dead ends: 26 [2019-09-03 20:50:47,672 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:50:47,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:50:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:50:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 20:50:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 20:50:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-03 20:50:47,675 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-03 20:50:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:47,676 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-03 20:50:47,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:50:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-03 20:50:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 20:50:47,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:47,677 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:47,677 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:47,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:47,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-03 20:50:47,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:47,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:47,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:47,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:47,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:47,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:47,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:47,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:47,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:47,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:47,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:50:47,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:50:47,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:50:47,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:47,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:50:47,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:48,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:48,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:48,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-03 20:50:48,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:48,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:50:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:50:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:50:48,621 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-03 20:50:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:48,879 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 20:50:48,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:50:48,880 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-03 20:50:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:48,881 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:50:48,881 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:50:48,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:50:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:50:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 20:50:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:50:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 20:50:48,884 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-03 20:50:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:48,884 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 20:50:48,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:50:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 20:50:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:50:48,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:48,885 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:48,886 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:48,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-03 20:50:48,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:48,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:48,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:49,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:49,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:49,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:49,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:49,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:49,162 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-03 20:50:49,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:49,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:50:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:49,184 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:50:49,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:49,226 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:49,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:49,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-03 20:50:49,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:49,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:50:49,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:50:49,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:50:49,903 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-03 20:50:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:50,173 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 20:50:50,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:50:50,174 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-03 20:50:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:50,175 INFO L225 Difference]: With dead ends: 28 [2019-09-03 20:50:50,175 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:50:50,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:50:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:50:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 20:50:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:50:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-03 20:50:50,178 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-03 20:50:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:50,179 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-03 20:50:50,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:50:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-03 20:50:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:50:50,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:50,180 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:50,180 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-03 20:50:50,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:50,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:50:50,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:50,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:50,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:50,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:50,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:50,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:50,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:50:50,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:51:02,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:51:02,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:51:02,876 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:51:02,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:02,912 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:03,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:03,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-03 20:51:03,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:03,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:51:03,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:51:03,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:51:03,907 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-03 20:51:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:04,238 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-03 20:51:04,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:51:04,243 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-03 20:51:04,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:04,244 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:51:04,244 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:51:04,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:51:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:51:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 20:51:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:51:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 20:51:04,247 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-03 20:51:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:04,247 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 20:51:04,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:51:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 20:51:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:51:04,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:04,248 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:04,249 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-03 20:51:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:04,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:51:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:04,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:04,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:04,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:04,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:04,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:51:04,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:04,611 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) [2019-09-03 20:51:04,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:51:04,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:51:04,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:51:04,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:51:04,656 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:51:04,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:04,734 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:06,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:06,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-03 20:51:06,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:06,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:51:06,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:51:06,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:51:06,014 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-03 20:51:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:06,387 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 20:51:06,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:51:06,387 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-03 20:51:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:06,388 INFO L225 Difference]: With dead ends: 30 [2019-09-03 20:51:06,388 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:51:06,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:51:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:51:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 20:51:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:51:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-03 20:51:06,393 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-03 20:51:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:06,393 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-03 20:51:06,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:51:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-03 20:51:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:51:06,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:06,394 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:06,394 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:06,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:06,394 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-03 20:51:06,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:06,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:06,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:51:06,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:06,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:06,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:06,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:06,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:06,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:51:06,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:06,745 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-03 20:51:06,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:06,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:51:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:06,776 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:51:06,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:06,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:07,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:07,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-03 20:51:07,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:07,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:51:07,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:51:07,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:51:07,723 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-03 20:51:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:08,116 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-03 20:51:08,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:51:08,117 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-03 20:51:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:08,118 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:51:08,118 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:51:08,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:51:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:51:08,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 20:51:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:51:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 20:51:08,123 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-03 20:51:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:08,123 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 20:51:08,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:51:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 20:51:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:51:08,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:08,124 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:08,124 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:08,125 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-03 20:51:08,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:08,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:08,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:08,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:08,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:08,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:08,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:08,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:08,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:51:08,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:08,542 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) [2019-09-03 20:51:08,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:51:08,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:51:52,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:51:52,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:51:52,250 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:51:52,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:52,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:53,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:53,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-03 20:51:53,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:53,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:51:53,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:51:53,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:51:53,308 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-03 20:51:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:53,735 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 20:51:53,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:51:53,736 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-03 20:51:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:53,737 INFO L225 Difference]: With dead ends: 32 [2019-09-03 20:51:53,737 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:51:53,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:51:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:51:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 20:51:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:51:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-03 20:51:53,741 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-03 20:51:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:53,741 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-03 20:51:53,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:51:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-03 20:51:53,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:51:53,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:53,742 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:53,742 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:53,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:53,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-03 20:51:53,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:53,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:53,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:51:53,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:53,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:54,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:54,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:54,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:54,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:51:54,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:54,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:51:54,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:51:54,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:51:54,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:51:54,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:51:54,160 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:51:54,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:54,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:51:55,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:55,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-03 20:51:55,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:55,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:51:55,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:51:55,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:51:55,301 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-03 20:51:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:55,794 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-03 20:51:55,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:51:55,797 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-03 20:51:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:55,798 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:51:55,798 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:51:55,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:51:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:51:55,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 20:51:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:51:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 20:51:55,805 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-03 20:51:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:55,807 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 20:51:55,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:51:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 20:51:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:51:55,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:55,808 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:55,808 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:55,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-03 20:51:55,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:51:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:56,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:56,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:56,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:56,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:51:56,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:56,264 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-03 20:51:56,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:56,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:51:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:56,296 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:51:56,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:56,341 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:58,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:58,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-03 20:51:58,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:58,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:51:58,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:51:58,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:51:58,990 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-03 20:51:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:59,490 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 20:51:59,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:51:59,490 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-03 20:51:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:59,491 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:51:59,491 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:51:59,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:51:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:51:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-03 20:51:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:51:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-03 20:51:59,496 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-03 20:51:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:59,496 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-03 20:51:59,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:51:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-03 20:51:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 20:51:59,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:59,497 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:59,497 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:59,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:59,497 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-03 20:51:59,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:59,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:59,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:59,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:59,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:51:59,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:59,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:51:59,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:51:59,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:45,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:53:45,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:47,009 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:53:47,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:47,055 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:48,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:48,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-03 20:53:48,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:48,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:53:48,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:53:48,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:53:48,403 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-03 20:53:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:48,925 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-03 20:53:48,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:53:48,925 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-03 20:53:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:48,926 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:53:48,926 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:53:48,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:53:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:53:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 20:53:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:53:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 20:53:48,933 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-03 20:53:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:48,933 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 20:53:48,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:53:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 20:53:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:53:48,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:48,934 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:48,935 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:48,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:48,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-03 20:53:48,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:48,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:48,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:48,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:48,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:49,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:49,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:49,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:49,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:49,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:49,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:49,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:49,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:49,463 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:53:49,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:49,510 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:51,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:51,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-03 20:53:51,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:51,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:53:51,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:53:51,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:53:51,004 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-03 20:53:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:51,592 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 20:53:51,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:53:51,593 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-03 20:53:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:51,594 INFO L225 Difference]: With dead ends: 36 [2019-09-03 20:53:51,594 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 20:53:51,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:53:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 20:53:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-03 20:53:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:53:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-03 20:53:51,599 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-03 20:53:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:51,599 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-03 20:53:51,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:53:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-03 20:53:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 20:53:51,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:51,600 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:51,600 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-03 20:53:51,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:51,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:51,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:51,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:51,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:52,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:52,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:52,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:52,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:52,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:52,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:52,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:52,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:52,125 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:53:52,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:52,164 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:53,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:53,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-03 20:53:53,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:53,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:53:53,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:53:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:53:53,829 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-03 20:53:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:54,457 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-03 20:53:54,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:53:54,458 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-03 20:53:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:54,458 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:53:54,458 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:53:54,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:53:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:53:54,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 20:53:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:53:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 20:53:54,461 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-03 20:53:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:54,462 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 20:53:54,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:53:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 20:53:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:53:54,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:54,463 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:54,463 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:54,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:54,463 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-03 20:53:54,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:54,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:54,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:54,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:54,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:54,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:54,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:54,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:54,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:54,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:55,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:55,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:53,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:55:53,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:53,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 20:55:53,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:54,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:55,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:55,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-03 20:55:55,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:55,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:55:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:55:55,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:55:55,711 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-03 20:55:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:56,378 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 20:55:56,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:55:56,379 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-03 20:55:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:56,379 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:55:56,380 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:55:56,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:55:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:55:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-03 20:55:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 20:55:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-03 20:55:56,384 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-03 20:55:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:56,385 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-03 20:55:56,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:55:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-03 20:55:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 20:55:56,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:56,385 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:56,386 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-03 20:55:56,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:56,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:56,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:56,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:56,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:56,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:56,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:56,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:56,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:56,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:56,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:56,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:56,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:56,974 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 20:55:56,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:57,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:58,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:58,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-03 20:55:58,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:58,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:55:58,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:55:58,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:55:58,857 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-03 20:55:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:59,540 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-03 20:55:59,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:55:59,541 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-03 20:55:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:59,541 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:55:59,542 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 20:55:59,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:55:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 20:55:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-03 20:55:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:55:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 20:55:59,545 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-03 20:55:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:59,545 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 20:55:59,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:55:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 20:55:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:55:59,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:59,546 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:59,546 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:59,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:59,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-03 20:55:59,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:59,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:59,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:59,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:59,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:00,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:00,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:00,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:00,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:00,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:00,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:00,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:00,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:00,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 20:56:00,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:00,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:02,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:02,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-03 20:56:02,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:02,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:56:02,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:56:02,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:56:02,382 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-03 20:56:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:03,155 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 20:56:03,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:56:03,155 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-03 20:56:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:03,156 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:56:03,156 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:56:03,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:56:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:56:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 20:56:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:56:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-03 20:56:03,160 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-03 20:56:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:03,160 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-03 20:56:03,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:56:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-03 20:56:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 20:56:03,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:03,161 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:03,161 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:03,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:03,162 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-03 20:56:03,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:03,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:03,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:03,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:03,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:03,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:03,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:03,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:03,783 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-03 20:56:03,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:03,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:04,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:57:04,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:04,579 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 20:57:04,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:04,624 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:06,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:06,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-03 20:57:06,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:06,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:57:06,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:57:06,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:57:06,741 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-03 20:57:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:07,551 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-03 20:57:07,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:57:07,551 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-03 20:57:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:07,552 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:57:07,552 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:57:07,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:57:07,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:57:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 20:57:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:57:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 20:57:07,556 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-03 20:57:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:07,557 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 20:57:07,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:57:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 20:57:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:57:07,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:07,558 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:07,558 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:07,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-03 20:57:07,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:07,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:07,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:08,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:08,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:08,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:08,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:08,701 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-03 20:57:08,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:08,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:08,758 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:08,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:08,760 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:57:08,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:11,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:11,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-03 20:57:11,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:11,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:57:11,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:57:11,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:57:11,457 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-03 20:57:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:12,309 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 20:57:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:57:12,309 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-03 20:57:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:12,310 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:57:12,310 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:57:12,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:57:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:57:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 20:57:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:57:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-03 20:57:12,313 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-03 20:57:12,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:12,313 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-03 20:57:12,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:57:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-03 20:57:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:57:12,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:12,314 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:12,314 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:12,314 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-03 20:57:12,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:12,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:12,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:12,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:12,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:13,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:13,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:13,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:13,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:13,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:13,019 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-03 20:57:13,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:13,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:13,055 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 20:57:13,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:13,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:15,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:15,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-03 20:57:15,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:15,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:57:15,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:57:15,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:57:15,496 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-03 20:57:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:16,389 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-03 20:57:16,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:57:16,390 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-03 20:57:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:16,391 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:57:16,391 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:57:16,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:57:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:57:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 20:57:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:57:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 20:57:16,399 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-03 20:57:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:16,400 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 20:57:16,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:57:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 20:57:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:57:16,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:16,401 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:16,401 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-03 20:57:16,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:16,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:16,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:16,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:16,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:17,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:17,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:17,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:17,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:17,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:17,146 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:17,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:17,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:25,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:57:25,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:25,724 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 20:57:25,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:25,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:28,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:28,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-03 20:57:28,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:28,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:57:28,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:57:28,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:57:28,304 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-03 20:57:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:29,292 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 20:57:29,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:57:29,293 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-03 20:57:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:29,294 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:57:29,294 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:57:29,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:57:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:57:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:57:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:57:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-03 20:57:29,297 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-03 20:57:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:29,298 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-03 20:57:29,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:57:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-03 20:57:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 20:57:29,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:29,299 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:29,299 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:29,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-03 20:57:29,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:29,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:29,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:30,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:30,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:30,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:30,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:30,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:30,095 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:30,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:30,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:30,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:30,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:30,137 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 20:57:30,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:30,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:32,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:32,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-09-03 20:57:32,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:32,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:57:32,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:57:32,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:57:32,786 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-03 20:57:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:33,801 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 20:57:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:57:33,802 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-03 20:57:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:33,803 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:57:33,803 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:57:33,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:57:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:57:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-03 20:57:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 20:57:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 20:57:33,806 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-03 20:57:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:33,806 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 20:57:33,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:57:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 20:57:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:57:33,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:33,807 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:33,807 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:33,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:33,807 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-03 20:57:33,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:33,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:33,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:33,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:33,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:34,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:34,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:34,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:34,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:34,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:34,760 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:34,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:34,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:34,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:57:34,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:34,843 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:37,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:37,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-03 20:57:37,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:37,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:57:37,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:57:37,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:57:37,624 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-03 20:57:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:38,706 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 20:57:38,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:57:38,706 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-03 20:57:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:38,707 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:57:38,707 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:57:38,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:57:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:57:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-03 20:57:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 20:57:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-03 20:57:38,710 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-03 20:57:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:38,710 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-03 20:57:38,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:57:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-03 20:57:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:57:38,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:38,711 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:38,712 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:38,712 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-03 20:57:38,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:38,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:38,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:38,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:38,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:39,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:39,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:39,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:39,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:39,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:39,582 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:39,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:39,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:16,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 21:00:16,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:21,253 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 21:00:21,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:21,326 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:24,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:24,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-09-03 21:00:24,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:24,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 21:00:24,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 21:00:24,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 21:00:24,272 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 39 states. [2019-09-03 21:00:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:25,356 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-03 21:00:25,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 21:00:25,356 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 45 [2019-09-03 21:00:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:25,357 INFO L225 Difference]: With dead ends: 47 [2019-09-03 21:00:25,357 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 21:00:25,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 21:00:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 21:00:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-03 21:00:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 21:00:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 21:00:25,360 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-09-03 21:00:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:25,360 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 21:00:25,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 21:00:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 21:00:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 21:00:25,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:25,361 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:25,361 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:25,361 INFO L82 PathProgramCache]: Analyzing trace with hash -792870402, now seen corresponding path program 36 times [2019-09-03 21:00:25,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:25,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:25,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:25,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:25,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:26,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:26,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:26,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:26,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:26,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:26,333 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:00:26,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:26,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:26,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:26,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:26,383 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 21:00:26,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:26,441 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:29,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:29,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-09-03 21:00:29,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:29,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 21:00:29,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 21:00:29,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1594, Invalid=4258, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 21:00:29,828 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 40 states. [2019-09-03 21:00:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:31,046 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-03 21:00:31,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 21:00:31,047 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 46 [2019-09-03 21:00:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:31,047 INFO L225 Difference]: With dead ends: 48 [2019-09-03 21:00:31,047 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 21:00:31,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1594, Invalid=4258, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 21:00:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 21:00:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-03 21:00:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 21:00:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-09-03 21:00:31,049 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-09-03 21:00:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:31,049 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-09-03 21:00:31,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 21:00:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-09-03 21:00:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 21:00:31,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:31,050 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:31,050 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1227282577, now seen corresponding path program 37 times [2019-09-03 21:00:31,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:31,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:31,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:32,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:32,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:32,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:32,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:32,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:32,033 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:32,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:32,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:32,073 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 21:00:32,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:32,125 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:35,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:35,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-09-03 21:00:35,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:35,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 21:00:35,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 21:00:35,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1675, Invalid=4487, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 21:00:35,876 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 41 states. [2019-09-03 21:00:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:37,173 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-03 21:00:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 21:00:37,174 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 47 [2019-09-03 21:00:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:37,174 INFO L225 Difference]: With dead ends: 49 [2019-09-03 21:00:37,175 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 21:00:37,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1675, Invalid=4487, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 21:00:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 21:00:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-03 21:00:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 21:00:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-03 21:00:37,177 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-09-03 21:00:37,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:37,178 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-03 21:00:37,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 21:00:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-03 21:00:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 21:00:37,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:37,179 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:37,179 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:37,179 INFO L82 PathProgramCache]: Analyzing trace with hash -572484514, now seen corresponding path program 38 times [2019-09-03 21:00:37,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:37,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:37,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:37,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:37,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:38,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:38,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:38,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:38,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:38,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:38,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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:38,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:38,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:20,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 21:02:20,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:20,589 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 21:02:20,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:20,691 INFO L322 TraceCheckSpWp]: Computing backward predicates...